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/Problem02_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:47:43,394 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:47:43,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:47:43,413 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:47:43,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:47:43,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:47:43,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:47:43,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:47:43,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:47:43,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:47:43,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:47:43,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:47:43,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:47:43,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:47:43,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:47:43,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:47:43,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:47:43,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:47:43,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:47:43,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:47:43,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:47:43,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:47:43,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:47:43,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:47:43,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:47:43,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:47:43,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:47:43,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:47:43,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:47:43,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:47:43,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:47:43,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:47:43,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:47:43,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:47:43,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:47:43,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:47:43,446 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 18:47:43,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:47:43,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:47:43,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:47:43,470 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:47:43,470 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:47:43,471 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:47:43,472 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:47:43,472 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:47:43,472 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:47:43,472 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:47:43,472 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:47:43,473 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:47:43,473 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:47:43,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:47:43,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:47:43,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:47:43,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:47:43,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:47:43,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:47:43,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:47:43,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:47:43,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:47:43,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:47:43,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:47:43,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:47:43,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:47:43,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:47:43,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:47:43,479 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:47:43,479 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:47:43,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:47:43,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:47:43,480 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:47:43,480 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:47:43,480 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:47:43,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:47:43,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:47:43,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:47:43,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:47:43,563 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:47:43,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-11-07 18:47:43,631 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f04811/9ce2e997029c4fc7af4bb5b29984b8fc/FLAGf540079fe [2018-11-07 18:47:44,211 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:47:44,212 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-11-07 18:47:44,236 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f04811/9ce2e997029c4fc7af4bb5b29984b8fc/FLAGf540079fe [2018-11-07 18:47:44,255 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f04811/9ce2e997029c4fc7af4bb5b29984b8fc [2018-11-07 18:47:44,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:47:44,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:47:44,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:47:44,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:47:44,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:47:44,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:44,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f964c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44, skipping insertion in model container [2018-11-07 18:47:44,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:44,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:47:44,349 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:47:44,754 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:47:44,763 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:47:44,879 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:47:44,906 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:47:44,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44 WrapperNode [2018-11-07 18:47:44,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:47:44,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:47:44,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:47:44,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:47:44,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:47:45,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:47:45,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:47:45,038 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:47:45,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2018-11-07 18:47:45,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:47:45,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:47:45,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:47:45,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:47:45,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (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 18:47:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:47:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:47:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:47:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:47:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:47:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:47:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:47:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:47:45,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:47:48,808 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:47:48,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:48 BoogieIcfgContainer [2018-11-07 18:47:48,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:47:48,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:47:48,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:47:48,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:47:48,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:47:44" (1/3) ... [2018-11-07 18:47:48,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e93d0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:48, skipping insertion in model container [2018-11-07 18:47:48,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (2/3) ... [2018-11-07 18:47:48,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e93d0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:48, skipping insertion in model container [2018-11-07 18:47:48,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:48" (3/3) ... [2018-11-07 18:47:48,818 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-11-07 18:47:48,828 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:47:48,836 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:47:48,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:47:48,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:47:48,891 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:47:48,892 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:47:48,892 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:47:48,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:47:48,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:47:48,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:47:48,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:47:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 18:47:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 18:47:48,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:48,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:48,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:48,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-11-07 18:47:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:49,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:49,611 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:47:49,771 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 18:47:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:47:49,776 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:49,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:47:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:47:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:47:49,802 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 18:47:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:51,403 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-11-07 18:47:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:47:51,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-07 18:47:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:51,429 INFO L225 Difference]: With dead ends: 627 [2018-11-07 18:47:51,430 INFO L226 Difference]: Without dead ends: 388 [2018-11-07 18:47:51,437 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 18:47:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-07 18:47:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-11-07 18:47:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-07 18:47:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-11-07 18:47:51,522 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-11-07 18:47:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:51,524 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-11-07 18:47:51,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:47:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-11-07 18:47:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 18:47:51,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:51,533 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:51,534 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:51,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-11-07 18:47:51,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:51,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:52,006 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 18:47:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:52,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:52,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:52,101 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:52,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:52,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:52,105 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-11-07 18:47:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:54,022 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-11-07 18:47:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:54,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-07 18:47:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:54,028 INFO L225 Difference]: With dead ends: 905 [2018-11-07 18:47:54,028 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 18:47:54,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 18:47:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 18:47:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 18:47:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-11-07 18:47:54,083 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-11-07 18:47:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:54,083 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-11-07 18:47:54,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-11-07 18:47:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 18:47:54,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:54,087 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:54,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:54,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-11-07 18:47:54,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:54,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:54,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:54,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:54,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:47:54,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:54,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:47:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:47:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:47:54,234 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-11-07 18:47:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:57,164 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-11-07 18:47:57,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 18:47:57,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-11-07 18:47:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:57,173 INFO L225 Difference]: With dead ends: 1241 [2018-11-07 18:47:57,174 INFO L226 Difference]: Without dead ends: 865 [2018-11-07 18:47:57,177 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:47:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-07 18:47:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-11-07 18:47:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-07 18:47:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-11-07 18:47:57,249 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-11-07 18:47:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:57,250 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-11-07 18:47:57,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:47:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-11-07 18:47:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 18:47:57,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:57,254 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:57,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-11-07 18:47:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:57,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:57,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:57,545 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:47:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:57,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:47:57,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:57,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:47:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:47:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:47:57,615 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-11-07 18:48:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:00,049 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-11-07 18:48:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:48:00,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-07 18:48:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:00,064 INFO L225 Difference]: With dead ends: 2297 [2018-11-07 18:48:00,064 INFO L226 Difference]: Without dead ends: 1485 [2018-11-07 18:48:00,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:48:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-11-07 18:48:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-11-07 18:48:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-11-07 18:48:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-11-07 18:48:00,137 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-11-07 18:48:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:00,137 INFO L480 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-11-07 18:48:00,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:48:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-11-07 18:48:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 18:48:00,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:00,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:00,144 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:00,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:00,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-11-07 18:48:00,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:00,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:48:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:48:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:48:00,503 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:48:00,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:48:00,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:48:00,504 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-11-07 18:48:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:01,485 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-11-07 18:48:01,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:48:01,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-07 18:48:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:01,497 INFO L225 Difference]: With dead ends: 3050 [2018-11-07 18:48:01,497 INFO L226 Difference]: Without dead ends: 1430 [2018-11-07 18:48:01,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:48:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-11-07 18:48:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-11-07 18:48:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-11-07 18:48:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-11-07 18:48:01,547 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-11-07 18:48:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:01,547 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-11-07 18:48:01,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:48:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-11-07 18:48:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-07 18:48:01,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:01,554 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:01,554 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:01,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-11-07 18:48:01,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:01,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:01,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:48:02,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:02,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:02,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-07 18:48:02,128 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:02,197 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:02,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:04,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:48:04,114 INFO L272 AbstractInterpreter]: Visited 116 different actions 342 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 18:48:04,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:04,167 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:48:04,792 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 80.82% of their original sizes. [2018-11-07 18:48:04,792 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:48:05,527 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-07 18:48:05,527 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:48:05,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:48:05,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-07 18:48:05,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:05,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:48:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:48:05,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:48:05,530 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 11 states. [2018-11-07 18:48:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:21,390 INFO L93 Difference]: Finished difference Result 4506 states and 7188 transitions. [2018-11-07 18:48:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:48:21,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2018-11-07 18:48:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:21,407 INFO L225 Difference]: With dead ends: 4506 [2018-11-07 18:48:21,408 INFO L226 Difference]: Without dead ends: 3082 [2018-11-07 18:48:21,417 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-07 18:48:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2018-11-07 18:48:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3062. [2018-11-07 18:48:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2018-11-07 18:48:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4328 transitions. [2018-11-07 18:48:21,525 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4328 transitions. Word has length 163 [2018-11-07 18:48:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:21,526 INFO L480 AbstractCegarLoop]: Abstraction has 3062 states and 4328 transitions. [2018-11-07 18:48:21,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:48:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4328 transitions. [2018-11-07 18:48:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 18:48:21,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:21,538 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:21,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:21,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1136314147, now seen corresponding path program 1 times [2018-11-07 18:48:21,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:21,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 93 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 18:48:21,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:21,762 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:21,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-11-07 18:48:21,762 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [151], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:21,768 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:21,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:22,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:48:22,334 INFO L272 AbstractInterpreter]: Visited 118 different actions 354 times. Merged at 8 different actions 24 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:48:22,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:22,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:48:22,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:22,342 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 18:48:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:22,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:48:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:22,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:48:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:48:22,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:48:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:48:23,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:48:23,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:48:23,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:48:23,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:48:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:48:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:48:23,172 INFO L87 Difference]: Start difference. First operand 3062 states and 4328 transitions. Second operand 11 states. [2018-11-07 18:48:23,903 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-07 18:48:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:32,014 INFO L93 Difference]: Finished difference Result 11149 states and 16667 transitions. [2018-11-07 18:48:32,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:48:32,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 191 [2018-11-07 18:48:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:32,039 INFO L225 Difference]: With dead ends: 11149 [2018-11-07 18:48:32,039 INFO L226 Difference]: Without dead ends: 5294 [2018-11-07 18:48:32,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 392 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:48:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2018-11-07 18:48:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 4909. [2018-11-07 18:48:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4909 states. [2018-11-07 18:48:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 5911 transitions. [2018-11-07 18:48:32,199 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 5911 transitions. Word has length 191 [2018-11-07 18:48:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:32,200 INFO L480 AbstractCegarLoop]: Abstraction has 4909 states and 5911 transitions. [2018-11-07 18:48:32,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:48:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 5911 transitions. [2018-11-07 18:48:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 18:48:32,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:32,213 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:32,213 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:32,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1262987757, now seen corresponding path program 1 times [2018-11-07 18:48:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:32,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:32,215 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:32,446 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:48:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 115 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 18:48:32,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:32,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:32,790 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 18:48:32,790 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:32,796 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:32,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:33,440 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:48:33,440 INFO L272 AbstractInterpreter]: Visited 118 different actions 232 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:48:33,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:33,478 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:48:34,397 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 81.18% of their original sizes. [2018-11-07 18:48:34,397 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:48:36,641 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-11-07 18:48:36,642 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:48:36,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:48:36,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-07 18:48:36,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:36,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 18:48:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 18:48:36,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:48:36,644 INFO L87 Difference]: Start difference. First operand 4909 states and 5911 transitions. Second operand 16 states. [2018-11-07 18:48:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:56,518 INFO L93 Difference]: Finished difference Result 10549 states and 12649 transitions. [2018-11-07 18:48:56,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 18:48:56,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 221 [2018-11-07 18:48:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:56,543 INFO L225 Difference]: With dead ends: 10549 [2018-11-07 18:48:56,543 INFO L226 Difference]: Without dead ends: 5646 [2018-11-07 18:48:56,555 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-11-07 18:48:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2018-11-07 18:48:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 5496. [2018-11-07 18:48:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2018-11-07 18:48:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 6568 transitions. [2018-11-07 18:48:56,719 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 6568 transitions. Word has length 221 [2018-11-07 18:48:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:56,719 INFO L480 AbstractCegarLoop]: Abstraction has 5496 states and 6568 transitions. [2018-11-07 18:48:56,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 18:48:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 6568 transitions. [2018-11-07 18:48:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 18:48:56,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:56,737 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:56,738 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:56,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash -27762699, now seen corresponding path program 1 times [2018-11-07 18:48:56,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:56,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:56,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:56,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 123 proven. 54 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 18:48:57,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:57,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:57,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-11-07 18:48:57,479 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:57,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:57,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:58,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:48:58,257 INFO L272 AbstractInterpreter]: Visited 119 different actions 473 times. Merged at 9 different actions 33 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:48:58,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:58,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:48:58,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:58,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:48:58,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:58,274 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:48:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:58,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:48:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-07 18:48:58,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:48:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-07 18:48:58,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:48:58,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 18:48:58,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:48:58,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:48:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:48:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:48:58,577 INFO L87 Difference]: Start difference. First operand 5496 states and 6568 transitions. Second operand 9 states. [2018-11-07 18:49:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:49:02,692 INFO L93 Difference]: Finished difference Result 13854 states and 16782 transitions. [2018-11-07 18:49:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 18:49:02,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2018-11-07 18:49:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:49:02,724 INFO L225 Difference]: With dead ends: 13854 [2018-11-07 18:49:02,724 INFO L226 Difference]: Without dead ends: 8208 [2018-11-07 18:49:02,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1435, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 18:49:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2018-11-07 18:49:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 7371. [2018-11-07 18:49:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7371 states. [2018-11-07 18:49:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7371 states to 7371 states and 8314 transitions. [2018-11-07 18:49:02,918 INFO L78 Accepts]: Start accepts. Automaton has 7371 states and 8314 transitions. Word has length 225 [2018-11-07 18:49:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:49:02,918 INFO L480 AbstractCegarLoop]: Abstraction has 7371 states and 8314 transitions. [2018-11-07 18:49:02,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:49:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7371 states and 8314 transitions. [2018-11-07 18:49:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 18:49:02,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:49:02,937 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 18:49:02,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:49:02,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash 416589607, now seen corresponding path program 1 times [2018-11-07 18:49:02,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:49:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:49:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:49:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:49:02,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:49:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 162 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 18:49:03,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:03,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:49:03,403 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-11-07 18:49:03,403 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:49:03,407 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:49:03,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:49:04,203 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:49:04,203 INFO L272 AbstractInterpreter]: Visited 118 different actions 467 times. Merged at 8 different actions 31 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:49:04,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:04,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:49:04,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:04,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:49:04,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:49:04,218 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:49:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:04,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:49:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-07 18:49:04,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:49:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 162 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 18:49:04,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:49:04,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 18:49:04,747 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:49:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:49:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:49:04,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:49:04,748 INFO L87 Difference]: Start difference. First operand 7371 states and 8314 transitions. Second operand 9 states. [2018-11-07 18:49:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:49:08,056 INFO L93 Difference]: Finished difference Result 17869 states and 20338 transitions. [2018-11-07 18:49:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 18:49:08,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 247 [2018-11-07 18:49:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:49:08,080 INFO L225 Difference]: With dead ends: 17869 [2018-11-07 18:49:08,081 INFO L226 Difference]: Without dead ends: 8374 [2018-11-07 18:49:08,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:49:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8374 states. [2018-11-07 18:49:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8374 to 8070. [2018-11-07 18:49:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8070 states. [2018-11-07 18:49:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8070 states to 8070 states and 8795 transitions. [2018-11-07 18:49:08,301 INFO L78 Accepts]: Start accepts. Automaton has 8070 states and 8795 transitions. Word has length 247 [2018-11-07 18:49:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:49:08,302 INFO L480 AbstractCegarLoop]: Abstraction has 8070 states and 8795 transitions. [2018-11-07 18:49:08,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:49:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8070 states and 8795 transitions. [2018-11-07 18:49:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 18:49:08,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:49:08,317 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:49:08,317 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:49:08,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash 595943546, now seen corresponding path program 1 times [2018-11-07 18:49:08,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:49:08,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:49:08,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:49:08,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:49:08,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:49:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:08,613 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:49:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 161 proven. 80 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-07 18:49:08,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:08,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:49:08,667 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-11-07 18:49:08,667 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [275], [278], [282], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:49:08,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:49:08,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:49:09,123 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:49:09,123 INFO L272 AbstractInterpreter]: Visited 118 different actions 352 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:49:09,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:09,130 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:49:09,503 INFO L227 lantSequenceWeakener]: Weakened 270 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-07 18:49:09,503 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:49:09,652 INFO L415 sIntCurrentIteration]: We unified 274 AI predicates to 274 [2018-11-07 18:49:09,652 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:49:09,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:49:09,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-07 18:49:09,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:49:09,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:49:09,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:49:09,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:49:09,654 INFO L87 Difference]: Start difference. First operand 8070 states and 8795 transitions. Second operand 12 states. [2018-11-07 18:49:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:49:14,439 INFO L93 Difference]: Finished difference Result 9191 states and 9974 transitions. [2018-11-07 18:49:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 18:49:14,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2018-11-07 18:49:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:49:14,440 INFO L225 Difference]: With dead ends: 9191 [2018-11-07 18:49:14,441 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:49:14,452 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:49:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:49:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:49:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:49:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:49:14,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2018-11-07 18:49:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:49:14,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:49:14,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:49:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:49:14,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:49:14,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:49:15,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,357 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 214 [2018-11-07 18:49:15,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:15,844 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 228 [2018-11-07 18:49:16,365 WARN L179 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-07 18:49:16,640 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2018-11-07 18:49:27,578 WARN L179 SmtUtils]: Spent 10.92 s on a formula simplification. DAG size of input: 382 DAG size of output: 135 [2018-11-07 18:49:29,934 WARN L179 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 242 DAG size of output: 133 [2018-11-07 18:49:32,276 WARN L179 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 254 DAG size of output: 142 [2018-11-07 18:49:32,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:49:32,281 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a19~0)| ~a19~0) (<= ~a28~0 |old(~a28~0)|) (= ~a11~0 |old(~a11~0)|) (<= |old(~a28~0)| ~a28~0) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 18:49:32,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:49:32,281 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,281 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,281 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 18:49:32,282 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 18:49:32,283 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 18:49:32,284 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 18:49:32,285 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,286 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 18:49:32,287 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,288 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 18:49:32,289 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 18:49:32,290 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 18:49:32,291 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 18:49:32,292 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 18:49:32,293 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 18:49:32,294 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 18:49:32,295 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 18:49:32,296 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 18:49:32,297 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 18:49:32,297 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,297 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,297 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,297 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse7 (= 1 |old(~a25~0)|)) (.cse6 (= 10 |old(~a28~0)|)) (.cse18 (= ~a25~0 1))) (let ((.cse11 (not .cse18)) (.cse19 (= ~a11~0 0)) (.cse22 (= ~a17~0 8)) (.cse27 (<= 8 ~a17~0)) (.cse21 (<= ~a28~0 |old(~a28~0)|)) (.cse33 (= 1 ~a11~0)) (.cse23 (<= |old(~a28~0)| ~a28~0)) (.cse24 (= ~a25~0 |old(~a25~0)|)) (.cse44 (not .cse6)) (.cse26 (not .cse7)) (.cse1 (not (= 1 ~a21~0))) (.cse29 (not (= 1 |old(~a19~0)|))) (.cse30 (< 1 |old(~a25~0)|)) (.cse38 (not (= 0 |old(~a11~0)|))) (.cse31 (< 11 |old(~a28~0)|)) (.cse32 (< |old(~a25~0)| 0)) (.cse39 (< |old(~a28~0)| 7)) (.cse8 (<= ~a17~0 |old(~a17~0)|)) (.cse9 (= |old(~a19~0)| ~a19~0)) (.cse10 (= ~a11~0 |old(~a11~0)|)) (.cse12 (not (= ~a28~0 10)))) (let ((.cse37 (and .cse8 .cse9 .cse10 .cse12)) (.cse15 (and (or .cse1 .cse44 .cse26 .cse38 (not (= 0 |old(~a19~0)|))) (or .cse1 .cse29 .cse30 .cse38 .cse31 .cse32 .cse39))) (.cse3 (< |old(~a17~0)| 8)) (.cse16 (< |old(~a28~0)| 9)) (.cse0 (and .cse8 .cse27 .cse9 .cse21 .cse33 .cse23 .cse24)) (.cse41 (< |old(~a19~0)| 1)) (.cse42 (and .cse9 .cse19 .cse21 .cse22 .cse24)) (.cse2 (< 7 |old(~a28~0)|)) (.cse40 (< |old(~a19~0)| 0)) (.cse4 (< 0 |old(~a19~0)|)) (.cse20 (= ~a19~0 1)) (.cse14 (< 6 |calculate_output_#in~input|)) (.cse25 (< |calculate_output_#in~input| 1)) (.cse43 (and .cse8 .cse9 .cse10 .cse11)) (.cse28 (= |old(~a11~0)| |old(~a19~0)|)) (.cse13 (< 7 |old(~a17~0)|)) (.cse34 (= 1 ~a25~0)) (.cse35 (= 8 ~a17~0)) (.cse36 (= 1 ~a19~0)) (.cse17 (not (= 8 |old(~a17~0)|))) (.cse5 (not (= 1 |old(~a11~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse3 .cse6 .cse0 .cse4 .cse5 .cse7) (or .cse1 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse6 .cse13 .cse7) (or .cse14 .cse15 .cse16 .cse17 (and (or .cse18 (and .cse19 .cse20)) .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse1 .cse2 (not (= |old(~a19~0)| 1)) .cse3 .cse26 (and .cse8 .cse9 .cse21 .cse10 .cse27 .cse24) .cse28) (or .cse14 .cse5 .cse7 (or .cse1 .cse29 .cse30 .cse16 .cse31 .cse32) .cse6 .cse17 (and .cse21 .cse20 .cse23 .cse24 .cse10 .cse22) .cse25) (or .cse1 .cse26 .cse29 .cse17 (and .cse33 .cse34 (= 9 ~a28~0) .cse35 .cse36) (not (= 9 |old(~a28~0)|)) .cse5) (or .cse1 .cse6 .cse37 .cse28 .cse13) (or .cse14 .cse1 .cse38 .cse32 .cse39 .cse40 .cse7 .cse30 .cse6 .cse31 (and .cse9 .cse19 .cse21 .cse22 .cse23 .cse24) .cse17 .cse4 .cse25) (or .cse1 .cse6 .cse37 .cse41 .cse13) (or .cse1 .cse3 .cse0 .cse28 .cse5 .cse41 .cse7) (or (and .cse23 .cse42) (or .cse14 .cse15 .cse26 .cse17 .cse25)) (or .cse1 .cse3 .cse0 .cse6 .cse28 .cse5 .cse41) (or .cse1 .cse3 .cse16 .cse6 .cse4 .cse5 .cse0) (or .cse1 .cse43 .cse41 .cse13 .cse7) (or (and .cse42 .cse23) (or .cse14 .cse1 .cse2 .cse38 .cse32 .cse39 .cse40 .cse30 .cse17 .cse4 .cse25)) (or (and .cse19 .cse22 .cse20 (= ~a28~0 7) .cse24) (or .cse14 .cse1 (not (= 7 |old(~a28~0)|)) .cse38 .cse29 .cse17 (not (= 0 |old(~a25~0)|)) .cse25)) (or .cse1 .cse43 .cse28 .cse13 .cse7) (or .cse1 .cse44 .cse26 .cse29 (and .cse33 .cse34 .cse35 .cse36 (= 10 ~a28~0)) .cse17 .cse5))))) [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 18:49:32,298 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,299 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 18:49:32,300 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 18:49:32,301 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 18:49:32,302 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:49:32,303 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 18:49:32,304 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:49:32,304 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:49:32,304 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 18:49:32,304 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 18:49:32,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:49:32,304 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 18:49:32,304 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:49:32,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:49:32,305 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and (= ~a19~0 1) (= ~a28~0 7) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:49:32,305 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 18:49:32,305 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a28~0 10)) (.cse21 (<= ~a28~0 11)) (.cse22 (<= 0 ~a25~0)) (.cse5 (= ~a11~0 0)) (.cse24 (= ~a19~0 1)) (.cse18 (= ~a21~0 1)) (.cse19 (<= 7 ~a28~0)) (.cse20 (<= ~a25~0 1)) (.cse6 (= ~a25~0 1))) (let ((.cse17 (= 8 ~a17~0)) (.cse15 (not .cse6)) (.cse8 (<= ~a17~0 |old(~a17~0)|)) (.cse10 (= 1 ~a11~0)) (.cse3 (<= 9 ~a28~0)) (.cse0 (<= 1 main_~input~0)) (.cse1 (<= main_~input~0 6)) (.cse7 (and (<= 0 (+ main_~input~0 2147483648)) .cse21 .cse22 .cse5 .cse24 .cse18 .cse19 .cse20 (<= main_~input~0 2147483647))) (.cse11 (not (= ~a19~0 ~a11~0))) (.cse9 (<= ~a28~0 7)) (.cse16 (= 1 ~a25~0)) (.cse23 (<= 0 ~a19~0)) (.cse2 (= ~a17~0 8)) (.cse14 (<= ~a17~0 7)) (.cse12 (<= 1 ~a19~0)) (.cse13 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 (= ~a19~0 0) .cse5 .cse6) .cse7)) (and .cse8 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse10 .cse11) (and .cse14 .cse15 .cse13) (and .cse10 .cse16 (= 9 ~a28~0) .cse17) (and .cse8 (= |old(~a19~0)| ~a19~0) .cse9 .cse16 .cse11) (not .cse18) (not (= ~y~0 25)) (and (<= ~a19~0 0) .cse15 .cse19 .cse20 .cse13 .cse21 .cse22 .cse5 .cse23 .cse2) (and .cse14 .cse15 .cse11) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse14 .cse15 .cse12) (and .cse10 .cse16 .cse17 (= 1 ~a19~0) (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse8 .cse15 .cse12 .cse10 .cse11) (and .cse8 .cse10 .cse15 .cse11 .cse13) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse15 .cse13 (and .cse21 .cse22 .cse2 .cse20) .cse10 .cse3) (not (= |old(~a11~0)| 0)) (and (= (+ main_~output~0 1) 0) (and .cse5 (= ~a25~0 0) .cse24 (= ~a28~0 7)) .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse8 .cse13 .cse10 .cse3 .cse11) (and .cse0 .cse1 .cse7 (<= ~a28~0 |old(~a28~0)|) .cse2) (and .cse14 .cse11 .cse13) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse16 .cse13 .cse21 .cse5 .cse2 .cse24) (not (= ~a~0 1)) (and .cse9 .cse16 .cse19 .cse5 .cse23 (<= ~a19~0 1) .cse2) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)) (and .cse14 .cse12 .cse13)))) [2018-11-07 18:49:32,305 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:49:32,306 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:49:32,306 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse22 (= ~a28~0 10)) (.cse15 (<= ~a28~0 11)) (.cse16 (<= 0 ~a25~0)) (.cse20 (= ~a11~0 0)) (.cse18 (= ~a21~0 1)) (.cse19 (<= 7 ~a28~0)) (.cse17 (<= ~a25~0 1)) (.cse24 (= ~a25~0 1))) (let ((.cse6 (<= ~a28~0 7)) (.cse14 (= 8 ~a17~0)) (.cse12 (not .cse24)) (.cse21 (<= 0 ~a19~0)) (.cse5 (<= ~a17~0 |old(~a17~0)|)) (.cse7 (= 1 ~a11~0)) (.cse3 (<= 9 ~a28~0)) (.cse8 (not (= ~a19~0 ~a11~0))) (.cse0 (<= 1 main_~input~0)) (.cse1 (<= main_~input~0 6)) (.cse13 (= 1 ~a25~0)) (.cse2 (= ~a17~0 8)) (.cse4 (let ((.cse23 (<= 0 (+ main_~input~0 2147483648))) (.cse25 (<= main_~input~0 2147483647))) (or (and .cse23 .cse22 (= ~a19~0 0) .cse20 .cse18 .cse24 .cse25) (and .cse23 .cse15 .cse16 .cse20 (= ~a19~0 1) .cse18 .cse19 .cse17 .cse25)))) (.cse11 (<= ~a17~0 7)) (.cse9 (<= 1 ~a19~0)) (.cse10 (not .cse22))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse5 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse12 .cse10) (and .cse7 .cse13 (= 9 ~a28~0) .cse14) (and .cse5 (= |old(~a19~0)| ~a19~0) .cse6 .cse13 .cse8) (and .cse0 .cse12 .cse1 (and .cse15 .cse16 .cse3 .cse17) .cse10 .cse7 .cse2) (not .cse18) (and .cse6 .cse0 .cse1 .cse19 .cse17 .cse16 .cse20 .cse21 (<= ~a19~0 1) .cse2) (not (= ~y~0 25)) (and .cse11 .cse12 .cse8) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse11 .cse12 .cse9) (and .cse7 .cse13 .cse14 (= 1 ~a19~0) (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse12 .cse9 .cse7 .cse8) (and .cse5 .cse7 .cse12 .cse8 .cse10) (and (<= ~a19~0 0) .cse0 .cse12 .cse1 .cse19 .cse17 .cse10 .cse15 .cse16 .cse20 .cse21 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse5 .cse10 .cse7 .cse3 .cse8) (and .cse11 .cse8 .cse10) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse0 .cse1 .cse13 .cse2 .cse4) (not (= 6 ~f~0)) (and .cse11 .cse9 .cse10)))) [2018-11-07 18:49:32,306 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 18:49:32,306 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 18:49:32,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:49:32 BoogieIcfgContainer [2018-11-07 18:49:32,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:49:32,325 INFO L168 Benchmark]: Toolchain (without parser) took 108058.43 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-07 18:49:32,327 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:49:32,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.96 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 18:49:32,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:49:32,329 INFO L168 Benchmark]: Boogie Preprocessor took 129.75 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-07 18:49:32,329 INFO L168 Benchmark]: RCFGBuilder took 3641.65 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 18:49:32,330 INFO L168 Benchmark]: TraceAbstraction took 103514.55 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 18:49:32,335 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 638.96 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 128.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.75 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3641.65 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 103514.55 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((1 <= input && input <= 6) && a17 == 8) && 9 <= a28) && ((((a28 == 10 && a19 == 0) && a11 == 0) && a25 == 1) || ((((((((0 <= input + 2147483648 && a28 <= 11) && 0 <= a25) && a11 == 0) && a19 == 1) && a21 == 1) && 7 <= a28) && a25 <= 1) && input <= 2147483647))) || (((a17 <= \old(a17) && a28 <= 7) && 1 == a11) && !(a19 == a11))) || ((((a17 <= \old(a17) && 1 <= a19) && !(a28 == 10)) && 1 == a11) && !(a19 == a11))) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 10))) || (((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17)) || ((((a17 <= \old(a17) && \old(a19) == a19) && a28 <= 7) && 1 == a25) && !(a19 == a11))) || !(a21 == 1)) || !(y == 25)) || (((((((((a19 <= 0 && !(a25 == 1)) && 7 <= a28) && a25 <= 1) && !(a28 == 10)) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a17 == 8)) || ((a17 <= 7 && !(a25 == 1)) && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || ((a17 <= 7 && !(a25 == 1)) && 1 <= a19)) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || ((((a17 <= \old(a17) && !(a25 == 1)) && 1 <= a19) && 1 == a11) && !(a19 == a11))) || ((((a17 <= \old(a17) && 1 == a11) && !(a25 == 1)) && !(a19 == a11)) && !(a28 == 10))) || !(21 == u)) || !(22 == v)) || ((((!(a25 == 1) && !(a28 == 10)) && ((a28 <= 11 && 0 <= a25) && a17 == 8) && a25 <= 1) && 1 == a11) && 9 <= a28)) || !(\old(a11) == 0)) || ((output + 1 == 0 && ((a11 == 0 && a25 == 0) && a19 == 1) && a28 == 7) && a17 == 8)) || !(z == 26)) || !(0 == \old(a25))) || ((((a17 <= \old(a17) && !(a28 == 10)) && 1 == a11) && 9 <= a28) && !(a19 == a11))) || ((((1 <= input && input <= 6) && (((((((0 <= input + 2147483648 && a28 <= 11) && 0 <= a25) && a11 == 0) && a19 == 1) && a21 == 1) && 7 <= a28) && a25 <= 1) && input <= 2147483647) && a28 <= \old(a28)) && a17 == 8)) || ((a17 <= 7 && !(a19 == a11)) && !(a28 == 10))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || (((((1 == a25 && !(a28 == 10)) && a28 <= 11) && a11 == 0) && a17 == 8) && a19 == 1)) || !(a == 1)) || ((((((a28 <= 7 && 1 == a25) && 7 <= a28) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(\old(a17) == 8)) || !(6 == f)) || ((a17 <= 7 && 1 <= a19) && !(a28 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 103.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 66.9s AutomataDifference, 0.0s DeadEndRemovalTime, 17.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1394 SDtfs, 13189 SDslu, 2165 SDs, 0 SdLazy, 20019 SolverSat, 3255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2196 GetRequests, 2006 SyntacticMatches, 11 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8070occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9969509079175506 AbsIntWeakeningRatio, 0.1951219512195122 AbsIntAvgWeakeningVarsNumRemoved, 22.496951219512194 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1755 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 257 PreInvPairs, 376 NumberOfFragments, 2077 HoareAnnotationTreeSize, 257 FomulaSimplifications, 18761 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 23837 FormulaSimplificationTreeSizeReductionInter, 16.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534709 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1656 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2099/2355 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...