java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:22:12,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:22:12,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:22:12,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:22:12,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:22:12,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:22:12,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:22:12,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:22:12,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:22:12,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:22:12,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:22:12,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:22:12,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:22:12,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:22:12,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:22:12,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:22:12,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:22:12,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:22:12,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:22:12,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:22:12,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:22:12,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:22:12,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:22:12,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:22:12,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:22:12,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:22:12,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:22:12,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:22:12,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:22:12,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:22:12,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:22:12,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:22:12,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:22:12,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:22:12,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:22:12,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:22:12,378 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:22:12,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:22:12,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:22:12,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:22:12,396 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:22:12,396 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:22:12,396 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:22:12,396 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:22:12,397 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:22:12,397 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:22:12,397 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:22:12,397 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:22:12,398 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:22:12,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:22:12,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:22:12,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:22:12,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:22:12,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:22:12,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:22:12,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:22:12,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:22:12,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:22:12,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:22:12,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:22:12,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:22:12,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:22:12,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:22:12,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:22:12,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:22:12,402 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:22:12,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:22:12,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:22:12,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:22:12,402 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:22:12,403 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:22:12,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:22:12,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:22:12,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:22:12,462 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:22:12,462 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:22:12,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label30_true-unreach-call_false-termination.c [2018-10-27 12:22:12,521 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/585d9fc3d/fd430516e4f74e138484d91e3260d402/FLAGab86dd89b [2018-10-27 12:22:13,114 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:22:13,123 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label30_true-unreach-call_false-termination.c [2018-10-27 12:22:13,144 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/585d9fc3d/fd430516e4f74e138484d91e3260d402/FLAGab86dd89b [2018-10-27 12:22:13,170 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/585d9fc3d/fd430516e4f74e138484d91e3260d402 [2018-10-27 12:22:13,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:22:13,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:22:13,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:22:13,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:22:13,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:22:13,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:13,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198b661f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13, skipping insertion in model container [2018-10-27 12:22:13,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:13,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:22:13,277 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:22:13,793 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:22:13,798 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:22:13,893 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:22:13,914 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:22:13,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13 WrapperNode [2018-10-27 12:22:13,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:22:13,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:22:13,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:22:13,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:22:13,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:13,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:22:14,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:22:14,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:22:14,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:22:14,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... [2018-10-27 12:22:14,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:22:14,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:22:14,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:22:14,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:22:14,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:22:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:22:14,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:22:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:22:14,274 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:22:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:22:14,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:22:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:22:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:22:17,693 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:22:17,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:22:17 BoogieIcfgContainer [2018-10-27 12:22:17,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:22:17,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:22:17,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:22:17,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:22:17,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:22:13" (1/3) ... [2018-10-27 12:22:17,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed6e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:22:17, skipping insertion in model container [2018-10-27 12:22:17,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:22:13" (2/3) ... [2018-10-27 12:22:17,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed6e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:22:17, skipping insertion in model container [2018-10-27 12:22:17,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:22:17" (3/3) ... [2018-10-27 12:22:17,703 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label30_true-unreach-call_false-termination.c [2018-10-27 12:22:17,714 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:22:17,723 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:22:17,741 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:22:17,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:22:17,782 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:22:17,782 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:22:17,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:22:17,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:22:17,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:22:17,784 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:22:17,784 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:22:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 12:22:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 12:22:17,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:17,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:22:17,833 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:17,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash -564012609, now seen corresponding path program 1 times [2018-10-27 12:22:17,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:17,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:17,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:17,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:18,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:22:18,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:22:18,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:18,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:22:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:22:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:22:18,531 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 12:22:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:20,275 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-27 12:22:20,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:22:20,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-10-27 12:22:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:20,298 INFO L225 Difference]: With dead ends: 618 [2018-10-27 12:22:20,298 INFO L226 Difference]: Without dead ends: 379 [2018-10-27 12:22:20,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:22:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-27 12:22:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-27 12:22:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-27 12:22:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-27 12:22:20,393 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 135 [2018-10-27 12:22:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:20,395 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-27 12:22:20,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:22:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-27 12:22:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 12:22:20,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:20,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:22:20,403 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:20,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1268148278, now seen corresponding path program 1 times [2018-10-27 12:22:20,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:20,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:20,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:22:20,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:22:20,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:20,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:22:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:22:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:22:20,639 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-27 12:22:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:22,700 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-10-27 12:22:22,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:22:22,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-10-27 12:22:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:22,724 INFO L225 Difference]: With dead ends: 1231 [2018-10-27 12:22:22,725 INFO L226 Difference]: Without dead ends: 858 [2018-10-27 12:22:22,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:22:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-10-27 12:22:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-10-27 12:22:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-27 12:22:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-10-27 12:22:22,807 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 151 [2018-10-27 12:22:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:22,808 INFO L481 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-10-27 12:22:22,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:22:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-10-27 12:22:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-27 12:22:22,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:22,814 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:22:22,814 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:22,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1898018613, now seen corresponding path program 1 times [2018-10-27 12:22:22,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:22,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:22,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:22,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:22,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:23,114 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:22:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:23,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:22:23,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:22:23,243 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:23,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:22:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:22:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:22:23,244 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-10-27 12:22:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:27,057 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-10-27 12:22:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:22:27,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-10-27 12:22:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:27,083 INFO L225 Difference]: With dead ends: 2553 [2018-10-27 12:22:27,083 INFO L226 Difference]: Without dead ends: 1738 [2018-10-27 12:22:27,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:22:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-27 12:22:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-10-27 12:22:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-10-27 12:22:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-10-27 12:22:27,178 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 158 [2018-10-27 12:22:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:27,178 INFO L481 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-10-27 12:22:27,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:22:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-10-27 12:22:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 12:22:27,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:27,189 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:22:27,190 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:27,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -622646755, now seen corresponding path program 1 times [2018-10-27 12:22:27,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:27,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:27,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:27,450 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:22:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 12:22:27,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:27,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:27,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-27 12:22:27,534 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [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], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:27,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:27,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:28,365 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:28,366 INFO L272 AbstractInterpreter]: Visited 136 different actions 136 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-27 12:22:28,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:28,410 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:29,027 INFO L227 lantSequenceWeakener]: Weakened 138 states. On average, predicates are now at 81.51% of their original sizes. [2018-10-27 12:22:29,027 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:29,826 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-10-27 12:22:29,827 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:29,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:29,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-27 12:22:29,828 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:29,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 12:22:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 12:22:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:22:29,830 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 14 states. [2018-10-27 12:22:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:42,432 INFO L93 Difference]: Finished difference Result 3652 states and 5496 transitions. [2018-10-27 12:22:42,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 12:22:42,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 160 [2018-10-27 12:22:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:42,443 INFO L225 Difference]: With dead ends: 3652 [2018-10-27 12:22:42,443 INFO L226 Difference]: Without dead ends: 1978 [2018-10-27 12:22:42,450 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:22:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2018-10-27 12:22:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1825. [2018-10-27 12:22:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-10-27 12:22:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-10-27 12:22:42,504 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 160 [2018-10-27 12:22:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:42,505 INFO L481 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-10-27 12:22:42,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 12:22:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-10-27 12:22:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-27 12:22:42,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:42,513 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:22:42,514 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:42,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash 9901054, now seen corresponding path program 1 times [2018-10-27 12:22:42,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:42,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:42,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:22:42,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:42,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:42,773 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-10-27 12:22:42,774 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:42,780 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:42,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:43,307 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:43,308 INFO L272 AbstractInterpreter]: Visited 140 different actions 419 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:22:43,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:43,315 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:43,600 INFO L227 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 81.21% of their original sizes. [2018-10-27 12:22:43,601 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:43,721 INFO L415 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-10-27 12:22:43,721 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:43,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:43,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:22:43,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:43,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:22:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:22:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:22:43,723 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 10 states. [2018-10-27 12:22:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:48,337 INFO L93 Difference]: Finished difference Result 4459 states and 6596 transitions. [2018-10-27 12:22:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:22:48,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2018-10-27 12:22:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:48,352 INFO L225 Difference]: With dead ends: 4459 [2018-10-27 12:22:48,352 INFO L226 Difference]: Without dead ends: 2640 [2018-10-27 12:22:48,360 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:22:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2018-10-27 12:22:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2554. [2018-10-27 12:22:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2018-10-27 12:22:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3569 transitions. [2018-10-27 12:22:48,433 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3569 transitions. Word has length 170 [2018-10-27 12:22:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:48,434 INFO L481 AbstractCegarLoop]: Abstraction has 2554 states and 3569 transitions. [2018-10-27 12:22:48,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:22:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3569 transitions. [2018-10-27 12:22:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 12:22:48,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:48,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:22:48,444 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:48,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1896536654, now seen corresponding path program 1 times [2018-10-27 12:22:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:48,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 12:22:48,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:48,646 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:48,646 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-10-27 12:22:48,653 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], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:48,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:48,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:49,486 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:49,486 INFO L272 AbstractInterpreter]: Visited 140 different actions 416 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:49,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:49,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:49,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:49,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:22:49,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:49,513 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:49,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:49,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:50,160 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:50,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-27 12:22:50,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:50,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:22:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:22:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 12:22:50,163 INFO L87 Difference]: Start difference. First operand 2554 states and 3569 transitions. Second operand 3 states. [2018-10-27 12:22:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:52,271 INFO L93 Difference]: Finished difference Result 7157 states and 10356 transitions. [2018-10-27 12:22:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:22:52,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-27 12:22:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:52,292 INFO L225 Difference]: With dead ends: 7157 [2018-10-27 12:22:52,292 INFO L226 Difference]: Without dead ends: 3928 [2018-10-27 12:22:52,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 12:22:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2018-10-27 12:22:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3912. [2018-10-27 12:22:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2018-10-27 12:22:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5227 transitions. [2018-10-27 12:22:52,405 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5227 transitions. Word has length 172 [2018-10-27 12:22:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:52,405 INFO L481 AbstractCegarLoop]: Abstraction has 3912 states and 5227 transitions. [2018-10-27 12:22:52,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:22:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5227 transitions. [2018-10-27 12:22:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-27 12:22:52,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:52,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:22:52,420 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:52,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 948524256, now seen corresponding path program 1 times [2018-10-27 12:22:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:52,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:52,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:52,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:52,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-10-27 12:22:52,597 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], [127], [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], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:52,600 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:52,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:53,421 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:53,422 INFO L272 AbstractInterpreter]: Visited 139 different actions 415 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:53,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:53,458 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:53,814 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 81.14% of their original sizes. [2018-10-27 12:22:53,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:54,149 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-10-27 12:22:54,149 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:54,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:54,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 12:22:54,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:54,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:22:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:22:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:22:54,151 INFO L87 Difference]: Start difference. First operand 3912 states and 5227 transitions. Second operand 11 states. [2018-10-27 12:23:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:04,652 INFO L93 Difference]: Finished difference Result 9248 states and 12463 transitions. [2018-10-27 12:23:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 12:23:04,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-10-27 12:23:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:04,676 INFO L225 Difference]: With dead ends: 9248 [2018-10-27 12:23:04,676 INFO L226 Difference]: Without dead ends: 5342 [2018-10-27 12:23:04,692 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-10-27 12:23:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2018-10-27 12:23:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 5278. [2018-10-27 12:23:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5278 states. [2018-10-27 12:23:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 6719 transitions. [2018-10-27 12:23:04,824 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 6719 transitions. Word has length 185 [2018-10-27 12:23:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:04,824 INFO L481 AbstractCegarLoop]: Abstraction has 5278 states and 6719 transitions. [2018-10-27 12:23:04,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:23:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 6719 transitions. [2018-10-27 12:23:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-27 12:23:04,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:04,840 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, 3, 3, 3, 3, 3, 3, 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-10-27 12:23:04,840 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:04,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1052905866, now seen corresponding path program 1 times [2018-10-27 12:23:04,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:04,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:04,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:04,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:04,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 82 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 12:23:05,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:05,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:23:05,287 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-10-27 12:23:05,288 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], [107], [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], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:23:05,291 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:23:05,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:23:06,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:23:06,175 INFO L272 AbstractInterpreter]: Visited 141 different actions 562 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:23:06,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:06,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:23:06,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:06,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:23:06,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:06,193 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:23:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:06,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:23:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:23:06,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:23:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:23:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:23:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-10-27 12:23:06,644 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:23:06,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 12:23:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 12:23:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:23:06,645 INFO L87 Difference]: Start difference. First operand 5278 states and 6719 transitions. Second operand 9 states. [2018-10-27 12:23:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:11,425 INFO L93 Difference]: Finished difference Result 13734 states and 18032 transitions. [2018-10-27 12:23:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 12:23:11,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 209 [2018-10-27 12:23:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:11,460 INFO L225 Difference]: With dead ends: 13734 [2018-10-27 12:23:11,460 INFO L226 Difference]: Without dead ends: 7430 [2018-10-27 12:23:11,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 12:23:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2018-10-27 12:23:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 6887. [2018-10-27 12:23:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2018-10-27 12:23:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 8235 transitions. [2018-10-27 12:23:11,660 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 8235 transitions. Word has length 209 [2018-10-27 12:23:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:11,660 INFO L481 AbstractCegarLoop]: Abstraction has 6887 states and 8235 transitions. [2018-10-27 12:23:11,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 12:23:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 8235 transitions. [2018-10-27 12:23:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-27 12:23:11,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:11,686 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 12:23:11,686 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:11,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash -266524713, now seen corresponding path program 1 times [2018-10-27 12:23:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:11,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:11,923 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:23:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 159 proven. 42 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-10-27 12:23:12,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:12,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:23:12,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-10-27 12:23:12,114 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [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], [225], [228], [232], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:23:12,117 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:23:12,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:23:12,870 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:23:12,871 INFO L272 AbstractInterpreter]: Visited 144 different actions 434 times. Merged at 9 different actions 28 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:23:12,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:12,900 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:23:13,321 INFO L227 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 81.07% of their original sizes. [2018-10-27 12:23:13,321 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:23:13,443 INFO L415 sIntCurrentIteration]: We unified 284 AI predicates to 284 [2018-10-27 12:23:13,444 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:23:13,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:23:13,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-10-27 12:23:13,444 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:13,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 12:23:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 12:23:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-27 12:23:13,445 INFO L87 Difference]: Start difference. First operand 6887 states and 8235 transitions. Second operand 13 states. [2018-10-27 12:23:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:27,661 INFO L93 Difference]: Finished difference Result 16460 states and 19677 transitions. [2018-10-27 12:23:27,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 12:23:27,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 285 [2018-10-27 12:23:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:27,697 INFO L225 Difference]: With dead ends: 16460 [2018-10-27 12:23:27,697 INFO L226 Difference]: Without dead ends: 10186 [2018-10-27 12:23:27,712 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 306 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 12:23:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10186 states. [2018-10-27 12:23:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10186 to 9892. [2018-10-27 12:23:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9892 states. [2018-10-27 12:23:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9892 states to 9892 states and 11634 transitions. [2018-10-27 12:23:27,909 INFO L78 Accepts]: Start accepts. Automaton has 9892 states and 11634 transitions. Word has length 285 [2018-10-27 12:23:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:27,910 INFO L481 AbstractCegarLoop]: Abstraction has 9892 states and 11634 transitions. [2018-10-27 12:23:27,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 12:23:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9892 states and 11634 transitions. [2018-10-27 12:23:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-27 12:23:27,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:27,941 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:23:27,942 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:27,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:27,942 INFO L82 PathProgramCache]: Analyzing trace with hash 133310492, now seen corresponding path program 1 times [2018-10-27 12:23:27,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:27,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:27,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:27,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:27,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 191 proven. 99 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-27 12:23:28,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:28,634 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:23:28,635 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-10-27 12:23:28,635 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [99], [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], [225], [228], [232], [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], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [751], [753], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:23:28,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:23:28,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:23:29,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:23:29,423 INFO L272 AbstractInterpreter]: Visited 145 different actions 579 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:23:29,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:29,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:23:29,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:29,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:23:29,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:29,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:23:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:29,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:23:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 252 proven. 2 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-27 12:23:29,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:23:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 206 proven. 55 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-27 12:23:29,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:23:29,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 12:23:29,813 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:23:29,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:23:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:23:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-10-27 12:23:29,815 INFO L87 Difference]: Start difference. First operand 9892 states and 11634 transitions. Second operand 11 states. [2018-10-27 12:23:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:35,084 INFO L93 Difference]: Finished difference Result 18574 states and 21847 transitions. [2018-10-27 12:23:35,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:23:35,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 295 [2018-10-27 12:23:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:35,086 INFO L225 Difference]: With dead ends: 18574 [2018-10-27 12:23:35,086 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:23:35,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 600 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-10-27 12:23:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:23:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:23:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:23:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:23:35,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2018-10-27 12:23:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:35,122 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:23:35,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:23:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:23:35,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:23:35,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:23:35,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:35,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,365 WARN L179 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 181 [2018-10-27 12:23:36,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:36,824 WARN L179 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 209 [2018-10-27 12:23:37,592 WARN L179 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-27 12:23:38,089 WARN L179 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 77 [2018-10-27 12:23:43,659 WARN L179 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 350 DAG size of output: 110 [2018-10-27 12:23:45,050 WARN L179 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 208 DAG size of output: 110 [2018-10-27 12:23:46,787 WARN L179 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 228 DAG size of output: 112 [2018-10-27 12:23:46,790 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:23:46,790 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)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-27 12:23:46,790 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:23:46,790 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,790 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 12:23:46,791 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 556) no Hoare annotation was computed. [2018-10-27 12:23:46,792 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 12:23:46,793 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 12:23:46,794 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 12:23:46,795 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,796 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 12:23:46,797 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,798 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 12:23:46,799 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 12:23:46,800 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,801 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 12:23:46,802 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,803 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 12:23:46,804 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,805 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 12:23:46,806 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,807 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,808 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (= 1 |old(~a19~0)|)) (.cse3 (<= ~a17~0 |old(~a17~0)|)) (.cse4 (= |old(~a19~0)| ~a19~0)) (.cse5 (<= ~a28~0 |old(~a28~0)|)) (.cse6 (= ~a11~0 |old(~a11~0)|)) (.cse11 (<= 10 ~a28~0)) (.cse7 (= ~a25~0 |old(~a25~0)|)) (.cse27 (= 1 |old(~a25~0)|))) (let ((.cse29 (not (= 0 |old(~a11~0)|))) (.cse21 (< 7 |old(~a28~0)|)) (.cse1 (not .cse27)) (.cse8 (< 7 |old(~a17~0)|)) (.cse28 (and .cse3 .cse4 .cse5 .cse6 .cse11 .cse7)) (.cse32 (not (= |old(~a19~0)| 1))) (.cse25 (<= 7 ~a28~0)) (.cse31 (= ~a19~0 1)) (.cse26 (= ~a17~0 8)) (.cse22 (< |old(~a28~0)| 7)) (.cse14 (< 10 |old(~a28~0)|)) (.cse16 (not .cse0)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse10 (not (= 1 ~a21~0))) (.cse12 (< 1 |old(~a11~0)|)) (.cse13 (< |old(~a25~0)| 0)) (.cse23 (< |old(~a19~0)| 0)) (.cse15 (< |old(~a11~0)| 0)) (.cse17 (< 1 |old(~a25~0)|)) (.cse18 (< |old(~a28~0)| 10)) (.cse30 (< 11 |old(~a28~0)|)) (.cse19 (not (= 8 |old(~a17~0)|))) (.cse2 (= |old(~a11~0)| |old(~a19~0)|)) (.cse24 (< 0 |old(~a19~0)|)) (.cse20 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse9 .cse10 .cse21 .cse1 .cse12 .cse22 .cse23 .cse15 .cse19 .cse24 (and .cse25 .cse4 .cse5 .cse7 .cse6 .cse26) .cse20) (or .cse18 (< |old(~a19~0)| 1) .cse8 .cse27 .cse28) (or .cse9 .cse10 .cse1 .cse29 .cse23 (and .cse11 .cse5 .cse7 (= ~a19~0 0) .cse6 .cse26) .cse18 .cse30 .cse19 .cse24 .cse20) (or (or .cse9 .cse10 .cse1 .cse29 (not (= 8 |old(~a28~0)|)) .cse16 .cse19 .cse20) (= ~a28~0 8)) (or .cse0 .cse18 .cse11 .cse2 .cse8) (or .cse9 .cse10 .cse12 (and .cse6 .cse25 .cse4 .cse5 .cse26 .cse7) .cse13 .cse22 .cse23 .cse27 .cse15 .cse17 .cse30 .cse19 .cse24 .cse20) (or .cse9 .cse21 (and .cse6 .cse25 .cse5 .cse31 (<= ~a17~0 8) .cse7 (<= 7 ~a17~0)) (or .cse10 .cse15 .cse1 .cse12 .cse22 (< |old(~a17~0)| 7)) .cse16 (< 8 |old(~a17~0)|) .cse20) (or .cse9 .cse10 .cse12 .cse13 .cse11 .cse32 .cse15 .cse17 .cse18 .cse30 .cse19 .cse2 .cse20) (or .cse18 .cse2 .cse8 .cse27 .cse28) (or .cse9 .cse10 .cse12 .cse13 .cse22 .cse32 .cse15 .cse17 .cse30 .cse19 .cse2 (and .cse5 (<= ~a19~0 1) .cse7 .cse6 (<= 0 ~a19~0) .cse26 (not (= ~a19~0 ~a11~0))) .cse20) (or (and .cse25 .cse5 .cse31 .cse7 .cse6 .cse26) .cse9 .cse10 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20) (or .cse9 .cse10 .cse12 .cse13 .cse23 .cse27 .cse15 .cse17 .cse11 .cse18 .cse30 .cse19 .cse2 .cse24 .cse20)))) [2018-10-27 12:23:46,808 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,808 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,808 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,808 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 12:23:46,808 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 12:23:46,808 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 12:23:46,809 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 12:23:46,810 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:23:46,811 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:46,812 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 12:23:46,813 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:23:46,814 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 12:23:46,815 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 12:23:46,815 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:23:46,815 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-10-27 12:23:46,815 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:23:46,815 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:23:46,815 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)) (and (= ~a19~0 1) (= ~a28~0 7) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (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)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:23:46,816 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 12:23:46,816 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse16 (= ~a25~0 1))) (let ((.cse4 (<= ~a28~0 11)) (.cse0 (<= 10 ~a28~0)) (.cse18 (not .cse16)) (.cse14 (<= ~a28~0 7)) (.cse1 (<= 1 main_~input~0)) (.cse2 (<= main_~input~0 6)) (.cse6 (<= 0 ~a19~0)) (.cse7 (<= ~a19~0 1)) (.cse10 (<= 7 ~a28~0)) (.cse11 (<= 0 ~a11~0)) (.cse3 (<= ~a25~0 1)) (.cse5 (<= 0 ~a25~0)) (.cse12 (<= ~a11~0 1)) (.cse8 (= ~a17~0 8)) (.cse15 (= ~a19~0 1)) (.cse17 (<= ~a17~0 7)) (.cse9 (= 1 ~a25~0)) (.cse13 (not (= ~a19~0 ~a11~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a11~0 0) .cse6 .cse7 .cse8) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse9 .cse10 .cse11 (= |old(~a19~0)| ~a19~0) .cse4 .cse12 .cse8 .cse13) (and .cse14 (and .cse12 .cse15 .cse16 (<= ~a17~0 8) .cse10 .cse11 (<= 7 ~a17~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse17 .cse0 .cse18 .cse13) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and (<= ~a19~0 0) .cse1 .cse18 .cse2 .cse10 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse8) (not (= 3 ~c~0)) (and .cse17 .cse0 .cse18 (<= 1 ~a19~0)) (and .cse14 .cse1 .cse2 .cse10 .cse11 .cse3 .cse5 .cse12 .cse6 .cse7 .cse8) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and (<= ~a28~0 10) .cse10 .cse11 .cse3 .cse5 .cse12 .cse8 .cse15) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)) (and (not .cse15) .cse17 .cse9 .cse13)))) [2018-10-27 12:23:46,816 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:23:46,816 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:23:46,817 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse12 (= ~a25~0 1))) (let ((.cse4 (<= ~a28~0 11)) (.cse0 (<= 10 ~a28~0)) (.cse16 (not .cse12)) (.cse9 (<= ~a28~0 7)) (.cse1 (<= 1 main_~input~0)) (.cse2 (<= main_~input~0 6)) (.cse13 (<= 7 ~a28~0)) (.cse14 (<= 0 ~a11~0)) (.cse3 (<= ~a25~0 1)) (.cse5 (<= 0 ~a25~0)) (.cse10 (<= ~a11~0 1)) (.cse6 (<= 0 ~a19~0)) (.cse7 (<= ~a19~0 1)) (.cse8 (= ~a17~0 8)) (.cse11 (= ~a19~0 1)) (.cse15 (<= ~a17~0 7)) (.cse17 (not (= ~a19~0 ~a11~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a11~0 0) .cse6 .cse7 .cse8) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse9 .cse1 .cse2 (and .cse10 .cse11 .cse12 (<= ~a17~0 8) .cse13 .cse14 (<= 7 ~a17~0))) (and .cse1 (<= ~a28~0 10) .cse13 .cse5 .cse11 .cse2 .cse14 .cse3 .cse10 .cse8) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse15 .cse0 .cse16 .cse17) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and (<= ~a19~0 0) .cse1 .cse16 .cse2 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse6 .cse8) (not (= 3 ~c~0)) (and .cse15 .cse0 .cse16 (<= 1 ~a19~0)) (and .cse9 .cse1 .cse2 .cse13 .cse14 .cse3 .cse5 .cse10 .cse6 .cse7 .cse8) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)) (and (not .cse11) .cse15 (= 1 ~a25~0) .cse17)))) [2018-10-27 12:23:46,817 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 12:23:46,817 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 12:23:46,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:23:46 BoogieIcfgContainer [2018-10-27 12:23:46,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:23:46,836 INFO L168 Benchmark]: Toolchain (without parser) took 93655.00 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 12:23:46,837 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:23:46,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.52 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-10-27 12:23:46,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 181.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-27 12:23:46,839 INFO L168 Benchmark]: Boogie Preprocessor took 95.53 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:23:46,840 INFO L168 Benchmark]: RCFGBuilder took 3500.46 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: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2018-10-27 12:23:46,840 INFO L168 Benchmark]: TraceAbstraction took 89139.65 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -460.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-27 12:23:46,845 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.52 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 181.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.53 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3500.46 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: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89139.65 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -460.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 556]: 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: (((((((((((((((((((((((((((((((((10 <= a28 && 1 <= input) && input <= 6) && a25 <= 1) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) || !(a21 == 1)) || !(y == 25)) || (((((((1 == a25 && 7 <= a28) && 0 <= a11) && \old(a19) == a19) && a28 <= 11) && a11 <= 1) && a17 == 8) && !(a19 == a11))) || (a28 <= 7 && (((((a11 <= 1 && a19 == 1) && a25 == 1) && a17 <= 8) && 7 <= a28) && 0 <= a11) && 7 <= a17)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a17 <= 7 && 10 <= a28) && !(a25 == 1)) && !(a19 == a11))) || !(z == 26)) || !(0 == \old(a25))) || (((((((((((a19 <= 0 && 1 <= input) && !(a25 == 1)) && input <= 6) && 7 <= a28) && 0 <= a11) && a25 <= 1) && a28 <= 11) && 0 <= a25) && a11 <= 1) && 0 <= a19) && a17 == 8)) || !(3 == c)) || (((a17 <= 7 && 10 <= a28) && !(a25 == 1)) && 1 <= a19)) || ((((((((((a28 <= 7 && 1 <= input) && input <= 6) && 7 <= a28) && 0 <= a11) && a25 <= 1) && 0 <= a25) && a11 <= 1) && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(23 == w)) || !(\old(a28) == 7)) || (((((((a28 <= 10 && 7 <= a28) && 0 <= a11) && a25 <= 1) && 0 <= a25) && a11 <= 1) && a17 == 8) && a19 == 1)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f)) || (((!(a19 == 1) && a17 <= 7) && 1 == a25) && !(a19 == a11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 89.0s OverallTime, 10 OverallIterations, 7 TraceHistogramMax, 62.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1896 SDtfs, 11805 SDslu, 2898 SDs, 0 SdLazy, 18292 SolverSat, 2641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2331 GetRequests, 2141 SyntacticMatches, 10 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9892occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.6s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9968130090100231 AbsIntWeakeningRatio, 0.21105527638190955 AbsIntAvgWeakeningVarsNumRemoved, 29.688442211055275 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 242 PreInvPairs, 366 NumberOfFragments, 1437 HoareAnnotationTreeSize, 242 FomulaSimplifications, 17279 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17908 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1249108 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1676 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 1961/2220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...