java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:04:00,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:04:00,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:04:00,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:04:00,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:04:00,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:04:00,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:04:00,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:04:00,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:04:00,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:04:00,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:04:00,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:04:00,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:04:00,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:04:00,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:04:00,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:04:00,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:04:00,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:04:00,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:04:00,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:04:00,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:04:00,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:04:00,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:04:00,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:04:00,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:04:00,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:04:00,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:04:00,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:04:00,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:04:00,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:04:00,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:04:00,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:04:00,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:04:00,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:04:00,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:04:00,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:04:00,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:04:00,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:04:00,107 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:04:00,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:04:00,108 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:04:00,112 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:04:00,112 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:04:00,112 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:04:00,112 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:04:00,113 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:04:00,113 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:04:00,113 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:04:00,113 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:04:00,113 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:04:00,114 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:04:00,114 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:04:00,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:04:00,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:04:00,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:04:00,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:04:00,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:04:00,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:04:00,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:04:00,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:04:00,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:04:00,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:04:00,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:04:00,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:04:00,118 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:04:00,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:04:00,119 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:04:00,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:04:00,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:04:00,119 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:04:00,119 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:04:00,120 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:04:00,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:04:00,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:04:00,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:04:00,194 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:04:00,195 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:04:00,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c [2018-11-07 20:04:00,254 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea35b3624/eb8c52dd0bec46678ebce5b5ec3d6350/FLAGde0944ffe [2018-11-07 20:04:00,891 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:04:00,894 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c [2018-11-07 20:04:00,911 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea35b3624/eb8c52dd0bec46678ebce5b5ec3d6350/FLAGde0944ffe [2018-11-07 20:04:00,931 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea35b3624/eb8c52dd0bec46678ebce5b5ec3d6350 [2018-11-07 20:04:00,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:04:00,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:04:00,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:04:00,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:04:00,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:04:00,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:04:00" (1/1) ... [2018-11-07 20:04:00,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc7c7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:00, skipping insertion in model container [2018-11-07 20:04:00,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:04:00" (1/1) ... [2018-11-07 20:04:00,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:04:01,045 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:04:01,489 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:04:01,493 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:04:01,653 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:04:01,674 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:04:01,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01 WrapperNode [2018-11-07 20:04:01,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:04:01,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:04:01,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:04:01,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:04:01,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:04:01,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:04:01,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:04:01,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:04:01,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... [2018-11-07 20:04:01,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:04:01,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:04:01,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:04:01,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:04:01,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:04:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:04:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:04:01,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:04:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:04:01,965 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:04:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:04:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:04:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:04:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:04:04,980 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:04:04,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:04:04 BoogieIcfgContainer [2018-11-07 20:04:04,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:04:04,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:04:04,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:04:04,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:04:04,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:04:00" (1/3) ... [2018-11-07 20:04:04,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29061132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:04:04, skipping insertion in model container [2018-11-07 20:04:04,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:04:01" (2/3) ... [2018-11-07 20:04:04,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29061132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:04:04, skipping insertion in model container [2018-11-07 20:04:04,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:04:04" (3/3) ... [2018-11-07 20:04:04,990 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label35_true-unreach-call.c [2018-11-07 20:04:05,002 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:04:05,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:04:05,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:04:05,091 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:04:05,091 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:04:05,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:04:05,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:04:05,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:04:05,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:04:05,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:04:05,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:04:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 20:04:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 20:04:05,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:05,132 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] [2018-11-07 20:04:05,135 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:05,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1718908404, now seen corresponding path program 1 times [2018-11-07 20:04:05,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:05,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:05,638 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:04:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:05,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:05,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:04:05,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:05,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:04:05,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:04:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:04:05,775 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-07 20:04:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:07,553 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-07 20:04:07,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:04:07,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-07 20:04:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:07,576 INFO L225 Difference]: With dead ends: 574 [2018-11-07 20:04:07,576 INFO L226 Difference]: Without dead ends: 356 [2018-11-07 20:04:07,584 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 20:04:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-07 20:04:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-07 20:04:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 20:04:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-07 20:04:07,666 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 58 [2018-11-07 20:04:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:07,667 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-07 20:04:07,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:04:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-07 20:04:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 20:04:07,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:07,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:07,677 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:07,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2064846773, now seen corresponding path program 1 times [2018-11-07 20:04:07,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:07,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:07,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:07,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:07,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:07,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:04:07,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:07,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:04:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:04:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:04:07,996 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-07 20:04:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:10,569 INFO L93 Difference]: Finished difference Result 1287 states and 2312 transitions. [2018-11-07 20:04:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:04:10,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-07 20:04:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:10,580 INFO L225 Difference]: With dead ends: 1287 [2018-11-07 20:04:10,580 INFO L226 Difference]: Without dead ends: 937 [2018-11-07 20:04:10,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:04:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-11-07 20:04:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 924. [2018-11-07 20:04:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-07 20:04:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1441 transitions. [2018-11-07 20:04:10,653 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1441 transitions. Word has length 141 [2018-11-07 20:04:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:10,654 INFO L480 AbstractCegarLoop]: Abstraction has 924 states and 1441 transitions. [2018-11-07 20:04:10,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:04:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1441 transitions. [2018-11-07 20:04:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 20:04:10,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:10,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:10,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:10,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1308524843, now seen corresponding path program 1 times [2018-11-07 20:04:10,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:10,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:10,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:10,975 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:04:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:11,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:11,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:04:11,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:11,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:04:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:04:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:04:11,063 INFO L87 Difference]: Start difference. First operand 924 states and 1441 transitions. Second operand 6 states. [2018-11-07 20:04:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:14,555 INFO L93 Difference]: Finished difference Result 2533 states and 4079 transitions. [2018-11-07 20:04:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:04:14,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-11-07 20:04:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:14,574 INFO L225 Difference]: With dead ends: 2533 [2018-11-07 20:04:14,575 INFO L226 Difference]: Without dead ends: 1615 [2018-11-07 20:04:14,583 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 20:04:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2018-11-07 20:04:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1584. [2018-11-07 20:04:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-11-07 20:04:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2317 transitions. [2018-11-07 20:04:14,656 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2317 transitions. Word has length 157 [2018-11-07 20:04:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:14,657 INFO L480 AbstractCegarLoop]: Abstraction has 1584 states and 2317 transitions. [2018-11-07 20:04:14,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:04:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2317 transitions. [2018-11-07 20:04:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 20:04:14,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:14,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:14,665 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:14,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1203673723, now seen corresponding path program 1 times [2018-11-07 20:04:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:14,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:14,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:14,999 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:04:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:15,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:04:15,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:04:15,337 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:15,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:04:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:04:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:04:15,338 INFO L87 Difference]: Start difference. First operand 1584 states and 2317 transitions. Second operand 6 states. [2018-11-07 20:04:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:16,751 INFO L93 Difference]: Finished difference Result 3504 states and 5314 transitions. [2018-11-07 20:04:16,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:04:16,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-07 20:04:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:16,765 INFO L225 Difference]: With dead ends: 3504 [2018-11-07 20:04:16,766 INFO L226 Difference]: Without dead ends: 1926 [2018-11-07 20:04:16,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:04:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-11-07 20:04:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1885. [2018-11-07 20:04:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-11-07 20:04:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2677 transitions. [2018-11-07 20:04:16,842 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2677 transitions. Word has length 181 [2018-11-07 20:04:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:16,843 INFO L480 AbstractCegarLoop]: Abstraction has 1885 states and 2677 transitions. [2018-11-07 20:04:16,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:04:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2677 transitions. [2018-11-07 20:04:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 20:04:16,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:16,853 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:16,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:16,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1057306172, now seen corresponding path program 1 times [2018-11-07 20:04:16,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:16,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:16,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:16,856 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:17,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:17,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:17,165 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-07 20:04:17,167 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:17,215 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:17,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:17,637 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:18,120 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:04:18,122 INFO L272 AbstractInterpreter]: Visited 91 different actions 260 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:04:18,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:18,156 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:04:18,807 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 75.92% of their original sizes. [2018-11-07 20:04:18,808 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:04:20,046 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-07 20:04:20,046 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:04:20,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:04:20,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-07 20:04:20,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:20,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:04:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:04:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:04:20,049 INFO L87 Difference]: Start difference. First operand 1885 states and 2677 transitions. Second operand 21 states. [2018-11-07 20:04:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:04:55,235 INFO L93 Difference]: Finished difference Result 4586 states and 6624 transitions. [2018-11-07 20:04:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 20:04:55,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 212 [2018-11-07 20:04:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:04:55,250 INFO L225 Difference]: With dead ends: 4586 [2018-11-07 20:04:55,250 INFO L226 Difference]: Without dead ends: 2707 [2018-11-07 20:04:55,260 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 20:04:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2018-11-07 20:04:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2478. [2018-11-07 20:04:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2018-11-07 20:04:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3327 transitions. [2018-11-07 20:04:55,330 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3327 transitions. Word has length 212 [2018-11-07 20:04:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:04:55,331 INFO L480 AbstractCegarLoop]: Abstraction has 2478 states and 3327 transitions. [2018-11-07 20:04:55,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:04:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3327 transitions. [2018-11-07 20:04:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 20:04:55,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:04:55,338 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:04:55,339 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:04:55,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash 71341271, now seen corresponding path program 1 times [2018-11-07 20:04:55,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:04:55,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:55,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:04:55,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:04:55,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:04:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:04:55,754 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 20:04:55,934 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:04:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:04:56,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:04:56,539 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:04:56,539 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 20:04:56,540 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:04:56,544 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:04:56,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:04:56,636 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:04:56,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:04:56,920 INFO L272 AbstractInterpreter]: Visited 91 different actions 516 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:04:56,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:04:56,930 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:04:57,231 INFO L227 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 73.49% of their original sizes. [2018-11-07 20:04:57,232 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:04:57,546 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-11-07 20:04:57,546 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:04:57,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:04:57,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-11-07 20:04:57,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:04:57,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:04:57,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:04:57,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:04:57,548 INFO L87 Difference]: Start difference. First operand 2478 states and 3327 transitions. Second operand 10 states. [2018-11-07 20:05:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:08,547 INFO L93 Difference]: Finished difference Result 5747 states and 8010 transitions. [2018-11-07 20:05:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:05:08,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-11-07 20:05:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:08,562 INFO L225 Difference]: With dead ends: 5747 [2018-11-07 20:05:08,562 INFO L226 Difference]: Without dead ends: 3571 [2018-11-07 20:05:08,575 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:05:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2018-11-07 20:05:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3549. [2018-11-07 20:05:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-11-07 20:05:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4671 transitions. [2018-11-07 20:05:08,665 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4671 transitions. Word has length 221 [2018-11-07 20:05:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:08,666 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 4671 transitions. [2018-11-07 20:05:08,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:05:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4671 transitions. [2018-11-07 20:05:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 20:05:08,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:08,678 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:08,678 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:08,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1459972959, now seen corresponding path program 1 times [2018-11-07 20:05:08,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:08,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:08,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:05:09,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:09,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:09,237 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-11-07 20:05:09,238 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:09,251 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:09,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:09,402 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:09,540 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:09,540 INFO L272 AbstractInterpreter]: Visited 124 different actions 244 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:05:09,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:09,568 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:09,930 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 77.71% of their original sizes. [2018-11-07 20:05:09,930 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:10,309 INFO L415 sIntCurrentIteration]: We unified 256 AI predicates to 256 [2018-11-07 20:05:10,309 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:10,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:10,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 20:05:10,310 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:10,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 20:05:10,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 20:05:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:05:10,311 INFO L87 Difference]: Start difference. First operand 3549 states and 4671 transitions. Second operand 23 states. [2018-11-07 20:05:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:26,916 INFO L93 Difference]: Finished difference Result 8503 states and 11629 transitions. [2018-11-07 20:05:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 20:05:26,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 257 [2018-11-07 20:05:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:26,939 INFO L225 Difference]: With dead ends: 8503 [2018-11-07 20:05:26,939 INFO L226 Difference]: Without dead ends: 5256 [2018-11-07 20:05:26,953 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 281 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 20:05:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2018-11-07 20:05:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 4977. [2018-11-07 20:05:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-11-07 20:05:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6408 transitions. [2018-11-07 20:05:27,088 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6408 transitions. Word has length 257 [2018-11-07 20:05:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:27,088 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6408 transitions. [2018-11-07 20:05:27,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 20:05:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6408 transitions. [2018-11-07 20:05:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-07 20:05:27,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:27,108 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:27,108 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash 448502676, now seen corresponding path program 1 times [2018-11-07 20:05:27,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:27,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 229 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:05:27,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:27,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:27,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-11-07 20:05:27,589 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:27,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:27,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:27,644 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:27,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:27,896 INFO L272 AbstractInterpreter]: Visited 92 different actions 450 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:05:27,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:27,904 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:28,180 INFO L227 lantSequenceWeakener]: Weakened 291 states. On average, predicates are now at 73.33% of their original sizes. [2018-11-07 20:05:28,181 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:28,970 INFO L415 sIntCurrentIteration]: We unified 293 AI predicates to 293 [2018-11-07 20:05:28,971 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:28,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:28,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-07 20:05:28,971 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:28,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:05:28,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:05:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:05:28,973 INFO L87 Difference]: Start difference. First operand 4977 states and 6408 transitions. Second operand 10 states. [2018-11-07 20:05:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:34,417 INFO L93 Difference]: Finished difference Result 11123 states and 14607 transitions. [2018-11-07 20:05:34,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:05:34,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 294 [2018-11-07 20:05:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:34,445 INFO L225 Difference]: With dead ends: 11123 [2018-11-07 20:05:34,445 INFO L226 Difference]: Without dead ends: 6746 [2018-11-07 20:05:34,460 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:05:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2018-11-07 20:05:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6695. [2018-11-07 20:05:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6695 states. [2018-11-07 20:05:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 8488 transitions. [2018-11-07 20:05:34,621 INFO L78 Accepts]: Start accepts. Automaton has 6695 states and 8488 transitions. Word has length 294 [2018-11-07 20:05:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:34,622 INFO L480 AbstractCegarLoop]: Abstraction has 6695 states and 8488 transitions. [2018-11-07 20:05:34,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:05:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6695 states and 8488 transitions. [2018-11-07 20:05:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-07 20:05:34,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:34,643 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:34,644 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:34,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -729266625, now seen corresponding path program 1 times [2018-11-07 20:05:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:34,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:34,940 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:05:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 159 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 20:05:35,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:35,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:35,065 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-11-07 20:05:35,065 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:35,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:35,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:35,121 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:35,302 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:05:35,302 INFO L272 AbstractInterpreter]: Visited 92 different actions 273 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:05:35,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:35,328 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:05:35,658 INFO L227 lantSequenceWeakener]: Weakened 296 states. On average, predicates are now at 75.72% of their original sizes. [2018-11-07 20:05:35,658 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:05:35,736 INFO L415 sIntCurrentIteration]: We unified 298 AI predicates to 298 [2018-11-07 20:05:35,737 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:05:35,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:05:35,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 20:05:35,737 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:35,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:05:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:05:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:05:35,738 INFO L87 Difference]: Start difference. First operand 6695 states and 8488 transitions. Second operand 10 states. [2018-11-07 20:05:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:41,306 INFO L93 Difference]: Finished difference Result 16038 states and 20775 transitions. [2018-11-07 20:05:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:05:41,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2018-11-07 20:05:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:41,345 INFO L225 Difference]: With dead ends: 16038 [2018-11-07 20:05:41,345 INFO L226 Difference]: Without dead ends: 9943 [2018-11-07 20:05:41,368 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:05:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9943 states. [2018-11-07 20:05:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9943 to 9843. [2018-11-07 20:05:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9843 states. [2018-11-07 20:05:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12399 transitions. [2018-11-07 20:05:41,586 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12399 transitions. Word has length 299 [2018-11-07 20:05:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:41,586 INFO L480 AbstractCegarLoop]: Abstraction has 9843 states and 12399 transitions. [2018-11-07 20:05:41,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:05:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12399 transitions. [2018-11-07 20:05:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-07 20:05:41,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:41,614 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:05:41,614 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:41,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 697597427, now seen corresponding path program 1 times [2018-11-07 20:05:41,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:41,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:41,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:41,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:41,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:41,890 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:05:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 159 proven. 159 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:05:42,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:42,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:05:42,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-11-07 20:05:42,661 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 20:05:42,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:05:42,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:05:42,694 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:05:42,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:05:42,966 INFO L272 AbstractInterpreter]: Visited 98 different actions 479 times. Merged at 8 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:05:42,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:42,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:05:42,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:05:42,973 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:05:42,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:42,983 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:05:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:43,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:05:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 342 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 20:05:43,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:05:43,745 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 20:05:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 236 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:05:44,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:05:44,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 20:05:44,305 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:05:44,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:05:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:05:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 20:05:44,307 INFO L87 Difference]: Start difference. First operand 9843 states and 12399 transitions. Second operand 11 states. [2018-11-07 20:05:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:49,519 INFO L93 Difference]: Finished difference Result 18897 states and 24878 transitions. [2018-11-07 20:05:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 20:05:49,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 309 [2018-11-07 20:05:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:49,547 INFO L225 Difference]: With dead ends: 18897 [2018-11-07 20:05:49,547 INFO L226 Difference]: Without dead ends: 5197 [2018-11-07 20:05:49,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 625 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:05:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2018-11-07 20:05:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4387. [2018-11-07 20:05:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4387 states. [2018-11-07 20:05:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 5122 transitions. [2018-11-07 20:05:49,744 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 5122 transitions. Word has length 309 [2018-11-07 20:05:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:49,744 INFO L480 AbstractCegarLoop]: Abstraction has 4387 states and 5122 transitions. [2018-11-07 20:05:49,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:05:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 5122 transitions. [2018-11-07 20:05:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-07 20:05:49,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:49,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:05:49,759 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:49,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1691878277, now seen corresponding path program 1 times [2018-11-07 20:05:49,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:49,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:49,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:05:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-07 20:05:50,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:05:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:05:50,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:05:50,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:05:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:05:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:05:50,101 INFO L87 Difference]: Start difference. First operand 4387 states and 5122 transitions. Second operand 4 states. [2018-11-07 20:05:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:05:51,665 INFO L93 Difference]: Finished difference Result 9366 states and 10978 transitions. [2018-11-07 20:05:51,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:05:51,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-11-07 20:05:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:05:51,667 INFO L225 Difference]: With dead ends: 9366 [2018-11-07 20:05:51,668 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:05:51,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:05:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:05:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:05:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:05:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:05:51,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 345 [2018-11-07 20:05:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:05:51,683 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:05:51,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:05:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:05:51,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:05:51,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:05:51,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,418 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 226 [2018-11-07 20:05:52,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:05:52,730 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 179 [2018-11-07 20:05:53,394 WARN L179 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-11-07 20:05:53,734 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2018-11-07 20:05:56,068 WARN L179 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 291 DAG size of output: 47 [2018-11-07 20:05:57,113 WARN L179 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 62 [2018-11-07 20:05:58,390 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 192 DAG size of output: 65 [2018-11-07 20:05:58,393 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:05:58,393 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-07 20:05:58,393 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:05:58,393 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-07 20:05:58,394 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-07 20:05:58,395 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-07 20:05:58,396 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-07 20:05:58,397 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,398 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-07 20:05:58,400 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:05:58,400 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:05:58,400 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:05:58,400 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,401 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:05:58,402 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,403 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,404 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,406 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-07 20:05:58,407 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,408 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:05:58,409 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,410 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:05:58,411 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,412 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:05:58,413 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-07 20:05:58,414 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse3 (= |old(~a19~0)| ~a19~0)) (.cse4 (= |old(~a10~0)| ~a10~0)) (.cse2 (= ~a1~0 |old(~a1~0)|))) (let ((.cse0 (= 3 |old(~a10~0)|)) (.cse1 (and .cse3 .cse4 .cse2)) (.cse5 (= 7 |old(~a19~0)|))) (and (or .cse0 (= 4 |old(~a10~0)|) .cse1) (or (< 6 |calculate_output_#in~input|) (< |calculate_output_#in~input| 2) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (and .cse2 .cse3 .cse4)) (or (or .cse0 .cse5 (= 10 |old(~a19~0)|)) .cse1) (or .cse1 .cse5 (< 8 |old(~a19~0)|) (= 8 |old(~a19~0)|))))) [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,415 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-07 20:05:58,416 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,417 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:05:58,418 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,419 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:05:58,420 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-07 20:05:58,421 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:05:58,422 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-07 20:05:58,422 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:05:58,422 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:05:58,422 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (and (= |old(~a10~0)| ~a10~0) (= ~a19~0 9) (= ~a1~0 23)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-07 20:05:58,422 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:05:58,422 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 3))) (.cse1 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (and (<= main_~input~0 6) (<= 9 ~a19~0) (<= ~a19~0 |old(~a19~0)|) (<= 2 main_~input~0)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (and .cse0 (not (= 4 ~a10~0))) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse1 (not (= ~a19~0 10))) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-07 20:05:58,423 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-07 20:05:58,423 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-07 20:05:58,423 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-07 20:05:58,423 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 3))) (.cse1 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (and .cse0 (not (= 4 ~a10~0))) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse1 (not (= ~a19~0 10))) (not (= 4 ~inputD~0)) (and (<= 9 ~a19~0) (<= ~a19~0 |old(~a19~0)|)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-07 20:05:58,423 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-07 20:05:58,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:05:58 BoogieIcfgContainer [2018-11-07 20:05:58,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:05:58,437 INFO L168 Benchmark]: Toolchain (without parser) took 117494.00 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -512.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 20:05:58,438 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:05:58,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.22 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 20:05:58,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:05:58,441 INFO L168 Benchmark]: Boogie Preprocessor took 94.61 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:05:58,442 INFO L168 Benchmark]: RCFGBuilder took 3083.28 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: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2018-11-07 20:05:58,442 INFO L168 Benchmark]: TraceAbstraction took 113454.02 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 165.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 20:05:58,448 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.25 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 730.22 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 126.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.61 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3083.28 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: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113454.02 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 165.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 157]: 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: 582]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(a1) == 23) || !(inputF == 6)) || !(\old(a10) == 0)) || !(a12 == 0)) || (!(a10 == 3) && !(4 == a10))) || ((!(a19 == 7) && !(a19 == 8)) && a19 <= 8)) || ((!(a10 == 3) && !(a19 == 7)) && !(a19 == 10))) || !(4 == inputD)) || (9 <= a19 && a19 <= \old(a19))) || !(inputE == 5)) || !(14 == a4)) || !(3 == inputC)) || !(2 == inputB)) || !(\old(a19) == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 113.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 90.2s AutomataDifference, 0.0s DeadEndRemovalTime, 6.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1395 SDtfs, 11297 SDslu, 2472 SDs, 0 SdLazy, 16278 SolverSat, 2660 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2036 GetRequests, 1851 SyntacticMatches, 8 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9843occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9966112704550204 AbsIntWeakeningRatio, 0.1111111111111111 AbsIntAvgWeakeningVarsNumRemoved, 19.426447574334897 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 193 PreInvPairs, 295 NumberOfFragments, 354 HoareAnnotationTreeSize, 193 FomulaSimplifications, 34900 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17184 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2783 NumberOfCodeBlocks, 2783 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3079 ConstructedInterpolants, 0 QuantifiedInterpolants, 3063679 SizeOfPredicates, 1 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 2581/3056 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...