java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:23:15,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:23:15,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:23:15,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:23:15,874 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:23:15,875 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:23:15,876 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:23:15,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:23:15,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:23:15,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:23:15,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:23:15,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:23:15,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:23:15,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:23:15,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:23:15,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:23:15,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:23:15,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:23:15,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:23:15,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:23:15,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:23:15,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:23:15,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:23:15,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:23:15,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:23:15,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:23:15,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:23:15,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:23:15,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:23:15,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:23:15,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:23:15,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:23:15,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:23:15,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:23:15,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:23:15,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:23:15,907 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:23:15,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:23:15,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:23:15,933 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:23:15,933 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:23:15,933 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:23:15,933 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:23:15,934 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:23:15,934 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:23:15,934 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:23:15,935 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:23:15,935 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:23:15,935 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:23:15,936 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:23:15,936 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:23:15,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:23:15,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:23:15,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:23:15,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:23:15,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:23:15,937 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:23:15,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:23:15,937 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:23:15,938 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:23:15,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:23:15,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:23:15,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:23:15,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:23:15,939 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:23:15,939 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:23:15,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:23:15,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:23:15,940 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:23:15,940 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:23:15,940 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:23:15,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:23:16,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:23:16,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:23:16,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:23:16,013 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:23:16,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-10-27 12:23:16,078 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/996bbca11/77c4ad3e9bcb478795d66c7737fb828a/FLAGfb68a4536 [2018-10-27 12:23:16,683 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:23:16,684 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-10-27 12:23:16,699 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/996bbca11/77c4ad3e9bcb478795d66c7737fb828a/FLAGfb68a4536 [2018-10-27 12:23:16,724 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/996bbca11/77c4ad3e9bcb478795d66c7737fb828a [2018-10-27 12:23:16,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:23:16,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:23:16,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:23:16,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:23:16,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:23:16,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:23:16" (1/1) ... [2018-10-27 12:23:16,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b295a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:16, skipping insertion in model container [2018-10-27 12:23:16,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:23:16" (1/1) ... [2018-10-27 12:23:16,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:23:16,821 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:23:17,342 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:23:17,349 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:23:17,489 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:23:17,509 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:23:17,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17 WrapperNode [2018-10-27 12:23:17,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:23:17,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:23:17,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:23:17,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:23:17,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:23:17,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:23:17,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:23:17,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:23:17,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... [2018-10-27 12:23:17,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:23:17,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:23:17,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:23:17,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:23:17,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:23:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:23:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:23:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:23:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:23:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:23:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:23:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:23:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:23:21,097 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:23:21,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:23:21 BoogieIcfgContainer [2018-10-27 12:23:21,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:23:21,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:23:21,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:23:21,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:23:21,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:23:16" (1/3) ... [2018-10-27 12:23:21,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31345d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:23:21, skipping insertion in model container [2018-10-27 12:23:21,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:17" (2/3) ... [2018-10-27 12:23:21,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31345d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:23:21, skipping insertion in model container [2018-10-27 12:23:21,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:23:21" (3/3) ... [2018-10-27 12:23:21,107 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label36_true-unreach-call_false-termination.c [2018-10-27 12:23:21,117 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:23:21,126 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:23:21,144 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:23:21,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:23:21,189 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:23:21,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:23:21,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:23:21,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:23:21,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:23:21,190 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:23:21,190 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:23:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 12:23:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 12:23:21,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:21,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:21,236 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:21,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash -887392241, now seen corresponding path program 1 times [2018-10-27 12:23:21,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:21,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:21,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:23:21,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:23:21,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:23:21,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:21,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:23:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:23:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:23:21,991 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 12:23:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:23,700 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-27 12:23:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:23:23,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-10-27 12:23:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:23,722 INFO L225 Difference]: With dead ends: 618 [2018-10-27 12:23:23,722 INFO L226 Difference]: Without dead ends: 379 [2018-10-27 12:23:23,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:23:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-27 12:23:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-27 12:23:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-27 12:23:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-27 12:23:23,810 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 139 [2018-10-27 12:23:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:23,811 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-27 12:23:23,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:23:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-27 12:23:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 12:23:23,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:23,820 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:23,820 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:23,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1146144614, now seen corresponding path program 1 times [2018-10-27 12:23:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:23,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:23,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:23,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:23:24,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:23:24,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:23:24,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:24,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:23:24,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:23:24,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:23:24,064 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-27 12:23:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:26,234 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-10-27 12:23:26,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:23:26,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-27 12:23:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:26,257 INFO L225 Difference]: With dead ends: 1231 [2018-10-27 12:23:26,257 INFO L226 Difference]: Without dead ends: 858 [2018-10-27 12:23:26,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:23:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-10-27 12:23:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-10-27 12:23:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-27 12:23:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-10-27 12:23:26,341 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 155 [2018-10-27 12:23:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:26,342 INFO L481 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-10-27 12:23:26,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:23:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-10-27 12:23:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 12:23:26,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:26,348 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:26,349 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1857852795, now seen corresponding path program 1 times [2018-10-27 12:23:26,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:26,351 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:26,608 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:23:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:23:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:23:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:23:26,784 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:26,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:23:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:23:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:23:26,785 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-10-27 12:23:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:30,678 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-10-27 12:23:30,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:23:30,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-10-27 12:23:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:30,691 INFO L225 Difference]: With dead ends: 2553 [2018-10-27 12:23:30,691 INFO L226 Difference]: Without dead ends: 1738 [2018-10-27 12:23:30,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:23:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-27 12:23:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-10-27 12:23:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-10-27 12:23:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-10-27 12:23:30,758 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 162 [2018-10-27 12:23:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:30,759 INFO L481 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-10-27 12:23:30,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:23:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-10-27 12:23:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 12:23:30,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:30,768 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:30,768 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:30,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash 195127661, now seen corresponding path program 1 times [2018-10-27 12:23:30,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:30,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:30,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 12:23:30,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:30,972 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:23:30,973 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-10-27 12:23:30,976 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:23:31,031 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:23:31,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:23:31,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:23:31,837 INFO L272 AbstractInterpreter]: Visited 140 different actions 140 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-27 12:23:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:31,879 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:23:32,506 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 81.56% of their original sizes. [2018-10-27 12:23:32,506 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:23:33,432 INFO L415 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-10-27 12:23:33,432 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:23:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:23:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-27 12:23:33,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:33,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 12:23:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 12:23:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:23:33,436 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 14 states. [2018-10-27 12:23:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:47,651 INFO L93 Difference]: Finished difference Result 3652 states and 5496 transitions. [2018-10-27 12:23:47,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 12:23:47,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2018-10-27 12:23:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:47,663 INFO L225 Difference]: With dead ends: 3652 [2018-10-27 12:23:47,663 INFO L226 Difference]: Without dead ends: 1978 [2018-10-27 12:23:47,670 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:23:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2018-10-27 12:23:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1825. [2018-10-27 12:23:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-10-27 12:23:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-10-27 12:23:47,734 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 164 [2018-10-27 12:23:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:47,734 INFO L481 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-10-27 12:23:47,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 12:23:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-10-27 12:23:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-27 12:23:47,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:47,743 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:47,744 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:47,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash -6587698, now seen corresponding path program 1 times [2018-10-27 12:23:47,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:47,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:23:48,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:48,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:23:48,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-10-27 12:23:48,212 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:23:48,218 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:23:48,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:23:48,742 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:23:48,742 INFO L272 AbstractInterpreter]: Visited 144 different actions 431 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:23:48,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:48,749 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:23:49,038 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 81.26% of their original sizes. [2018-10-27 12:23:49,038 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:23:49,141 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-10-27 12:23:49,141 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:23:49,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:23:49,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:23:49,142 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:49,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:23:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:23:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:23:49,143 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 10 states. [2018-10-27 12:23:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:55,419 INFO L93 Difference]: Finished difference Result 4459 states and 6596 transitions. [2018-10-27 12:23:55,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:23:55,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2018-10-27 12:23:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:55,435 INFO L225 Difference]: With dead ends: 4459 [2018-10-27 12:23:55,435 INFO L226 Difference]: Without dead ends: 2640 [2018-10-27 12:23:55,443 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:23:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2018-10-27 12:23:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2554. [2018-10-27 12:23:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2018-10-27 12:23:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3569 transitions. [2018-10-27 12:23:55,520 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3569 transitions. Word has length 174 [2018-10-27 12:23:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:55,520 INFO L481 AbstractCegarLoop]: Abstraction has 2554 states and 3569 transitions. [2018-10-27 12:23:55,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:23:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3569 transitions. [2018-10-27 12:23:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-27 12:23:55,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:55,533 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:55,534 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -383543010, now seen corresponding path program 1 times [2018-10-27 12:23:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:55,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:55,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:23:55,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:23:55,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:23:55,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:55,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:23:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:23:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:23:55,773 INFO L87 Difference]: Start difference. First operand 2554 states and 3569 transitions. Second operand 3 states. [2018-10-27 12:23:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:56,500 INFO L93 Difference]: Finished difference Result 6370 states and 9328 transitions. [2018-10-27 12:23:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:23:56,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-10-27 12:23:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:56,523 INFO L225 Difference]: With dead ends: 6370 [2018-10-27 12:23:56,523 INFO L226 Difference]: Without dead ends: 2699 [2018-10-27 12:23:56,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:23:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-10-27 12:23:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2603. [2018-10-27 12:23:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-10-27 12:23:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3403 transitions. [2018-10-27 12:23:56,602 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3403 transitions. Word has length 176 [2018-10-27 12:23:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:56,603 INFO L481 AbstractCegarLoop]: Abstraction has 2603 states and 3403 transitions. [2018-10-27 12:23:56,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:23:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3403 transitions. [2018-10-27 12:23:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 12:23:56,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:23:56,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:23:56,612 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:23:56,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash -457317476, now seen corresponding path program 1 times [2018-10-27 12:23:56,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:23:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:23:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:23:56,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:23:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:23:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 12:23:56,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:23:56,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:23:56,843 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-27 12:23:56,843 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:23:56,848 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:23:56,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:23:57,182 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:23:57,183 INFO L272 AbstractInterpreter]: Visited 144 different actions 285 times. Merged at 5 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 12:23:57,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:23:57,191 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:23:57,562 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 82.43% of their original sizes. [2018-10-27 12:23:57,562 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:23:58,589 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-10-27 12:23:58,589 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:23:58,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:23:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-10-27 12:23:58,590 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:58,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 12:23:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 12:23:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-10-27 12:23:58,591 INFO L87 Difference]: Start difference. First operand 2603 states and 3403 transitions. Second operand 16 states. [2018-10-27 12:24:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:14,785 INFO L93 Difference]: Finished difference Result 5830 states and 7605 transitions. [2018-10-27 12:24:14,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 12:24:14,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 190 [2018-10-27 12:24:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:14,803 INFO L225 Difference]: With dead ends: 5830 [2018-10-27 12:24:14,803 INFO L226 Difference]: Without dead ends: 3233 [2018-10-27 12:24:14,812 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 160 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2018-10-27 12:24:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-10-27 12:24:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3208. [2018-10-27 12:24:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2018-10-27 12:24:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4103 transitions. [2018-10-27 12:24:14,913 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4103 transitions. Word has length 190 [2018-10-27 12:24:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:14,914 INFO L481 AbstractCegarLoop]: Abstraction has 3208 states and 4103 transitions. [2018-10-27 12:24:14,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 12:24:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4103 transitions. [2018-10-27 12:24:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-27 12:24:14,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:14,926 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:14,926 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:14,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1711089349, now seen corresponding path program 1 times [2018-10-27 12:24:14,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:14,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:14,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:14,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 74 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 12:24:15,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:24:15,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:24:15,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-10-27 12:24:15,678 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:24:15,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:24:15,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:24:16,251 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:24:16,251 INFO L272 AbstractInterpreter]: Visited 144 different actions 428 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:24:16,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:16,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:24:16,527 INFO L227 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 81.17% of their original sizes. [2018-10-27 12:24:16,527 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:24:16,693 INFO L415 sIntCurrentIteration]: We unified 204 AI predicates to 204 [2018-10-27 12:24:16,694 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:24:16,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:24:16,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 12:24:16,694 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:16,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:24:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:24:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:24:16,696 INFO L87 Difference]: Start difference. First operand 3208 states and 4103 transitions. Second operand 11 states. [2018-10-27 12:24:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:23,968 INFO L93 Difference]: Finished difference Result 6945 states and 8938 transitions. [2018-10-27 12:24:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:24:23,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 205 [2018-10-27 12:24:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:23,981 INFO L225 Difference]: With dead ends: 6945 [2018-10-27 12:24:23,981 INFO L226 Difference]: Without dead ends: 3541 [2018-10-27 12:24:23,989 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-27 12:24:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2018-10-27 12:24:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3474. [2018-10-27 12:24:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3474 states. [2018-10-27 12:24:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4357 transitions. [2018-10-27 12:24:24,076 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4357 transitions. Word has length 205 [2018-10-27 12:24:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:24,076 INFO L481 AbstractCegarLoop]: Abstraction has 3474 states and 4357 transitions. [2018-10-27 12:24:24,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:24:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4357 transitions. [2018-10-27 12:24:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-27 12:24:24,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:24,087 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:24,087 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:24,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1971199202, now seen corresponding path program 1 times [2018-10-27 12:24:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:24,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:24,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:24,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 91 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:24:24,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:24:24,572 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:24:24,572 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-10-27 12:24:24,572 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:24:24,575 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:24:24,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:24:25,196 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:24:25,196 INFO L272 AbstractInterpreter]: Visited 144 different actions 424 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:24:25,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:25,236 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:24:25,574 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 81.09% of their original sizes. [2018-10-27 12:24:25,575 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:24:25,683 INFO L415 sIntCurrentIteration]: We unified 232 AI predicates to 232 [2018-10-27 12:24:25,684 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:24:25,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:24:25,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-10-27 12:24:25,684 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:25,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:24:25,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:24:25,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:24:25,686 INFO L87 Difference]: Start difference. First operand 3474 states and 4357 transitions. Second operand 11 states. [2018-10-27 12:24:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:31,589 INFO L93 Difference]: Finished difference Result 8586 states and 10918 transitions. [2018-10-27 12:24:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:24:31,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2018-10-27 12:24:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:31,607 INFO L225 Difference]: With dead ends: 8586 [2018-10-27 12:24:31,607 INFO L226 Difference]: Without dead ends: 5422 [2018-10-27 12:24:31,614 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-27 12:24:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2018-10-27 12:24:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 4895. [2018-10-27 12:24:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2018-10-27 12:24:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 6135 transitions. [2018-10-27 12:24:31,762 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 6135 transitions. Word has length 233 [2018-10-27 12:24:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:31,762 INFO L481 AbstractCegarLoop]: Abstraction has 4895 states and 6135 transitions. [2018-10-27 12:24:31,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:24:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 6135 transitions. [2018-10-27 12:24:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-27 12:24:31,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:31,778 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-10-27 12:24:31,778 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:31,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1753075831, now seen corresponding path program 1 times [2018-10-27 12:24:31,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:31,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:31,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:31,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:31,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 193 proven. 136 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-10-27 12:24:32,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:24:32,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:24:32,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-10-27 12:24:32,703 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [163], [168], [170], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:24:32,706 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:24:32,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:24:33,356 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:24:33,357 INFO L272 AbstractInterpreter]: Visited 150 different actions 600 times. Merged at 9 different actions 39 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:24:33,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:33,370 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:24:33,746 INFO L227 lantSequenceWeakener]: Weakened 332 states. On average, predicates are now at 81.04% of their original sizes. [2018-10-27 12:24:33,747 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:24:33,890 INFO L415 sIntCurrentIteration]: We unified 334 AI predicates to 334 [2018-10-27 12:24:33,890 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:24:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:24:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2018-10-27 12:24:33,890 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:33,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 12:24:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 12:24:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-27 12:24:33,892 INFO L87 Difference]: Start difference. First operand 4895 states and 6135 transitions. Second operand 15 states. [2018-10-27 12:24:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:48,578 INFO L93 Difference]: Finished difference Result 11488 states and 14532 transitions. [2018-10-27 12:24:48,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 12:24:48,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 335 [2018-10-27 12:24:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:48,601 INFO L225 Difference]: With dead ends: 11488 [2018-10-27 12:24:48,601 INFO L226 Difference]: Without dead ends: 6418 [2018-10-27 12:24:48,613 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 367 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 12:24:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2018-10-27 12:24:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 6078. [2018-10-27 12:24:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6078 states. [2018-10-27 12:24:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 7463 transitions. [2018-10-27 12:24:48,761 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 7463 transitions. Word has length 335 [2018-10-27 12:24:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:48,761 INFO L481 AbstractCegarLoop]: Abstraction has 6078 states and 7463 transitions. [2018-10-27 12:24:48,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 12:24:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 7463 transitions. [2018-10-27 12:24:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-27 12:24:48,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:48,777 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 12:24:48,778 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:48,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1972708365, now seen corresponding path program 1 times [2018-10-27 12:24:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:48,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:48,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:48,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:49,066 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:24:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 108 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 12:24:49,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:24:49,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:24:49,478 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-10-27 12:24:49,479 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:24:49,481 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:24:49,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:24:50,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:24:50,067 INFO L272 AbstractInterpreter]: Visited 148 different actions 586 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:24:50,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:50,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:24:50,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:24:50,074 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:24:50,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:50,083 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:24:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:50,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:24:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-27 12:24:50,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:24:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 108 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 12:24:51,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:24:51,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-27 12:24:51,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:24:51,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 12:24:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 12:24:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:24:51,471 INFO L87 Difference]: Start difference. First operand 6078 states and 7463 transitions. Second operand 9 states. [2018-10-27 12:24:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:54,271 INFO L93 Difference]: Finished difference Result 9590 states and 11722 transitions. [2018-10-27 12:24:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 12:24:54,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 341 [2018-10-27 12:24:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:54,272 INFO L225 Difference]: With dead ends: 9590 [2018-10-27 12:24:54,272 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:24:54,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 687 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-10-27 12:24:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:24:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:24:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:24:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:24:54,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 341 [2018-10-27 12:24:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:54,301 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:24:54,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 12:24:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:24:54,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:24:54,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:24:54,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:54,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:55,807 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 207 [2018-10-27 12:24:55,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:24:56,541 WARN L179 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 305 DAG size of output: 244 [2018-10-27 12:24:57,468 WARN L179 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-27 12:24:57,982 WARN L179 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 77 [2018-10-27 12:25:09,848 WARN L179 SmtUtils]: Spent 11.85 s on a formula simplification. DAG size of input: 358 DAG size of output: 115 [2018-10-27 12:25:10,972 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 228 DAG size of output: 117 [2018-10-27 12:25:12,791 WARN L179 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 263 DAG size of output: 106 [2018-10-27 12:25:12,794 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a25~0)| ~a25~0)) [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 12:25:12,795 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 12:25:12,796 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 12:25:12,797 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,798 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 12:25:12,799 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,800 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 12:25:12,801 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 12:25:12,802 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 12:25:12,803 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,804 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,805 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 12:25:12,806 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 12:25:12,807 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 12:25:12,808 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 12:25:12,809 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 12:25:12,810 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 12:25:12,811 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,811 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,811 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,811 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= 1 |old(~a25~0)|))) (let ((.cse27 (not .cse14)) (.cse11 (not (= 1 ~a21~0))) (.cse19 (< 1 |old(~a25~0)|)) (.cse20 (not (= 0 |old(~a11~0)|))) (.cse21 (< 11 |old(~a28~0)|)) (.cse12 (not (= 8 |old(~a17~0)|))) (.cse22 (< |old(~a25~0)| 0)) (.cse23 (< |old(~a28~0)| 7))) (let ((.cse10 (= ~a19~0 1)) (.cse17 (<= ~a17~0 8)) (.cse18 (<= 7 ~a17~0)) (.cse3 (and (or .cse11 (< |old(~a11~0)| 0) .cse27 (< 1 |old(~a11~0)|) .cse21 .cse23 (< |old(~a17~0)| 7)) (or .cse11 .cse19 .cse20 .cse21 .cse12 .cse22 .cse23))) (.cse5 (< 8 |old(~a17~0)|)) (.cse8 (= ~a17~0 8)) (.cse16 (= |old(~a28~0)| ~a28~0)) (.cse15 (= |old(~a19~0)| ~a19~0)) (.cse7 (= 1 ~a11~0)) (.cse9 (= |old(~a25~0)| ~a25~0)) (.cse2 (= 7 |old(~a17~0)|)) (.cse1 (not (= ~a17~0 7))) (.cse25 (= |old(~a11~0)| |old(~a19~0)|)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse13 (not (= 1 |old(~a11~0)|))) (.cse26 (< 10 |old(~a28~0)|)) (.cse4 (not (= 1 |old(~a19~0)|))) (.cse24 (<= 7 ~a28~0)) (.cse6 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse4 .cse12 .cse13 .cse14) (or (and .cse9 (<= 0 ~a11~0) .cse15 .cse16 (<= ~a11~0 1) .cse17 (not (= ~a19~0 ~a11~0)) .cse18) (and (or .cse11 .cse0 .cse4 .cse19 .cse20 .cse21 .cse12 .cse22 (< |calculate_output_#in~input| 3) .cse23) (or .cse11 .cse4 .cse19 (< 5 |calculate_output_#in~input|) .cse20 .cse21 .cse12 .cse22 .cse23 .cse6))) (or .cse0 .cse13 (and .cse9 .cse24 (<= ~a28~0 11) .cse7 .cse10 .cse17 .cse18) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse20 (= 9 |old(~a28~0)|) (and .cse9 .cse16 .cse15 (= ~a11~0 0) .cse8) .cse23 (or (< 1 |old(~a19~0)|) .cse11 .cse22) (< |old(~a19~0)| 0) .cse19 .cse21 .cse12 .cse6) (or (and .cse15 .cse7 .cse9) .cse25 .cse13) (or (and .cse16 .cse15 .cse7 .cse9) (< |old(~a28~0)| 10) .cse13 .cse14) (or .cse0 .cse11 .cse22 .cse13 .cse23 .cse26 (<= ~a28~0 10) .cse4 .cse19 .cse12 .cse6) (or .cse0 .cse11 (not (= 7 |old(~a28~0)|)) (= ~a28~0 7) .cse27 .cse13 .cse4 .cse12 .cse6) (or .cse2 .cse1 .cse25 .cse13) (or .cse0 .cse11 .cse22 .cse13 .cse23 .cse26 .cse4 .cse19 .cse12 .cse24 .cse6))))) [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 12:25:12,812 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,813 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 568) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 12:25:12,814 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:25:12,815 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 12:25:12,816 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 12:25:12,817 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:25:12,818 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-27 12:25:12,819 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:25:12,819 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:25:12,819 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:25:12,819 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 12:25:12,819 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse4 (= ~a11~0 0)) (.cse2 (<= 7 ~a28~0)) (.cse0 (<= ~a28~0 11)) (.cse5 (<= 0 ~a25~0)) (.cse7 (<= ~a25~0 1)) (.cse8 (not .cse1)) (.cse3 (= 1 ~a11~0)) (.cse6 (= ~a17~0 8))) (or (and (and .cse0 .cse1 (<= ~a17~0 8) .cse2 (<= 7 ~a17~0)) .cse3) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse3 (not (= ~a19~0 ~a11~0))) (and .cse2 .cse4 (<= 0 ~a19~0) (and .cse0 .cse5 (<= ~a19~0 1) .cse6 .cse7) (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and (<= 10 ~a28~0) .cse8 .cse3) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (and .cse4 (= ~a19~0 1) .cse2) (and .cse0 .cse5 .cse6 .cse7)) (not (= ~a~0 1)) (and .cse8 .cse3 .cse6) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-27 12:25:12,819 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:25:12,820 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:25:12,820 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (<= 0 ~a19~0)) (.cse11 (= ~a25~0 1)) (.cse16 (<= 0 ~a11~0)) (.cse12 (<= 0 (+ main_~input~0 2147483648))) (.cse13 (<= ~a28~0 11)) (.cse17 (<= 0 ~a25~0)) (.cse5 (= ~a11~0 0)) (.cse10 (= ~a17~0 8)) (.cse8 (= ~a21~0 1)) (.cse4 (<= 7 ~a28~0)) (.cse18 (<= ~a25~0 1))) (let ((.cse0 (<= 1 main_~input~0)) (.cse1 (<= main_~input~0 6)) (.cse3 (let ((.cse19 (= ~a19~0 1))) (or (and .cse12 .cse13 (<= ~a11~0 1) .cse19 .cse8 .cse11 (<= ~a17~0 8) .cse4 .cse16 (<= 7 ~a17~0)) (and .cse12 .cse13 .cse17 .cse5 .cse10 .cse19 .cse8 .cse4 .cse18)))) (.cse7 (let ((.cse14 (<= ~a19~0 1)) (.cse15 (<= ~a11~0 3))) (or (and .cse12 .cse13 (<= 6 ~a28~0) .cse6 .cse14 .cse10 .cse8 .cse11 .cse15 .cse16) (and .cse12 .cse13 .cse17 .cse14 .cse10 .cse8 .cse15 .cse4 .cse16 (<= 0 (+ ~a19~0 1)) .cse18)))) (.cse9 (not .cse11)) (.cse2 (= 1 ~a11~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6 (not (= ~a28~0 9)) .cse7) (not .cse8) (not (= ~y~0 25)) (and .cse2 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse3 .cse7) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and (<= 10 ~a28~0) .cse9 .cse2) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse9 .cse2 .cse10) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-27 12:25:12,820 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 12:25:12,820 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 12:25:12,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:25:12 BoogieIcfgContainer [2018-10-27 12:25:12,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:25:12,842 INFO L168 Benchmark]: Toolchain (without parser) took 116106.28 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 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 12:25:12,844 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:25:12,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.56 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-27 12:25:12,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-27 12:25:12,849 INFO L168 Benchmark]: Boogie Preprocessor took 75.37 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:25:12,850 INFO L168 Benchmark]: RCFGBuilder took 3298.02 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: 102.7 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:25:12,850 INFO L168 Benchmark]: TraceAbstraction took 111739.66 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -950.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 12:25:12,856 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.56 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 213.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.37 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 3298.02 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: 102.7 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111739.66 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -950.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 568]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a28 <= 11 && a25 == 1) && a17 <= 8) && 7 <= a28) && 7 <= a17) && 1 == a11) || !(a21 == 1)) || !(y == 25)) || (1 == a11 && !(a19 == a11))) || ((((7 <= a28 && a11 == 0) && 0 <= a19) && (((a28 <= 11 && 0 <= a25) && a19 <= 1) && a17 == 8) && a25 <= 1) && !(a28 == 9))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || ((10 <= a28 && !(a25 == 1)) && 1 == a11)) || !(23 == w)) || !(\old(a28) == 7)) || (((1 <= input && input <= 6) && (a11 == 0 && a19 == 1) && 7 <= a28) && ((a28 <= 11 && 0 <= a25) && a17 == 8) && a25 <= 1)) || !(a == 1)) || ((!(a25 == 1) && 1 == a11) && a17 == 8)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 111.6s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 76.1s AutomataDifference, 0.0s DeadEndRemovalTime, 18.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1811 SDtfs, 10813 SDslu, 2694 SDs, 0 SdLazy, 13839 SolverSat, 2452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2127 GetRequests, 1911 SyntacticMatches, 21 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6078occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.3s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9970299743954054 AbsIntWeakeningRatio, 0.18996138996138995 AbsIntAvgWeakeningVarsNumRemoved, 28.942857142857143 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 1389 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 199 PreInvPairs, 283 NumberOfFragments, 1314 HoareAnnotationTreeSize, 199 FomulaSimplifications, 49322 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 40235 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2615 NumberOfCodeBlocks, 2615 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2943 ConstructedInterpolants, 0 QuantifiedInterpolants, 1518618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 683 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 1632/2089 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...