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_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:48:09,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:48:09,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:48:09,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:48:09,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:48:09,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:48:09,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:48:09,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:48:09,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:48:09,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:48:09,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:48:09,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:48:09,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:48:09,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:48:09,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:48:09,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:48:09,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:48:09,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:48:09,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:48:09,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:48:09,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:48:09,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:48:09,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:48:09,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:48:09,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:48:09,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:48:09,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:48:09,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:48:09,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:48:09,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:48:09,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:48:09,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:48:09,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:48:09,640 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:48:09,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:48:09,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:48:09,642 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:09,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:48:09,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:48:09,659 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:48:09,659 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:48:09,659 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:48:09,659 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:48:09,660 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:48:09,660 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:48:09,660 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:48:09,660 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:48:09,660 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:48:09,661 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:48:09,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:48:09,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:48:09,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:48:09,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:48:09,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:48:09,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:48:09,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:48:09,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:48:09,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:48:09,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:48:09,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:48:09,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:48:09,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:48:09,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:48:09,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:48:09,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:48:09,665 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:48:09,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:48:09,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:48:09,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:48:09,665 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:48:09,666 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:48:09,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:48:09,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:48:09,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:48:09,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:48:09,728 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:48:09,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 12:48:09,791 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c00f7cfb/c16c9de6492742d582f915b00923432f/FLAG98908bbba [2018-11-07 12:48:10,346 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:48:10,349 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 12:48:10,363 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c00f7cfb/c16c9de6492742d582f915b00923432f/FLAG98908bbba [2018-11-07 12:48:10,383 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c00f7cfb/c16c9de6492742d582f915b00923432f [2018-11-07 12:48:10,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:48:10,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:48:10,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:48:10,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:48:10,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:48:10,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:48:10" (1/1) ... [2018-11-07 12:48:10,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bc53f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:10, skipping insertion in model container [2018-11-07 12:48:10,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:48:10" (1/1) ... [2018-11-07 12:48:10,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:48:10,481 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:48:10,941 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:48:10,947 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:48:11,085 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:48:11,105 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:48:11,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:11 WrapperNode [2018-11-07 12:48:11,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:48:11,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:48:11,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:48:11,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:48:11,114 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:11" (1/1) ... [2018-11-07 12:48:11,134 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:11" (1/1) ... [2018-11-07 12:48:11,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:48:11,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:48:11,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:48:11,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:48:11,245 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:11" (1/1) ... [2018-11-07 12:48:11,245 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:11" (1/1) ... [2018-11-07 12:48:11,250 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:11" (1/1) ... [2018-11-07 12:48:11,250 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:11" (1/1) ... [2018-11-07 12:48:11,318 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:11" (1/1) ... [2018-11-07 12:48:11,341 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:11" (1/1) ... [2018-11-07 12:48:11,356 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:11" (1/1) ... [2018-11-07 12:48:11,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:48:11,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:48:11,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:48:11,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:48:11,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:11" (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:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:48:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:48:11,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:48:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:48:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:48:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:48:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:48:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:48:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:48:14,463 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:48:14,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:48:14 BoogieIcfgContainer [2018-11-07 12:48:14,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:48:14,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:48:14,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:48:14,471 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:48:14,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:48:10" (1/3) ... [2018-11-07 12:48:14,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d67be9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:48:14, skipping insertion in model container [2018-11-07 12:48:14,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:11" (2/3) ... [2018-11-07 12:48:14,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d67be9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:48:14, skipping insertion in model container [2018-11-07 12:48:14,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:48:14" (3/3) ... [2018-11-07 12:48:14,475 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 12:48:14,485 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:48:14,496 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:48:14,514 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:48:14,552 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:48:14,552 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:48:14,552 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:48:14,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:48:14,553 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:48:14,555 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:48:14,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:48:14,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:48:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:48:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-07 12:48:14,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:14,610 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:14,614 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:14,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1921053824, now seen corresponding path program 1 times [2018-11-07 12:48:14,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:14,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:14,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:15,286 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:48:15,423 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:15,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:15,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:48:15,427 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:15,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:48:15,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:48:15,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:15,456 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:48:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:17,285 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:48:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:48:17,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-07 12:48:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:17,307 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:48:17,308 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:48:17,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:48:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:48:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:48:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 12:48:17,388 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 102 [2018-11-07 12:48:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:17,389 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 12:48:17,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:48:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 12:48:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 12:48:17,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:17,397 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:17,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:17,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1248804383, now seen corresponding path program 1 times [2018-11-07 12:48:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:17,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:17,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:17,597 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:17,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:17,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:48:17,598 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:17,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:48:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:48:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:48:17,601 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 12:48:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:19,345 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 12:48:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:48:19,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-07 12:48:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:19,353 INFO L225 Difference]: With dead ends: 888 [2018-11-07 12:48:19,353 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 12:48:19,360 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:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 12:48:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 12:48:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 12:48:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 12:48:19,403 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 113 [2018-11-07 12:48:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:19,404 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 12:48:19,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:48:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 12:48:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 12:48:19,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:19,410 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:19,410 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:19,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2079561357, now seen corresponding path program 1 times [2018-11-07 12:48:19,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:19,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:19,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:19,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:19,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-07 12:48:19,712 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [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], [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], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:19,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:19,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:24,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:48:24,009 INFO L272 AbstractInterpreter]: Visited 106 different actions 170 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:24,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:24,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:48:24,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:24,060 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:48:24,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:24,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:48:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:24,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:48:24,398 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:24,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:48:24,785 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:24,819 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-07 12:48:24,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:24,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:48:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:48:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:48:24,821 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-07 12:48:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:26,352 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-11-07 12:48:26,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:48:26,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-07 12:48:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:26,366 INFO L225 Difference]: With dead ends: 1530 [2018-11-07 12:48:26,366 INFO L226 Difference]: Without dead ends: 997 [2018-11-07 12:48:26,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:48:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-07 12:48:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-07 12:48:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-07 12:48:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-11-07 12:48:26,418 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 114 [2018-11-07 12:48:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:26,418 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-11-07 12:48:26,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:48:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-11-07 12:48:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 12:48:26,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:26,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:26,427 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:26,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash 896515303, now seen corresponding path program 1 times [2018-11-07 12:48:26,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:26,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:26,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:26,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:26,430 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:26,757 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:48:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:26,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:26,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:48:26,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:26,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:48:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:48:26,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:26,897 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-11-07 12:48:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:28,821 INFO L93 Difference]: Finished difference Result 2438 states and 3658 transitions. [2018-11-07 12:48:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:48:28,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-07 12:48:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:28,833 INFO L225 Difference]: With dead ends: 2438 [2018-11-07 12:48:28,833 INFO L226 Difference]: Without dead ends: 1447 [2018-11-07 12:48:28,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-11-07 12:48:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2018-11-07 12:48:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-11-07 12:48:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2086 transitions. [2018-11-07 12:48:28,894 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2086 transitions. Word has length 120 [2018-11-07 12:48:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:28,896 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 2086 transitions. [2018-11-07 12:48:28,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:48:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2086 transitions. [2018-11-07 12:48:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 12:48:28,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:28,905 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,906 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:28,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1267173673, now seen corresponding path program 1 times [2018-11-07 12:48:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:28,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:28,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:29,142 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:48:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:29,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:29,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:48:29,194 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:29,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:48:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:48:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:48:29,195 INFO L87 Difference]: Start difference. First operand 1447 states and 2086 transitions. Second operand 6 states. [2018-11-07 12:48:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:30,715 INFO L93 Difference]: Finished difference Result 3031 states and 4481 transitions. [2018-11-07 12:48:30,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:48:30,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-07 12:48:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:30,731 INFO L225 Difference]: With dead ends: 3031 [2018-11-07 12:48:30,731 INFO L226 Difference]: Without dead ends: 1590 [2018-11-07 12:48:30,738 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:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-11-07 12:48:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1540. [2018-11-07 12:48:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-11-07 12:48:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1980 transitions. [2018-11-07 12:48:30,796 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1980 transitions. Word has length 128 [2018-11-07 12:48:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:30,798 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 1980 transitions. [2018-11-07 12:48:30,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:48:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1980 transitions. [2018-11-07 12:48:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 12:48:30,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:30,802 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,802 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:30,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1675141633, now seen corresponding path program 1 times [2018-11-07 12:48:30,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:30,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:30,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:30,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:48:30,978 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:48:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:48:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:30,980 INFO L87 Difference]: Start difference. First operand 1540 states and 1980 transitions. Second operand 3 states. [2018-11-07 12:48:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:32,631 INFO L93 Difference]: Finished difference Result 4456 states and 5895 transitions. [2018-11-07 12:48:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:48:32,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-11-07 12:48:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:32,647 INFO L225 Difference]: With dead ends: 4456 [2018-11-07 12:48:32,647 INFO L226 Difference]: Without dead ends: 2922 [2018-11-07 12:48:32,654 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:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-11-07 12:48:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2914. [2018-11-07 12:48:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2018-11-07 12:48:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3698 transitions. [2018-11-07 12:48:32,726 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3698 transitions. Word has length 129 [2018-11-07 12:48:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:32,727 INFO L480 AbstractCegarLoop]: Abstraction has 2914 states and 3698 transitions. [2018-11-07 12:48:32,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:48:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3698 transitions. [2018-11-07 12:48:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 12:48:32,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:32,737 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:48:32,737 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:32,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash 208675339, now seen corresponding path program 1 times [2018-11-07 12:48:32,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:32,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:32,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:32,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:33,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:33,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:33,001 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-11-07 12:48:33,001 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], [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], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:33,008 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:33,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:36,195 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:48:36,196 INFO L272 AbstractInterpreter]: Visited 105 different actions 170 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:36,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:36,233 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:48:38,132 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 82.5% of their original sizes. [2018-11-07 12:48:38,132 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:48:38,848 INFO L415 sIntCurrentIteration]: We unified 165 AI predicates to 165 [2018-11-07 12:48:38,848 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:48:38,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:38,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-07 12:48:38,849 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:38,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:48:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:48:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:48:38,850 INFO L87 Difference]: Start difference. First operand 2914 states and 3698 transitions. Second operand 12 states. [2018-11-07 12:48:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:57,137 INFO L93 Difference]: Finished difference Result 6510 states and 8436 transitions. [2018-11-07 12:48:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:48:57,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-11-07 12:48:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:57,153 INFO L225 Difference]: With dead ends: 6510 [2018-11-07 12:48:57,153 INFO L226 Difference]: Without dead ends: 3602 [2018-11-07 12:48:57,165 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-07 12:48:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2018-11-07 12:48:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3599. [2018-11-07 12:48:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2018-11-07 12:48:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4469 transitions. [2018-11-07 12:48:57,271 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4469 transitions. Word has length 166 [2018-11-07 12:48:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:57,272 INFO L480 AbstractCegarLoop]: Abstraction has 3599 states and 4469 transitions. [2018-11-07 12:48:57,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:48:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4469 transitions. [2018-11-07 12:48:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-07 12:48:57,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:57,286 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,287 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:57,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2117677329, now seen corresponding path program 1 times [2018-11-07 12:48:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:57,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:57,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:57,289 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:48:57,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:57,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:57,837 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-07 12:48:57,837 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [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], [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], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:57,841 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:57,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:01,643 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:01,643 INFO L272 AbstractInterpreter]: Visited 107 different actions 393 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:01,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:01,652 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:03,056 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 80.16% of their original sizes. [2018-11-07 12:49:03,057 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:03,215 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-07 12:49:03,215 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:03,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:03,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 12:49:03,216 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:03,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:49:03,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:49:03,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:49:03,217 INFO L87 Difference]: Start difference. First operand 3599 states and 4469 transitions. Second operand 10 states. [2018-11-07 12:49:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:14,125 INFO L93 Difference]: Finished difference Result 7343 states and 9386 transitions. [2018-11-07 12:49:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 12:49:14,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-11-07 12:49:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:14,142 INFO L225 Difference]: With dead ends: 7343 [2018-11-07 12:49:14,142 INFO L226 Difference]: Without dead ends: 4435 [2018-11-07 12:49:14,152 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 12:49:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2018-11-07 12:49:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4428. [2018-11-07 12:49:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2018-11-07 12:49:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 5567 transitions. [2018-11-07 12:49:14,257 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 5567 transitions. Word has length 195 [2018-11-07 12:49:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:14,258 INFO L480 AbstractCegarLoop]: Abstraction has 4428 states and 5567 transitions. [2018-11-07 12:49:14,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:49:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 5567 transitions. [2018-11-07 12:49:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 12:49:14,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:14,273 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:49:14,273 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:14,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1122503782, now seen corresponding path program 1 times [2018-11-07 12:49:14,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:14,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:14,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:14,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:14,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:49:14,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:14,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:14,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 12:49:14,521 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [53], [54], [58], [62], [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], [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], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:14,525 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:14,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:18,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:49:18,097 INFO L272 AbstractInterpreter]: Visited 109 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:18,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:18,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:49:18,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:18,106 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:49:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:18,115 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:49:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:18,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 12:49:18,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:49:18,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:49:18,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 12:49:18,647 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:49:18,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 12:49:18,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 12:49:18,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:49:18,649 INFO L87 Difference]: Start difference. First operand 4428 states and 5567 transitions. Second operand 9 states. [2018-11-07 12:49:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:21,723 INFO L93 Difference]: Finished difference Result 11487 states and 15128 transitions. [2018-11-07 12:49:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:49:21,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2018-11-07 12:49:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:21,763 INFO L225 Difference]: With dead ends: 11487 [2018-11-07 12:49:21,763 INFO L226 Difference]: Without dead ends: 7039 [2018-11-07 12:49:21,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:49:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-11-07 12:49:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 6980. [2018-11-07 12:49:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6980 states. [2018-11-07 12:49:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 8974 transitions. [2018-11-07 12:49:21,998 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 8974 transitions. Word has length 219 [2018-11-07 12:49:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:21,999 INFO L480 AbstractCegarLoop]: Abstraction has 6980 states and 8974 transitions. [2018-11-07 12:49:21,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 12:49:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 8974 transitions. [2018-11-07 12:49:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 12:49:22,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:22,038 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 12:49:22,038 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:22,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:22,039 INFO L82 PathProgramCache]: Analyzing trace with hash 889346168, now seen corresponding path program 1 times [2018-11-07 12:49:22,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:22,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:22,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:22,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:22,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 130 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:49:22,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:22,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:22,468 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-07 12:49:22,468 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [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], [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], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:22,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:22,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:26,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:49:26,125 INFO L272 AbstractInterpreter]: Visited 109 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:26,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:26,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:49:26,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:26,133 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:49:26,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:26,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:49:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:26,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 12:49:26,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 12:49:26,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:49:26,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 12:49:26,658 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:49:26,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 12:49:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 12:49:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:49:26,659 INFO L87 Difference]: Start difference. First operand 6980 states and 8974 transitions. Second operand 9 states. [2018-11-07 12:49:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:29,882 INFO L93 Difference]: Finished difference Result 19733 states and 26683 transitions. [2018-11-07 12:49:29,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:49:29,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2018-11-07 12:49:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:29,883 INFO L225 Difference]: With dead ends: 19733 [2018-11-07 12:49:29,883 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:49:29,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:49:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:49:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:49:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:49:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:49:29,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-07 12:49:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:29,962 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:49:29,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 12:49:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:49:29,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:49:29,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:49:30,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:30,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,342 WARN L179 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 230 [2018-11-07 12:49:31,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:31,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:32,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:32,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:32,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:32,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:32,099 WARN L179 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 239 [2018-11-07 12:49:32,772 WARN L179 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-07 12:49:34,453 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 139 DAG size of output: 86 [2018-11-07 12:49:43,016 WARN L179 SmtUtils]: Spent 8.52 s on a formula simplification. DAG size of input: 363 DAG size of output: 149 [2018-11-07 12:49:44,191 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 257 DAG size of output: 98 [2018-11-07 12:49:45,421 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 266 DAG size of output: 98 [2018-11-07 12:49:45,427 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:49:45,427 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a21~0 |old(~a21~0)|)) [2018-11-07 12:49:45,428 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:49:45,428 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:49:45,428 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:49:45,428 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,428 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,428 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:49:45,429 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,430 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,431 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:49:45,434 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:49:45,435 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:49:45,436 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:49:45,438 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,439 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,440 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,444 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:49:45,444 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:49:45,444 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:49:45,444 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:49:45,444 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:49:45,445 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:49:45,446 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,447 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:49:45,451 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:49:45,452 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:49:45,453 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,454 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:49:45,455 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:49:45,456 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (= 15 |old(~a8~0)|)) (.cse24 (= ~a7~0 0)) (.cse22 (= |old(~a8~0)| ~a8~0)) (.cse23 (= |old(~a16~0)| ~a16~0))) (let ((.cse20 (< 0 |old(~a17~0)|)) (.cse17 (and (<= ~a17~0 |old(~a17~0)|) .cse22 .cse23 (= ~a21~0 |old(~a21~0)|))) (.cse9 (< 1 |old(~a17~0)|)) (.cse7 (and (<= 0 ~a17~0) .cse24 (<= 0 ~a20~0) (<= ~a20~0 1))) (.cse10 (< 1 |old(~a20~0)|)) (.cse11 (< |old(~a20~0)| 0)) (.cse12 (< 6 |old(~a16~0)|)) (.cse15 (< |old(~a17~0)| 0)) (.cse3 (not (= |old(~a16~0)| 5))) (.cse19 (< 13 |old(~a8~0)|)) (.cse18 (= 4 |old(~a16~0)|)) (.cse1 (not (= 1 ~a20~0))) (.cse5 (< 6 |calculate_output_#in~input|)) (.cse21 (= ~a20~0 1)) (.cse6 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse2 (= 1 |old(~a20~0)|)) (.cse14 (< |old(~a16~0)| 4)) (.cse8 (not (= 8 ~a12~0))) (.cse13 (not .cse4)) (.cse16 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2) (or .cse1 .cse3 .cse2 .cse4) (or .cse5 .cse6 .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse18) (or .cse19 .cse20 .cse17) (or (= 6 |old(~a16~0)|) .cse19 .cse17) (or .cse17 .cse0 .cse20) (or .cse0 .cse17 .cse4) (or .cse0 .cse2 .cse17) (or .cse5 .cse6 .cse0 .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15 .cse16) (or (and (= ~a17~0 1) .cse21) (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)) (not (= ~z~0 26)) .cse3 .cse16 .cse6 .cse5 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or (and .cse22 .cse23) .cse3 .cse4) (or .cse19 (not .cse18) .cse2 .cse1) (or .cse5 (and .cse24 (= ~a17~0 0) .cse21) (or .cse6 .cse0 (not .cse2) (< 5 |old(~a16~0)|) (not (= 0 |old(~a17~0)|)) .cse14 .cse8) .cse13 .cse16)))) [2018-11-07 12:49:45,456 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:49:45,456 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,456 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,456 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,456 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,456 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:49:45,457 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,458 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,459 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,459 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:49:45,460 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,461 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:49:45,462 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:49:45,463 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:49:45,463 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:49:45,463 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:49:45,463 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:49:45,463 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= |old(~a8~0)| ~a8~0) (= 1 ~a21~0) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~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:49:45,463 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:49:45,464 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 12:49:45,464 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:49:45,464 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:49:45,464 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:49:45,464 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 12:49:45,464 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:49:45,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:49:45 BoogieIcfgContainer [2018-11-07 12:49:45,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:49:45,488 INFO L168 Benchmark]: Toolchain (without parser) took 95092.07 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-07 12:49:45,489 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:49:45,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.21 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:49:45,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:45,498 INFO L168 Benchmark]: Boogie Preprocessor took 136.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:45,499 INFO L168 Benchmark]: RCFGBuilder took 3102.00 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: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:45,499 INFO L168 Benchmark]: TraceAbstraction took 91019.88 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 3.1 GB in the end (delta: -989.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:49:45,513 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 707.21 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 120.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3102.00 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: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91019.88 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 3.1 GB in the end (delta: -989.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: (((((((((((((((((((((((((a8 <= 13 && !(a16 == 6)) || (\old(a16) == a16 && !(a8 == 15))) || !(3 == c)) || (!(a8 == 15) && 1 == a21)) || !(1 == \old(a21))) || (a8 <= 13 && a17 <= 0)) || !(4 == d)) || (!(1 == a20) && 1 == a21)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || (1 == a21 && a17 <= 0)) || !(a12 == 8)) || !(e == 5)) || (1 == a21 && !(a16 == 4))) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 90.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 46.0s AutomataDifference, 0.0s DeadEndRemovalTime, 15.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1864 SDtfs, 6424 SDslu, 1574 SDs, 0 SdLazy, 11193 SolverSat, 1853 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1589 GetRequests, 1479 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6980occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 18.6s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9977599894524315 AbsIntWeakeningRatio, 0.19498607242339833 AbsIntAvgWeakeningVarsNumRemoved, 34.58217270194986 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 142 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 353 PreInvPairs, 715 NumberOfFragments, 891 HoareAnnotationTreeSize, 353 FomulaSimplifications, 21703 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16357 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2608 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038605 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1369/1522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...