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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:48:15,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:48:15,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:48:15,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:48:15,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:48:15,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:48:15,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:48:15,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:48:15,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:48:15,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:48:15,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:48:15,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:48:15,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:48:15,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:48:15,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:48:15,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:48:15,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:48:15,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:48:15,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:48:15,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:48:15,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:48:15,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:48:15,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:48:15,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:48:15,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:48:15,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:48:15,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:48:15,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:48:15,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:48:15,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:48:15,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:48:15,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:48:15,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:48:15,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:48:15,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:48:15,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:48:15,723 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.epf [2018-11-07 12:48:15,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:48:15,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:48:15,740 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:48:15,740 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:48:15,740 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:48:15,740 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:48:15,741 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:48:15,741 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:48:15,741 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:48:15,741 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:48:15,741 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:48:15,742 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:48:15,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:48:15,743 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:48:15,743 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:48:15,743 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:48:15,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:48:15,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:48:15,744 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:48:15,744 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:48:15,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:48:15,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:48:15,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:48:15,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:48:15,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:48:15,745 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:48:15,747 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:48:15,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:48:15,748 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:48:15,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:48:15,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:48:15,748 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:48:15,749 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:48:15,749 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:48:15,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:48:15,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:48:15,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:48:15,828 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:48:15,829 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:48:15,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-11-07 12:48:15,889 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd1e85d6/6a3959819f3e4288b9b450761959f70d/FLAGa53520e97 [2018-11-07 12:48:16,451 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:48:16,452 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-11-07 12:48:16,464 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd1e85d6/6a3959819f3e4288b9b450761959f70d/FLAGa53520e97 [2018-11-07 12:48:16,480 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd1e85d6/6a3959819f3e4288b9b450761959f70d [2018-11-07 12:48:16,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:48:16,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:48:16,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:48:16,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:48:16,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:48:16,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:48:16" (1/1) ... [2018-11-07 12:48:16,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a4cddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:16, skipping insertion in model container [2018-11-07 12:48:16,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:48:16" (1/1) ... [2018-11-07 12:48:16,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:48:16,570 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:48:17,117 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:48:17,122 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:48:17,253 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:48:17,274 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:48:17,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17 WrapperNode [2018-11-07 12:48:17,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:48:17,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:48:17,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:48:17,276 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:48:17,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:48:17,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:48:17,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:48:17,424 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:48:17,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (1/1) ... [2018-11-07 12:48:17,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:48:17,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:48:17,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:48:17,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:48:17,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (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 12:48:17,591 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:48:17,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:48:17,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:48:17,592 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:48:17,592 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:48:17,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:48:17,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:48:17,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:48:17,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:48:20,716 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:48:20,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:48:20 BoogieIcfgContainer [2018-11-07 12:48:20,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:48:20,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:48:20,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:48:20,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:48:20,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:48:16" (1/3) ... [2018-11-07 12:48:20,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a41c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:48:20, skipping insertion in model container [2018-11-07 12:48:20,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:17" (2/3) ... [2018-11-07 12:48:20,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a41c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:48:20, skipping insertion in model container [2018-11-07 12:48:20,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:48:20" (3/3) ... [2018-11-07 12:48:20,731 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label27_true-unreach-call_false-termination.c [2018-11-07 12:48:20,742 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:48:20,753 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:48:20,772 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:48:20,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:48:20,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:48:20,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:48:20,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:48:20,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:48:20,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:48:20,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:48:20,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:48:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:48:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 12:48:20,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:20,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:20,875 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:20,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash 933673069, now seen corresponding path program 1 times [2018-11-07 12:48:20,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:20,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:20,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:21,502 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 12:48:21,847 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 12:48:21,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:21,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 12:48:21,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:21,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 12:48:21,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 12:48:21,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 12:48:21,879 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2018-11-07 12:48:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:24,788 INFO L93 Difference]: Finished difference Result 702 states and 1227 transitions. [2018-11-07 12:48:24,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:48:24,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-07 12:48:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:24,813 INFO L225 Difference]: With dead ends: 702 [2018-11-07 12:48:24,813 INFO L226 Difference]: Without dead ends: 488 [2018-11-07 12:48:24,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 12:48:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-07 12:48:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 340. [2018-11-07 12:48:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:48:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 565 transitions. [2018-11-07 12:48:24,908 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 565 transitions. Word has length 95 [2018-11-07 12:48:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:24,909 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 565 transitions. [2018-11-07 12:48:24,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 12:48:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 565 transitions. [2018-11-07 12:48:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 12:48:24,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:24,917 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 12:48:24,917 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:24,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2037295790, now seen corresponding path program 1 times [2018-11-07 12:48:24,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:24,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:24,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:24,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:25,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:25,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:48:25,135 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:25,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:48:25,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:48:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:48:25,138 INFO L87 Difference]: Start difference. First operand 340 states and 565 transitions. Second operand 6 states. [2018-11-07 12:48:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:27,281 INFO L93 Difference]: Finished difference Result 1070 states and 1865 transitions. [2018-11-07 12:48:27,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:48:27,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-11-07 12:48:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:27,291 INFO L225 Difference]: With dead ends: 1070 [2018-11-07 12:48:27,291 INFO L226 Difference]: Without dead ends: 736 [2018-11-07 12:48:27,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:48:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-07 12:48:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 719. [2018-11-07 12:48:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-11-07 12:48:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1163 transitions. [2018-11-07 12:48:27,359 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1163 transitions. Word has length 106 [2018-11-07 12:48:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:27,360 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 1163 transitions. [2018-11-07 12:48:27,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:48:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1163 transitions. [2018-11-07 12:48:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 12:48:27,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:27,370 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 12:48:27,370 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:27,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 420402650, now seen corresponding path program 1 times [2018-11-07 12:48:27,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:27,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:27,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:27,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:48:27,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:27,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:48:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:48:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:27,622 INFO L87 Difference]: Start difference. First operand 719 states and 1163 transitions. Second operand 3 states. [2018-11-07 12:48:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:29,583 INFO L93 Difference]: Finished difference Result 2065 states and 3447 transitions. [2018-11-07 12:48:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:48:29,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-11-07 12:48:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:29,601 INFO L225 Difference]: With dead ends: 2065 [2018-11-07 12:48:29,601 INFO L226 Difference]: Without dead ends: 1352 [2018-11-07 12:48:29,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-11-07 12:48:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1345. [2018-11-07 12:48:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-11-07 12:48:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2085 transitions. [2018-11-07 12:48:29,660 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2085 transitions. Word has length 107 [2018-11-07 12:48:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:29,661 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 2085 transitions. [2018-11-07 12:48:29,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:48:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2085 transitions. [2018-11-07 12:48:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 12:48:29,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:29,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:29,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:29,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash -820743182, now seen corresponding path program 1 times [2018-11-07 12:48:29,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:29,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:29,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:29,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:29,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:29,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:29,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:48:29,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:29,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:48:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:48:29,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:48:29,868 INFO L87 Difference]: Start difference. First operand 1345 states and 2085 transitions. Second operand 6 states. [2018-11-07 12:48:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:31,821 INFO L93 Difference]: Finished difference Result 4143 states and 6680 transitions. [2018-11-07 12:48:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:48:31,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-07 12:48:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:31,850 INFO L225 Difference]: With dead ends: 4143 [2018-11-07 12:48:31,850 INFO L226 Difference]: Without dead ends: 2804 [2018-11-07 12:48:31,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:48:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2018-11-07 12:48:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2778. [2018-11-07 12:48:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-11-07 12:48:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4132 transitions. [2018-11-07 12:48:31,972 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4132 transitions. Word has length 119 [2018-11-07 12:48:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:31,973 INFO L480 AbstractCegarLoop]: Abstraction has 2778 states and 4132 transitions. [2018-11-07 12:48:31,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:48:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4132 transitions. [2018-11-07 12:48:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 12:48:31,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:31,979 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:48:31,980 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:31,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1178183073, now seen corresponding path program 1 times [2018-11-07 12:48:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:31,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:31,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:32,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:32,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:32,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-11-07 12:48:32,204 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:32,255 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:32,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:36,679 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:48:36,681 INFO L272 AbstractInterpreter]: Visited 99 different actions 164 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:48:36,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:36,715 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:48:38,105 INFO L227 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-07 12:48:38,107 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:48:38,402 INFO L415 sIntCurrentIteration]: We unified 130 AI predicates to 130 [2018-11-07 12:48:38,402 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:48:38,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:38,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:48:38,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:38,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:48:38,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:48:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:48:38,405 INFO L87 Difference]: Start difference. First operand 2778 states and 4132 transitions. Second operand 11 states. [2018-11-07 12:48:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:56,732 INFO L93 Difference]: Finished difference Result 6566 states and 9735 transitions. [2018-11-07 12:48:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:48:56,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-11-07 12:48:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:56,751 INFO L225 Difference]: With dead ends: 6566 [2018-11-07 12:48:56,751 INFO L226 Difference]: Without dead ends: 3794 [2018-11-07 12:48:56,764 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:48:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2018-11-07 12:48:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3761. [2018-11-07 12:48:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2018-11-07 12:48:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 5200 transitions. [2018-11-07 12:48:56,870 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 5200 transitions. Word has length 131 [2018-11-07 12:48:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:56,870 INFO L480 AbstractCegarLoop]: Abstraction has 3761 states and 5200 transitions. [2018-11-07 12:48:56,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:48:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 5200 transitions. [2018-11-07 12:48:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 12:48:56,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:56,878 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:56,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:56,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1279739647, now seen corresponding path program 1 times [2018-11-07 12:48:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:56,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:57,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:57,183 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-11-07 12:48:57,184 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:57,188 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:57,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:58,505 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:48:58,505 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:48:58,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:58,533 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:48:59,966 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 80.75% of their original sizes. [2018-11-07 12:48:59,966 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:00,891 INFO L415 sIntCurrentIteration]: We unified 138 AI predicates to 138 [2018-11-07 12:49:00,892 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:00,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:00,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 12:49:00,893 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:00,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 12:49:00,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 12:49:00,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:49:00,894 INFO L87 Difference]: Start difference. First operand 3761 states and 5200 transitions. Second operand 19 states. [2018-11-07 12:49:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:21,963 INFO L93 Difference]: Finished difference Result 7801 states and 10767 transitions. [2018-11-07 12:49:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:49:21,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 139 [2018-11-07 12:49:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:21,981 INFO L225 Difference]: With dead ends: 7801 [2018-11-07 12:49:21,981 INFO L226 Difference]: Without dead ends: 4182 [2018-11-07 12:49:21,992 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 150 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:49:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4182 states. [2018-11-07 12:49:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4182 to 4172. [2018-11-07 12:49:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4172 states. [2018-11-07 12:49:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 5651 transitions. [2018-11-07 12:49:22,100 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 5651 transitions. Word has length 139 [2018-11-07 12:49:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:22,100 INFO L480 AbstractCegarLoop]: Abstraction has 4172 states and 5651 transitions. [2018-11-07 12:49:22,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 12:49:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 5651 transitions. [2018-11-07 12:49:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 12:49:22,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:22,108 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:22,109 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:22,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:22,109 INFO L82 PathProgramCache]: Analyzing trace with hash 630990574, now seen corresponding path program 1 times [2018-11-07 12:49:22,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:22,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:22,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:22,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:22,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 59 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 12:49:22,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:22,307 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:22,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 12:49:22,308 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:22,312 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:22,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:24,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:24,666 INFO L272 AbstractInterpreter]: Visited 100 different actions 271 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:24,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:24,671 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:25,396 INFO L227 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 80.11% of their original sizes. [2018-11-07 12:49:25,396 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:25,479 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-07 12:49:25,479 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:25,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:25,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 12:49:25,480 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:25,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:49:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:49:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:49:25,481 INFO L87 Difference]: Start difference. First operand 4172 states and 5651 transitions. Second operand 10 states. [2018-11-07 12:49:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:31,731 INFO L93 Difference]: Finished difference Result 7965 states and 10913 transitions. [2018-11-07 12:49:31,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:49:31,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 151 [2018-11-07 12:49:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:31,751 INFO L225 Difference]: With dead ends: 7965 [2018-11-07 12:49:31,751 INFO L226 Difference]: Without dead ends: 4346 [2018-11-07 12:49:31,761 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 142 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 12:49:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2018-11-07 12:49:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4048. [2018-11-07 12:49:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4048 states. [2018-11-07 12:49:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5531 transitions. [2018-11-07 12:49:31,869 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5531 transitions. Word has length 151 [2018-11-07 12:49:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:31,870 INFO L480 AbstractCegarLoop]: Abstraction has 4048 states and 5531 transitions. [2018-11-07 12:49:31,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:49:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5531 transitions. [2018-11-07 12:49:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 12:49:31,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:31,878 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:49:31,879 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 798717009, now seen corresponding path program 1 times [2018-11-07 12:49:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:31,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 81 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:49:32,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:32,176 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:32,176 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-11-07 12:49:32,178 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:32,186 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:32,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:36,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:49:36,224 INFO L272 AbstractInterpreter]: Visited 102 different actions 483 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:36,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:36,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:49:36,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:36,237 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 12:49:36,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:36,248 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:49:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:36,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 12:49:36,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 81 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:49:37,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:49:37,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:49:37,670 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:49:37,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:49:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:49:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:49:37,671 INFO L87 Difference]: Start difference. First operand 4048 states and 5531 transitions. Second operand 8 states. [2018-11-07 12:49:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:42,996 INFO L93 Difference]: Finished difference Result 11453 states and 16363 transitions. [2018-11-07 12:49:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:49:43,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2018-11-07 12:49:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:43,040 INFO L225 Difference]: With dead ends: 11453 [2018-11-07 12:49:43,040 INFO L226 Difference]: Without dead ends: 5724 [2018-11-07 12:49:43,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:49:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2018-11-07 12:49:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5434. [2018-11-07 12:49:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5434 states. [2018-11-07 12:49:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 6497 transitions. [2018-11-07 12:49:43,270 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 6497 transitions. Word has length 171 [2018-11-07 12:49:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:43,271 INFO L480 AbstractCegarLoop]: Abstraction has 5434 states and 6497 transitions. [2018-11-07 12:49:43,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:49:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 6497 transitions. [2018-11-07 12:49:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 12:49:43,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:43,284 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, 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] [2018-11-07 12:49:43,285 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:43,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:43,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1834458005, now seen corresponding path program 1 times [2018-11-07 12:49:43,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:43,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:43,289 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:43,982 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 12:49:44,244 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-07 12:49:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 78 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:44,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:44,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:44,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-07 12:49:44,387 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:44,390 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:44,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:47,291 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:47,291 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:49:47,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:47,328 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:49,799 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 80.39% of their original sizes. [2018-11-07 12:49:49,799 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:50,881 INFO L415 sIntCurrentIteration]: We unified 171 AI predicates to 171 [2018-11-07 12:49:50,881 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:50,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:50,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [11] total 35 [2018-11-07 12:49:50,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:50,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 12:49:50,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 12:49:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-11-07 12:49:50,884 INFO L87 Difference]: Start difference. First operand 5434 states and 6497 transitions. Second operand 26 states. [2018-11-07 12:50:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:14,102 INFO L93 Difference]: Finished difference Result 11207 states and 13453 transitions. [2018-11-07 12:50:14,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 12:50:14,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 172 [2018-11-07 12:50:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:14,127 INFO L225 Difference]: With dead ends: 11207 [2018-11-07 12:50:14,127 INFO L226 Difference]: Without dead ends: 5779 [2018-11-07 12:50:14,143 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 141 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 12:50:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2018-11-07 12:50:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5497. [2018-11-07 12:50:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2018-11-07 12:50:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 6564 transitions. [2018-11-07 12:50:14,264 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 6564 transitions. Word has length 172 [2018-11-07 12:50:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:14,265 INFO L480 AbstractCegarLoop]: Abstraction has 5497 states and 6564 transitions. [2018-11-07 12:50:14,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 12:50:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 6564 transitions. [2018-11-07 12:50:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 12:50:14,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:14,275 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 12:50:14,275 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:14,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash -78425096, now seen corresponding path program 1 times [2018-11-07 12:50:14,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:14,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 83 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:50:14,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:14,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:14,485 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-07 12:50:14,485 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:14,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:14,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:19,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:50:19,513 INFO L272 AbstractInterpreter]: Visited 101 different actions 473 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:50:19,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:19,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:50:19,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:19,519 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 12:50:19,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:19,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:50:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:19,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-07 12:50:19,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:50:20,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:50:20,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:50:20,016 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:50:20,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:50:20,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:50:20,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:50:20,018 INFO L87 Difference]: Start difference. First operand 5497 states and 6564 transitions. Second operand 11 states. [2018-11-07 12:50:20,445 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-07 12:50:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:23,217 INFO L93 Difference]: Finished difference Result 17001 states and 21070 transitions. [2018-11-07 12:50:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 12:50:23,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2018-11-07 12:50:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:23,282 INFO L225 Difference]: With dead ends: 17001 [2018-11-07 12:50:23,282 INFO L226 Difference]: Without dead ends: 11709 [2018-11-07 12:50:23,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:50:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11709 states. [2018-11-07 12:50:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11709 to 11500. [2018-11-07 12:50:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11500 states. [2018-11-07 12:50:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11500 states to 11500 states and 13849 transitions. [2018-11-07 12:50:23,967 INFO L78 Accepts]: Start accepts. Automaton has 11500 states and 13849 transitions. Word has length 181 [2018-11-07 12:50:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:23,968 INFO L480 AbstractCegarLoop]: Abstraction has 11500 states and 13849 transitions. [2018-11-07 12:50:23,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:50:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 11500 states and 13849 transitions. [2018-11-07 12:50:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 12:50:23,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:23,988 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 12:50:23,988 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -623201878, now seen corresponding path program 1 times [2018-11-07 12:50:23,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:23,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:23,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:24,577 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 12:50:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 100 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:50:24,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:24,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:24,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-07 12:50:24,791 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:24,794 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:24,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:27,220 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:27,221 INFO L272 AbstractInterpreter]: Visited 100 different actions 265 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:50:27,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:27,227 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:28,342 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-07 12:50:28,343 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:28,429 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-07 12:50:28,429 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:28,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:28,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:50:28,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:28,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:50:28,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:50:28,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:50:28,431 INFO L87 Difference]: Start difference. First operand 11500 states and 13849 transitions. Second operand 11 states. [2018-11-07 12:50:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:35,589 INFO L93 Difference]: Finished difference Result 22938 states and 27679 transitions. [2018-11-07 12:50:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:50:35,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2018-11-07 12:50:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:35,627 INFO L225 Difference]: With dead ends: 22938 [2018-11-07 12:50:35,627 INFO L226 Difference]: Without dead ends: 11781 [2018-11-07 12:50:35,648 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:50:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11781 states. [2018-11-07 12:50:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11781 to 11772. [2018-11-07 12:50:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11772 states. [2018-11-07 12:50:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11772 states to 11772 states and 14125 transitions. [2018-11-07 12:50:35,912 INFO L78 Accepts]: Start accepts. Automaton has 11772 states and 14125 transitions. Word has length 190 [2018-11-07 12:50:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:35,913 INFO L480 AbstractCegarLoop]: Abstraction has 11772 states and 14125 transitions. [2018-11-07 12:50:35,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:50:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11772 states and 14125 transitions. [2018-11-07 12:50:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 12:50:35,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:35,935 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:50:35,935 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:35,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:35,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1990937833, now seen corresponding path program 1 times [2018-11-07 12:50:35,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:35,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:35,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:36,498 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:50:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:50:36,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:36,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:36,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-07 12:50:36,682 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:36,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:36,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:38,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:38,872 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:50:38,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:38,878 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:39,828 INFO L227 lantSequenceWeakener]: Weakened 191 states. On average, predicates are now at 80.05% of their original sizes. [2018-11-07 12:50:39,829 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:39,916 INFO L415 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2018-11-07 12:50:39,917 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:39,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:39,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:50:39,917 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:39,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:50:39,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:50:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:50:39,919 INFO L87 Difference]: Start difference. First operand 11772 states and 14125 transitions. Second operand 11 states. [2018-11-07 12:50:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:49,514 INFO L93 Difference]: Finished difference Result 23066 states and 27769 transitions. [2018-11-07 12:50:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:50:49,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2018-11-07 12:50:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:49,548 INFO L225 Difference]: With dead ends: 23066 [2018-11-07 12:50:49,548 INFO L226 Difference]: Without dead ends: 11911 [2018-11-07 12:50:49,568 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:50:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11911 states. [2018-11-07 12:50:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11911 to 11910. [2018-11-07 12:50:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11910 states. [2018-11-07 12:50:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11910 states to 11910 states and 14270 transitions. [2018-11-07 12:50:49,801 INFO L78 Accepts]: Start accepts. Automaton has 11910 states and 14270 transitions. Word has length 194 [2018-11-07 12:50:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:49,801 INFO L480 AbstractCegarLoop]: Abstraction has 11910 states and 14270 transitions. [2018-11-07 12:50:49,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:50:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11910 states and 14270 transitions. [2018-11-07 12:50:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 12:50:49,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:49,820 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2018-11-07 12:50:49,820 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:49,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1488481622, now seen corresponding path program 1 times [2018-11-07 12:50:49,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:49,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:49,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:49,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:49,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 105 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:50:50,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:50,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:50,095 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-07 12:50:50,095 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:50,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:50,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:53,453 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:53,453 INFO L272 AbstractInterpreter]: Visited 100 different actions 269 times. Merged at 7 different actions 18 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:50:53,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:53,461 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:54,532 INFO L227 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-07 12:50:54,532 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:54,614 INFO L415 sIntCurrentIteration]: We unified 202 AI predicates to 202 [2018-11-07 12:50:54,615 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:54,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:54,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 12:50:54,615 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:54,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:50:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:50:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:50:54,616 INFO L87 Difference]: Start difference. First operand 11910 states and 14270 transitions. Second operand 10 states. [2018-11-07 12:51:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:01,544 INFO L93 Difference]: Finished difference Result 22479 states and 26992 transitions. [2018-11-07 12:51:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:51:01,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 203 [2018-11-07 12:51:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:01,573 INFO L225 Difference]: With dead ends: 22479 [2018-11-07 12:51:01,573 INFO L226 Difference]: Without dead ends: 12900 [2018-11-07 12:51:01,592 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 12:51:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12900 states. [2018-11-07 12:51:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12900 to 12889. [2018-11-07 12:51:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12889 states. [2018-11-07 12:51:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12889 states to 12889 states and 15372 transitions. [2018-11-07 12:51:01,859 INFO L78 Accepts]: Start accepts. Automaton has 12889 states and 15372 transitions. Word has length 203 [2018-11-07 12:51:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:01,860 INFO L480 AbstractCegarLoop]: Abstraction has 12889 states and 15372 transitions. [2018-11-07 12:51:01,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:51:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12889 states and 15372 transitions. [2018-11-07 12:51:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 12:51:01,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:01,880 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, 3, 3, 3, 3, 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] [2018-11-07 12:51:01,880 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:01,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1662569828, now seen corresponding path program 1 times [2018-11-07 12:51:01,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:01,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:01,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:01,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 174 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:02,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:02,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-11-07 12:51:02,503 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:02,505 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:02,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:08,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:51:08,824 INFO L272 AbstractInterpreter]: Visited 101 different actions 775 times. Merged at 8 different actions 74 times. Widened at 1 different actions 4 times. Found 14 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:51:08,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:08,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:51:08,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:08,830 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:51:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:08,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:51:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:08,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:51:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 12:51:09,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:51:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 12:51:09,101 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:09,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:51:09,102 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:09,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:51:09,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:51:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:51:09,105 INFO L87 Difference]: Start difference. First operand 12889 states and 15372 transitions. Second operand 3 states. [2018-11-07 12:51:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:09,786 INFO L93 Difference]: Finished difference Result 23348 states and 28122 transitions. [2018-11-07 12:51:09,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:51:09,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-11-07 12:51:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:09,790 INFO L225 Difference]: With dead ends: 23348 [2018-11-07 12:51:09,790 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:51:09,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:51:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:51:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:51:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:51:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:51:09,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-11-07 12:51:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:09,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:51:09,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:51:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:51:09,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:51:09,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:51:10,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:10,924 WARN L179 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 245 [2018-11-07 12:51:10,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:51:11,372 WARN L179 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 219 [2018-11-07 12:51:12,403 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-11-07 12:51:14,689 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 143 DAG size of output: 86 [2018-11-07 12:51:20,181 WARN L179 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 456 DAG size of output: 123 [2018-11-07 12:51:21,381 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 265 DAG size of output: 105 [2018-11-07 12:51:22,274 WARN L179 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 108 [2018-11-07 12:51:22,277 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:51:22,277 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-11-07 12:51:22,277 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:51:22,277 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,278 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:51:22,279 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:51:22,280 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:51:22,281 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,282 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:51:22,283 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:51:22,284 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:51:22,285 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:51:22,286 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,287 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:51:22,288 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,289 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2018-11-07 12:51:22,290 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:51:22,291 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:51:22,292 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:51:22,292 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:51:22,292 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:51:22,292 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse33 (= 1 |old(~a20~0)|)) (.cse15 (= |old(~a8~0)| ~a8~0)) (.cse23 (= |old(~a20~0)| ~a20~0)) (.cse14 (= |old(~a16~0)| ~a16~0))) (let ((.cse13 (< 15 |old(~a8~0)|)) (.cse6 (< 1 |old(~a20~0)|)) (.cse3 (< |old(~a20~0)| 1)) (.cse20 (and (= 1 ~a7~0) .cse15 .cse23 .cse14)) (.cse5 (< 1 |old(~a17~0)|)) (.cse25 (< |old(~a20~0)| 0)) (.cse11 (< |old(~a17~0)| 0)) (.cse28 (< 0 |old(~a20~0)|)) (.cse1 (not (= 0 |old(~a7~0)|))) (.cse29 (not (= 0 |old(~a17~0)|))) (.cse30 (= ~a17~0 0)) (.cse8 (not (= 15 |old(~a8~0)|))) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse2 (not (= 1 |old(~a21~0)|))) (.cse4 (not (= 8 ~a12~0))) (.cse9 (< 5 |old(~a16~0)|)) (.cse7 (= ~a21~0 1)) (.cse10 (< |old(~a16~0)| 4)) (.cse26 (< |old(~a8~0)| 13)) (.cse12 (< |calculate_output_#in~input| 1)) (.cse24 (= 13 |old(~a8~0)|)) (.cse31 (< 14 |old(~a8~0)|)) (.cse22 (= 6 |old(~a16~0)|)) (.cse19 (< 13 |old(~a8~0)|)) (.cse18 (not .cse33)) (.cse16 (= ~a7~0 |old(~a7~0)|)) (.cse27 (= 1 ~a17~0)) (.cse21 (not (= 1 |old(~a7~0)|))) (.cse32 (and (= |old(~a7~0)| |old(~a20~0)|) .cse33)) (.cse17 (not (= 1 |old(~a17~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse13 (and .cse14 .cse15 (= ~a17~0 1) .cse16 (= ~a20~0 1)) .cse4 .cse17 .cse18 .cse9 .cse10 .cse12) (or .cse19 .cse20 .cse3 .cse21) (or .cse22 .cse19 .cse23) (or .cse0 .cse2 .cse13 .cse24 .cse7 .cse4 .cse6 .cse25 .cse17 .cse9 .cse10 .cse21 .cse26 .cse12) (or .cse27 .cse24 .cse28 .cse17) (or .cse19 .cse27 .cse3 .cse21 .cse17) (or .cse22 .cse19 (and .cse16 .cse15 .cse14)) (or (or .cse1 .cse2 .cse4 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse18 .cse8 .cse29) (and .cse7 .cse30)) (or .cse22 .cse21 .cse31 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse25 .cse8 .cse9 .cse10 .cse11 (and (<= 0 ~a17~0) .cse7 (<= ~a17~0 1)) .cse28 .cse12) (or .cse0 (or .cse1 .cse2 .cse29 (not (= 4 |old(~a16~0)|))) .cse30 .cse4 .cse18 .cse8 .cse12) (or .cse0 .cse2 .cse4 .cse31 .cse17 .cse18 .cse9 .cse7 .cse10 (< 1 |old(~a7~0)|) .cse26 (< |old(~a7~0)| 0) .cse12) (or .cse24 (and .cse16 .cse15 .cse23 .cse14) .cse32) (or .cse27 .cse24 .cse31 .cse32 .cse17) (or .cse22 .cse27 .cse32 .cse17) (or .cse19 .cse18 (and .cse16 .cse15 .cse23 .cse14 .cse27) .cse17) (or .cse27 .cse21 .cse32 (< |old(~a8~0)| 15) .cse17)))) [2018-11-07 12:51:22,292 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:51:22,292 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:51:22,293 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,294 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:51:22,295 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:51:22,296 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:51:22,297 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:51:22,298 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:51:22,299 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= 1 ~a17~0) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:51:22,299 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:51:22,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:51:22,299 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:51:22,299 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:51:22,300 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (or (not (= 1 ~a20~0)) (not (= ~a20~0 ~a7~0)))) (.cse0 (= 1 ~a17~0))) (or (and (not (= ~a16~0 6)) (<= ~a8~0 14)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (<= ~a16~0 5) (= ~a21~0 1) (<= ~a8~0 15) .cse0 (<= 4 ~a16~0)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (<= ~a8~0 13) (= 1 ~a7~0) (<= 1 ~a20~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse1 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= |old(~a20~0)| ~a20~0) .cse1 .cse0) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 12:51:22,300 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:51:22,300 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:51:22,300 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:51:22,300 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (or (not (= 1 ~a20~0)) (not (= ~a20~0 ~a7~0)))) (.cse1 (= 1 ~a17~0))) (or (and (not (= ~a16~0 6)) (<= ~a8~0 14)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (<= ~a8~0 13) (= 1 ~a7~0) (<= 1 ~a20~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= |old(~a20~0)| ~a20~0) .cse0 .cse1) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and (<= ~a16~0 5) (= ~a21~0 1) .cse1 (<= ~a8~0 |old(~a8~0)|) (<= 4 ~a16~0)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 12:51:22,300 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:51:22,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:51:22 BoogieIcfgContainer [2018-11-07 12:51:22,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:51:22,316 INFO L168 Benchmark]: Toolchain (without parser) took 185823.36 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -924.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-07 12:51:22,317 INFO L168 Benchmark]: CDTParser took 0.21 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 12:51:22,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:22,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:22,319 INFO L168 Benchmark]: Boogie Preprocessor took 106.56 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 12:51:22,320 INFO L168 Benchmark]: RCFGBuilder took 3187.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:51:22,320 INFO L168 Benchmark]: TraceAbstraction took 181596.60 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -261.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:51:22,325 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.21 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 780.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 147.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.56 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 3187.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181596.60 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -261.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(a16 == 6) && a8 <= 14) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((a8 <= 13 && 1 == a7) && 1 <= a20)) || !(z == 26)) || !(\old(a16) == 5)) || ((!(1 == a20) || !(a20 == a7)) && !(a8 == 13))) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || ((\old(a20) == a20 && (!(1 == a20) || !(a20 == a7))) && 1 == a17)) || !(23 == w)) || !(a == 1)) || ((((a16 <= 5 && a21 == 1) && 1 == a17) && a8 <= \old(a8)) && 4 <= a16)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 181.4s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 111.3s AutomataDifference, 0.0s DeadEndRemovalTime, 12.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2206 SDtfs, 12721 SDslu, 3130 SDs, 0 SdLazy, 17560 SolverSat, 2504 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 57.4s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2471 GetRequests, 2225 SyntacticMatches, 14 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12889occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 34.5s AbstIntTime, 10 AbstIntIterations, 7 AbstIntStrong, 0.9972260328777637 AbsIntWeakeningRatio, 0.22421142369991476 AbsIntAvgWeakeningVarsNumRemoved, 28.405797101449274 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1341 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 594 PreInvPairs, 830 NumberOfFragments, 1041 HoareAnnotationTreeSize, 594 FomulaSimplifications, 28676 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16177 FormulaSimplificationTreeSizeReductionInter, 10.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2723 NumberOfCodeBlocks, 2723 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1840919 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 1888/2139 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...