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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label07_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:00:26,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:00:26,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:00:26,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:00:26,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:00:26,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:00:26,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:00:26,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:00:26,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:00:26,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:00:26,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:00:26,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:00:26,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:00:26,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:00:26,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:00:26,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:00:26,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:00:26,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:00:26,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:00:26,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:00:26,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:00:26,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:00:26,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:00:26,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:00:26,198 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:00:26,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:00:26,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:00:26,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:00:26,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:00:26,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:00:26,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:00:26,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:00:26,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:00:26,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:00:26,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:00:26,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:00:26,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:00:26,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:00:26,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:00:26,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:00:26,222 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:00:26,222 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:00:26,223 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:00:26,223 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:00:26,223 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:00:26,223 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:00:26,223 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:00:26,224 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:00:26,224 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:00:26,224 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:00:26,224 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:00:26,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:00:26,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:00:26,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:00:26,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:00:26,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:00:26,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:00:26,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:00:26,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:00:26,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:00:26,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:00:26,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:00:26,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:00:26,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:00:26,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:00:26,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:00:26,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:00:26,228 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:00:26,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:00:26,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:00:26,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:00:26,229 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:00:26,229 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:00:26,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:00:26,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:00:26,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:00:26,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:00:26,313 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:00:26,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label07_true-unreach-call_false-termination.c [2018-10-25 00:00:26,382 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b04cbf0e/96513ab8b9d248f2b04ab5edba809e56/FLAG38a66fa01 [2018-10-25 00:00:26,949 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:00:26,950 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label07_true-unreach-call_false-termination.c [2018-10-25 00:00:26,962 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b04cbf0e/96513ab8b9d248f2b04ab5edba809e56/FLAG38a66fa01 [2018-10-25 00:00:26,977 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b04cbf0e/96513ab8b9d248f2b04ab5edba809e56 [2018-10-25 00:00:26,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:00:26,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:00:26,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:00:26,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:00:26,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:00:26,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:00:26" (1/1) ... [2018-10-25 00:00:27,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be2feca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:26, skipping insertion in model container [2018-10-25 00:00:27,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:00:26" (1/1) ... [2018-10-25 00:00:27,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:00:27,069 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:00:27,509 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:00:27,515 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:00:27,624 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:00:27,649 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:00:27,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27 WrapperNode [2018-10-25 00:00:27,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:00:27,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:00:27,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:00:27,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:00:27,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:00:27,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:00:27,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:00:27,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:00:27,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (1/1) ... [2018-10-25 00:00:27,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:00:27,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:00:27,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:00:27,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:00:27,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (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-25 00:00:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:00:28,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:00:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:00:28,032 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:00:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:00:28,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:00:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:00:28,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:00:31,380 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:00:31,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:00:31 BoogieIcfgContainer [2018-10-25 00:00:31,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:00:31,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:00:31,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:00:31,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:00:31,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:00:26" (1/3) ... [2018-10-25 00:00:31,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187c179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:00:31, skipping insertion in model container [2018-10-25 00:00:31,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:00:27" (2/3) ... [2018-10-25 00:00:31,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187c179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:00:31, skipping insertion in model container [2018-10-25 00:00:31,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:00:31" (3/3) ... [2018-10-25 00:00:31,394 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label07_true-unreach-call_false-termination.c [2018-10-25 00:00:31,406 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:00:31,419 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:00:31,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:00:31,487 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:00:31,487 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:00:31,487 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:00:31,488 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:00:31,488 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:00:31,488 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:00:31,488 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:00:31,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:00:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:00:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-25 00:00:31,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:00:31,546 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] [2018-10-25 00:00:31,548 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:00:31,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -175459411, now seen corresponding path program 1 times [2018-10-25 00:00:31,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:00:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:31,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:00:31,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:31,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:00:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:00:32,218 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:00:32,368 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-25 00:00:32,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:00:32,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:00:32,371 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:00:32,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:00:32,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:00:32,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:00:32,399 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:00:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:00:33,811 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:00:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:00:33,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-10-25 00:00:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:00:33,833 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:00:33,833 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:00:33,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:00:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:00:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:00:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:00:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-10-25 00:00:33,929 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 111 [2018-10-25 00:00:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:00:33,931 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-10-25 00:00:33,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:00:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-10-25 00:00:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 00:00:33,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:00:33,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:00:33,940 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:00:33,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash -665844754, now seen corresponding path program 1 times [2018-10-25 00:00:33,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:00:33,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:33,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:00:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:33,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:00:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:00:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:00:34,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:00:34,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:00:34,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:00:34,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:00:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:00:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:00:34,159 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-10-25 00:00:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:00:36,301 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-10-25 00:00:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:00:36,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-10-25 00:00:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:00:36,312 INFO L225 Difference]: With dead ends: 1075 [2018-10-25 00:00:36,312 INFO L226 Difference]: Without dead ends: 741 [2018-10-25 00:00:36,318 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-25 00:00:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-25 00:00:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-25 00:00:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-25 00:00:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-10-25 00:00:36,371 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 122 [2018-10-25 00:00:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:00:36,371 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-10-25 00:00:36,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:00:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-10-25 00:00:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 00:00:36,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:00:36,381 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:00:36,381 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:00:36,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1859924383, now seen corresponding path program 1 times [2018-10-25 00:00:36,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:00:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:36,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:00:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:00:36,383 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:00:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:00:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:00:36,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:00:36,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:00:36,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-10-25 00:00:36,758 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [525], [527], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:00:36,810 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:00:36,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:00:37,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:00:37,975 INFO L272 AbstractInterpreter]: Visited 115 different actions 223 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:00:38,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:00:38,022 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:00:38,959 INFO L232 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 80.72% of their original sizes. [2018-10-25 00:00:38,960 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:00:42,058 INFO L413 sIntCurrentIteration]: We have 146 unified AI predicates [2018-10-25 00:00:42,059 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:00:42,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:00:42,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:00:42,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:00:42,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:00:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:00:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:00:42,062 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 15 states. [2018-10-25 00:01:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:00,371 INFO L93 Difference]: Finished difference Result 2652 states and 4243 transitions. [2018-10-25 00:01:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:01:00,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-10-25 00:01:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:00,383 INFO L225 Difference]: With dead ends: 2652 [2018-10-25 00:01:00,383 INFO L226 Difference]: Without dead ends: 1934 [2018-10-25 00:01:00,388 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 50 SyntacticMatches, 83 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:01:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2018-10-25 00:01:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1904. [2018-10-25 00:01:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-25 00:01:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2477 transitions. [2018-10-25 00:01:00,457 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2477 transitions. Word has length 147 [2018-10-25 00:01:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:00,458 INFO L481 AbstractCegarLoop]: Abstraction has 1904 states and 2477 transitions. [2018-10-25 00:01:00,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:01:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2477 transitions. [2018-10-25 00:01:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 00:01:00,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:00,467 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:01:00,468 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:00,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:00,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1160952988, now seen corresponding path program 1 times [2018-10-25 00:01:00,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:00,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:00,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:01:00,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:00,692 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:00,692 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-25 00:01:00,693 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [525], [527], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:00,699 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:00,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:00,975 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:00,975 INFO L272 AbstractInterpreter]: Visited 116 different actions 226 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:00,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:00,983 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:01,427 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 80.46% of their original sizes. [2018-10-25 00:01:01,427 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:01,561 INFO L413 sIntCurrentIteration]: We have 159 unified AI predicates [2018-10-25 00:01:01,561 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:01,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:01,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:01:01,562 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:01,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:01:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:01:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:01,564 INFO L87 Difference]: Start difference. First operand 1904 states and 2477 transitions. Second operand 10 states. [2018-10-25 00:01:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:07,723 INFO L93 Difference]: Finished difference Result 3596 states and 4783 transitions. [2018-10-25 00:01:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:01:07,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-10-25 00:01:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:07,734 INFO L225 Difference]: With dead ends: 3596 [2018-10-25 00:01:07,734 INFO L226 Difference]: Without dead ends: 2045 [2018-10-25 00:01:07,740 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:01:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2018-10-25 00:01:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2042. [2018-10-25 00:01:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2018-10-25 00:01:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2631 transitions. [2018-10-25 00:01:07,798 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2631 transitions. Word has length 160 [2018-10-25 00:01:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:07,799 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 2631 transitions. [2018-10-25 00:01:07,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:01:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2631 transitions. [2018-10-25 00:01:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 00:01:07,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:07,807 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:07,808 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:07,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash -552748137, now seen corresponding path program 1 times [2018-10-25 00:01:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:07,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:01:08,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:08,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:08,106 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-10-25 00:01:08,106 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [525], [527], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:08,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:08,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:08,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:01:08,638 INFO L272 AbstractInterpreter]: Visited 118 different actions 355 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:01:08,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:08,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:01:08,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:08,647 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-25 00:01:08,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:08,658 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:01:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:08,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:01:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-25 00:01:09,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:01:09,287 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:01:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:01:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:01:10,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-25 00:01:10,126 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:01:10,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:01:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:01:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:01:10,127 INFO L87 Difference]: Start difference. First operand 2042 states and 2631 transitions. Second operand 8 states. [2018-10-25 00:01:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:15,781 INFO L93 Difference]: Finished difference Result 6823 states and 9353 transitions. [2018-10-25 00:01:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:01:15,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2018-10-25 00:01:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:15,798 INFO L225 Difference]: With dead ends: 6823 [2018-10-25 00:01:15,798 INFO L226 Difference]: Without dead ends: 2992 [2018-10-25 00:01:15,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:01:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-10-25 00:01:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2951. [2018-10-25 00:01:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2018-10-25 00:01:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 3486 transitions. [2018-10-25 00:01:15,911 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 3486 transitions. Word has length 172 [2018-10-25 00:01:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:15,911 INFO L481 AbstractCegarLoop]: Abstraction has 2951 states and 3486 transitions. [2018-10-25 00:01:15,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:01:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 3486 transitions. [2018-10-25 00:01:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-25 00:01:15,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:15,921 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:15,921 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:15,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1543535280, now seen corresponding path program 1 times [2018-10-25 00:01:15,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:15,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:15,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:15,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:15,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:16,417 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 00:01:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-25 00:01:16,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:16,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:16,450 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-10-25 00:01:16,451 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [525], [527], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:16,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:16,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:16,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:16,956 INFO L272 AbstractInterpreter]: Visited 116 different actions 226 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:16,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:16,991 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:17,899 INFO L232 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 80.68% of their original sizes. [2018-10-25 00:01:17,900 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:21,230 INFO L413 sIntCurrentIteration]: We have 192 unified AI predicates [2018-10-25 00:01:21,230 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:21,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:21,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:01:21,230 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:21,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:01:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:01:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:01:21,232 INFO L87 Difference]: Start difference. First operand 2951 states and 3486 transitions. Second operand 15 states. [2018-10-25 00:01:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:35,485 INFO L93 Difference]: Finished difference Result 6277 states and 7455 transitions. [2018-10-25 00:01:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:01:35,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 193 [2018-10-25 00:01:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:35,502 INFO L225 Difference]: With dead ends: 6277 [2018-10-25 00:01:35,503 INFO L226 Difference]: Without dead ends: 3606 [2018-10-25 00:01:35,514 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 63 SyntacticMatches, 116 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:01:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2018-10-25 00:01:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3596. [2018-10-25 00:01:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3596 states. [2018-10-25 00:01:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4174 transitions. [2018-10-25 00:01:35,601 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4174 transitions. Word has length 193 [2018-10-25 00:01:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:35,602 INFO L481 AbstractCegarLoop]: Abstraction has 3596 states and 4174 transitions. [2018-10-25 00:01:35,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:01:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4174 transitions. [2018-10-25 00:01:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-25 00:01:35,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:35,613 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:35,613 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:35,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1421736141, now seen corresponding path program 1 times [2018-10-25 00:01:35,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:35,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:35,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:01:35,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:35,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:35,810 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-25 00:01:35,810 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [525], [527], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:35,814 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:35,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:36,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:01:36,777 INFO L272 AbstractInterpreter]: Visited 118 different actions 477 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:01:36,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:36,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:01:36,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:36,784 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-25 00:01:36,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:36,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:01:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:36,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:01:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-25 00:01:37,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:01:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:01:38,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:01:38,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:01:38,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:01:38,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:01:38,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:01:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:01:38,294 INFO L87 Difference]: Start difference. First operand 3596 states and 4174 transitions. Second operand 11 states. [2018-10-25 00:01:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:41,478 INFO L93 Difference]: Finished difference Result 11276 states and 14042 transitions. [2018-10-25 00:01:41,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 00:01:41,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-10-25 00:01:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:41,518 INFO L225 Difference]: With dead ends: 11276 [2018-10-25 00:01:41,519 INFO L226 Difference]: Without dead ends: 8467 [2018-10-25 00:01:41,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:01:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8467 states. [2018-10-25 00:01:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8467 to 8444. [2018-10-25 00:01:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2018-10-25 00:01:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 10101 transitions. [2018-10-25 00:01:41,771 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 10101 transitions. Word has length 202 [2018-10-25 00:01:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:41,771 INFO L481 AbstractCegarLoop]: Abstraction has 8444 states and 10101 transitions. [2018-10-25 00:01:41,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:01:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 10101 transitions. [2018-10-25 00:01:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-25 00:01:41,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:41,794 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:41,794 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:41,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 669212635, now seen corresponding path program 2 times [2018-10-25 00:01:41,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:41,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:41,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:41,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:41,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:01:42,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:42,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:42,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:01:42,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 00:01:42,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:42,321 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-25 00:01:42,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:01:42,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:01:42,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:01:42,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:01:42,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:01:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-25 00:01:42,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:01:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-25 00:01:42,792 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:42,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:01:42,793 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:42,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:42,794 INFO L87 Difference]: Start difference. First operand 8444 states and 10101 transitions. Second operand 3 states. [2018-10-25 00:01:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:43,611 INFO L93 Difference]: Finished difference Result 20563 states and 25012 transitions. [2018-10-25 00:01:43,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:43,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-25 00:01:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:43,618 INFO L225 Difference]: With dead ends: 20563 [2018-10-25 00:01:43,619 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:01:43,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:01:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:01:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:01:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:01:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:01:43,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2018-10-25 00:01:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:43,665 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:01:43,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:01:43,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:01:43,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:01:43,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,281 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 172 [2018-10-25 00:01:44,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:01:44,452 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 157 [2018-10-25 00:01:45,129 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-10-25 00:01:46,372 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2018-10-25 00:01:51,055 WARN L179 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 377 DAG size of output: 89 [2018-10-25 00:01:51,882 WARN L179 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 100 [2018-10-25 00:01:52,402 WARN L179 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 103 [2018-10-25 00:01:52,405 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:01:52,405 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a8~0 |old(~a8~0)|) (= ~a7~0 |old(~a7~0)|) (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:01:52,405 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 488) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,406 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,407 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:01:52,408 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:01:52,409 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,410 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:01:52,411 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:01:52,412 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:01:52,413 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:01:52,414 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,415 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:01:52,416 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:01:52,417 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:01:52,418 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse22 (= 1 |old(~a20~0)|))) (let ((.cse11 (not (= 1 |old(~a21~0)|))) (.cse19 (not .cse22)) (.cse20 (= 0 |old(~a16~0)|)) (.cse13 (not (= 8 ~a12~0))) (.cse14 (= |calculate_output_#in~input| 0)) (.cse15 (not (= 1 |old(~a17~0)|))) (.cse4 (<= ~a8~0 13)) (.cse21 (= ~a7~0 |old(~a7~0)|)) (.cse6 (= |old(~a16~0)| ~a16~0))) (let ((.cse7 (<= ~a17~0 0)) (.cse16 (= ~a17~0 1)) (.cse3 (not (= 1 |old(~a7~0)|))) (.cse8 (< 0 |old(~a17~0)|)) (.cse17 (= ~a21~0 1)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse12 (not (= 15 |old(~a8~0)|))) (.cse1 (< 13 |old(~a8~0)|)) (.cse2 (and .cse4 .cse21 .cse6)) (.cse18 (or .cse11 .cse19 .cse20 .cse13 .cse14 (= 0 |old(~a8~0)|) .cse15)) (.cse9 (= 13 |old(~a8~0)|)) (.cse0 (= 6 |old(~a16~0)|)) (.cse5 (= |old(~a20~0)| ~a20~0))) (and (or .cse0 .cse1 .cse2) (or .cse1 (< |old(~a20~0)| 1) .cse3 (and .cse4 (= 1 ~a7~0) .cse5 .cse6 .cse7) .cse8) (or .cse9 .cse7 .cse8) (or (or .cse10 .cse11 .cse12 (not (= 5 |old(~a16~0)|)) .cse13 .cse14 .cse15) (and .cse16 .cse17) (not (= 0 |old(~a20~0)|))) (or .cse0 .cse8 .cse7) (or (and (not (= ~a8~0 0)) .cse16 .cse17 (= ~a20~0 1)) .cse18) (or .cse0 .cse3 .cse5) (or .cse0 .cse8 .cse5) (or (<= 15 ~a8~0) (< |old(~a8~0)| 15)) (or .cse8 .cse17 (or .cse10 .cse11 .cse19 .cse12 .cse20 .cse13 .cse14)) (or .cse1 .cse2 .cse18) (or (and (<= ~a8~0 |old(~a8~0)|) .cse21 .cse5 .cse6 (not (= ~a8~0 13))) .cse9) (or .cse0 .cse5 .cse22))))) [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,419 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:01:52,420 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:01:52,421 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:01:52,422 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:01:52,423 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:01:52,424 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:01:52,425 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:01:52,425 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:01:52,425 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:01:52,425 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a8~0 15) (= ~a21~0 1) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:01:52,425 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:01:52,425 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (= ~a20~0 1)) (.cse2 (= 1 ~a7~0)) (.cse1 (not (= ~a16~0 6))) (.cse3 (<= ~a17~0 0))) (or (not (= ~a8~0 13)) (and (not .cse0) .cse1) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= ~a7~0 |old(~a7~0)|) .cse1) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (not (= ~a16~0 0)) (not (= main_~input~0 0)) (= ~a17~0 1) (= ~a21~0 1) .cse0) (and .cse2 .cse3 (<= 1 ~a20~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse2 .cse1) (and .cse1 .cse3) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-25 00:01:52,426 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:01:52,426 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:01:52,426 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:01:52,426 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a20~0 1)) (.cse2 (= 1 ~a7~0)) (.cse1 (not (= ~a16~0 6))) (.cse3 (<= ~a17~0 0))) (or (not (= ~a8~0 13)) (and (not .cse0) .cse1) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= ~a7~0 |old(~a7~0)|) .cse1) (not (= ~x~0 24)) (and (not (= ~a16~0 0)) (= ~a17~0 1) (= ~a21~0 1) .cse0) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse2 .cse3 (<= 1 ~a20~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse2 .cse1) (and .cse1 .cse3) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-25 00:01:52,426 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:01:52,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:01:52 BoogieIcfgContainer [2018-10-25 00:01:52,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:01:52,443 INFO L168 Benchmark]: Toolchain (without parser) took 85453.65 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -312.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-25 00:01:52,444 INFO L168 Benchmark]: CDTParser took 0.24 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-25 00:01:52,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:01:52,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 202.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:01:52,446 INFO L168 Benchmark]: Boogie Preprocessor took 98.01 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-25 00:01:52,447 INFO L168 Benchmark]: RCFGBuilder took 3431.31 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: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2018-10-25 00:01:52,447 INFO L168 Benchmark]: TraceAbstraction took 81057.69 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 363.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 00:01:52,452 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.24 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 658.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 202.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.01 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 3431.31 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: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81057.69 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 363.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 488]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(a8 == 13) || (!(a20 == 1) && !(a16 == 6))) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (a7 == \old(a7) && !(a16 == 6))) || !(x == 24)) || (((!(a16 == 0) && a17 == 1) && a21 == 1) && a20 == 1)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((1 == a7 && a17 <= 0) && 1 <= a20)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || (1 == a7 && !(a16 == 6))) || (!(a16 == 6) && a17 <= 0)) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 80.9s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 52.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1233 SDtfs, 9102 SDslu, 1486 SDs, 0 SdLazy, 13515 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1764 GetRequests, 1438 SyntacticMatches, 206 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8444occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9969652035513832 AbsIntWeakeningRatio, 0.23541247484909456 AbsIntAvgWeakeningVarsNumRemoved, 0.9356136820925554 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 227 PreInvPairs, 431 NumberOfFragments, 740 HoareAnnotationTreeSize, 227 FomulaSimplifications, 12716 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10227 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1885 NumberOfCodeBlocks, 1818 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2447 ConstructedInterpolants, 0 QuantifiedInterpolants, 841849 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1514 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 1383/1573 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...