java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:51:49,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:51:49,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:51:49,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:51:49,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:51:49,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:51:49,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:51:49,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:51:49,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:51:49,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:51:49,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:51:49,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:51:49,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:51:49,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:51:49,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:51:49,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:51:49,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:51:49,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:51:49,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:51:49,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:51:49,241 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:51:49,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:51:49,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:51:49,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:51:49,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:51:49,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:51:49,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:51:49,256 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:51:49,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:51:49,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:51:49,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:51:49,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:51:49,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:51:49,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:51:49,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:51:49,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:51:49,265 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:51:49,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:51:49,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:51:49,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:51:49,298 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:51:49,298 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:51:49,299 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:51:49,299 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:51:49,299 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:51:49,299 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:51:49,299 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:51:49,303 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:51:49,303 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:51:49,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:51:49,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:51:49,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:51:49,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:51:49,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:51:49,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:51:49,307 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:51:49,307 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:51:49,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:51:49,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:51:49,308 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:51:49,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:51:49,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:51:49,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:51:49,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:51:49,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:51:49,309 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:51:49,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:51:49,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:51:49,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:51:49,311 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:51:49,311 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:51:49,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:51:49,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:51:49,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:51:49,402 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:51:49,402 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:51:49,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2018-11-07 12:51:49,458 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f5c2c03/e7e1dadea9074c11b6356046a6c50d89/FLAG8cbc963c6 [2018-11-07 12:51:50,016 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:51:50,017 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2018-11-07 12:51:50,035 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f5c2c03/e7e1dadea9074c11b6356046a6c50d89/FLAG8cbc963c6 [2018-11-07 12:51:50,062 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f5c2c03/e7e1dadea9074c11b6356046a6c50d89 [2018-11-07 12:51:50,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:51:50,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:51:50,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:51:50,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:51:50,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:51:50,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b60cd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50, skipping insertion in model container [2018-11-07 12:51:50,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:51:50,182 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:51:50,623 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:51:50,632 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:51:50,757 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:51:50,783 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:51:50,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50 WrapperNode [2018-11-07 12:51:50,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:51:50,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:51:50,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:51:50,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:51:50,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:51:50,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:51:50,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:51:50,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:51:50,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:50,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:51,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:51,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:51,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... [2018-11-07 12:51:51,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:51:51,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:51:51,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:51:51,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:51:51,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:51:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:51:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:51:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:51:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:51:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:51:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:51:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:51:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:51:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:51:54,713 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:51:54,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:51:54 BoogieIcfgContainer [2018-11-07 12:51:54,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:51:54,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:51:54,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:51:54,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:51:54,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:51:50" (1/3) ... [2018-11-07 12:51:54,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419a560a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:51:54, skipping insertion in model container [2018-11-07 12:51:54,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:50" (2/3) ... [2018-11-07 12:51:54,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419a560a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:51:54, skipping insertion in model container [2018-11-07 12:51:54,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:51:54" (3/3) ... [2018-11-07 12:51:54,729 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label04_true-unreach-call_false-termination.c [2018-11-07 12:51:54,739 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:51:54,749 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:51:54,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:51:54,804 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:51:54,804 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:51:54,805 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:51:54,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:51:54,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:51:54,805 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:51:54,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:51:54,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:51:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:51:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 12:51:54,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:54,849 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] [2018-11-07 12:51:54,851 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:54,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -744241401, now seen corresponding path program 1 times [2018-11-07 12:51:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:54,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:54,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:54,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:54,916 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:55,440 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:51:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:55,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:51:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:51:55,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:55,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:51:55,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:51:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:51:55,574 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:51:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:57,046 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-07 12:51:57,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:51:57,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-11-07 12:51:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:57,067 INFO L225 Difference]: With dead ends: 618 [2018-11-07 12:51:57,067 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 12:51:57,074 INFO L604 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-11-07 12:51:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 12:51:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 12:51:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 12:51:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-07 12:51:57,153 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 113 [2018-11-07 12:51:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:57,155 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-07 12:51:57,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:51:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-07 12:51:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 12:51:57,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:57,165 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] [2018-11-07 12:51:57,166 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:57,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1318428498, now seen corresponding path program 1 times [2018-11-07 12:51:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:57,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:57,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:51:57,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:51:57,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:57,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:51:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:51:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:51:57,371 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-07 12:51:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:59,584 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-11-07 12:51:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 12:51:59,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-11-07 12:51:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:59,600 INFO L225 Difference]: With dead ends: 1229 [2018-11-07 12:51:59,600 INFO L226 Difference]: Without dead ends: 856 [2018-11-07 12:51:59,605 INFO L604 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-11-07 12:51:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-07 12:51:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-11-07 12:51:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-11-07 12:51:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-11-07 12:51:59,670 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 129 [2018-11-07 12:51:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:59,671 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-11-07 12:51:59,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:51:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-11-07 12:51:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 12:51:59,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:59,679 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:59,679 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:59,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1830664699, now seen corresponding path program 1 times [2018-11-07 12:51:59,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:59,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:59,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:00,188 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 12:52:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:52:00,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:52:00,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:52:00,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:00,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:52:00,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:52:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:52:00,420 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 5 states. [2018-11-07 12:52:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:03,684 INFO L93 Difference]: Finished difference Result 1778 states and 2834 transitions. [2018-11-07 12:52:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:52:03,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-11-07 12:52:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:03,694 INFO L225 Difference]: With dead ends: 1778 [2018-11-07 12:52:03,695 INFO L226 Difference]: Without dead ends: 813 [2018-11-07 12:52:03,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:52:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-11-07 12:52:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2018-11-07 12:52:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-11-07 12:52:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1260 transitions. [2018-11-07 12:52:03,748 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1260 transitions. Word has length 140 [2018-11-07 12:52:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:03,748 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1260 transitions. [2018-11-07 12:52:03,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:52:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1260 transitions. [2018-11-07 12:52:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 12:52:03,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:03,755 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:52:03,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:03,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash 654500000, now seen corresponding path program 1 times [2018-11-07 12:52:03,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:03,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:03,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:04,033 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:52:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 12:52:04,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:04,476 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:04,477 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-07 12:52:04,479 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [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], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:04,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:04,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:05,313 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:05,315 INFO L272 AbstractInterpreter]: Visited 114 different actions 114 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 12:52:05,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:05,358 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:06,013 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 81% of their original sizes. [2018-11-07 12:52:06,014 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:07,243 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-07 12:52:07,243 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:07,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:07,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:52:07,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:07,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:52:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:52:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:52:07,246 INFO L87 Difference]: Start difference. First operand 813 states and 1260 transitions. Second operand 14 states. [2018-11-07 12:52:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:24,247 INFO L93 Difference]: Finished difference Result 1920 states and 2965 transitions. [2018-11-07 12:52:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 12:52:24,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 181 [2018-11-07 12:52:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:24,258 INFO L225 Difference]: With dead ends: 1920 [2018-11-07 12:52:24,258 INFO L226 Difference]: Without dead ends: 1113 [2018-11-07 12:52:24,261 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-07 12:52:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-11-07 12:52:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 960. [2018-11-07 12:52:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-11-07 12:52:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1414 transitions. [2018-11-07 12:52:24,297 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1414 transitions. Word has length 181 [2018-11-07 12:52:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:24,297 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 1414 transitions. [2018-11-07 12:52:24,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:52:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1414 transitions. [2018-11-07 12:52:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 12:52:24,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:24,302 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:52:24,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:24,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1852596897, now seen corresponding path program 1 times [2018-11-07 12:52:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:24,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:24,305 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 73 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 12:52:24,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:24,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:24,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-11-07 12:52:24,531 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [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], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:24,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:24,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:25,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:25,219 INFO L272 AbstractInterpreter]: Visited 118 different actions 348 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:52:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:25,258 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:25,699 INFO L227 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 81.02% of their original sizes. [2018-11-07 12:52:25,699 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:29,397 INFO L415 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-11-07 12:52:29,397 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:29,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:29,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 22 [2018-11-07 12:52:29,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:29,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 12:52:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 12:52:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 12:52:29,399 INFO L87 Difference]: Start difference. First operand 960 states and 1414 transitions. Second operand 15 states. [2018-11-07 12:52:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:49,082 INFO L93 Difference]: Finished difference Result 2862 states and 4179 transitions. [2018-11-07 12:52:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 12:52:49,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2018-11-07 12:52:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:49,094 INFO L225 Difference]: With dead ends: 2862 [2018-11-07 12:52:49,094 INFO L226 Difference]: Without dead ends: 1908 [2018-11-07 12:52:49,099 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 57 SyntacticMatches, 120 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:52:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2018-11-07 12:52:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1328. [2018-11-07 12:52:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-11-07 12:52:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1862 transitions. [2018-11-07 12:52:49,147 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1862 transitions. Word has length 191 [2018-11-07 12:52:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:49,147 INFO L480 AbstractCegarLoop]: Abstraction has 1328 states and 1862 transitions. [2018-11-07 12:52:49,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 12:52:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1862 transitions. [2018-11-07 12:52:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 12:52:49,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:49,154 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:52:49,154 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:49,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1563017015, now seen corresponding path program 1 times [2018-11-07 12:52:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:49,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:52:49,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:49,349 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:49,349 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-07 12:52:49,349 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], [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], [301], [306], [308], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:49,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:49,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:49,713 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:49,713 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:52:49,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:49,753 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:50,140 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 80.83% of their original sizes. [2018-11-07 12:52:50,140 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:51,163 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-07 12:52:51,164 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:52:51,165 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:51,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:52:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:52:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:52:51,166 INFO L87 Difference]: Start difference. First operand 1328 states and 1862 transitions. Second operand 18 states. [2018-11-07 12:53:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:03,443 INFO L93 Difference]: Finished difference Result 3105 states and 4362 transitions. [2018-11-07 12:53:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:53:03,444 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2018-11-07 12:53:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:03,452 INFO L225 Difference]: With dead ends: 3105 [2018-11-07 12:53:03,452 INFO L226 Difference]: Without dead ends: 1783 [2018-11-07 12:53:03,457 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 12:53:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-11-07 12:53:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1773. [2018-11-07 12:53:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2018-11-07 12:53:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2390 transitions. [2018-11-07 12:53:03,510 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2390 transitions. Word has length 198 [2018-11-07 12:53:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:03,510 INFO L480 AbstractCegarLoop]: Abstraction has 1773 states and 2390 transitions. [2018-11-07 12:53:03,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:53:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2390 transitions. [2018-11-07 12:53:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 12:53:03,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:03,518 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:03,518 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:03,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash 781854229, now seen corresponding path program 1 times [2018-11-07 12:53:03,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:03,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:03,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 12:53:03,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:03,736 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:03,736 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-11-07 12:53:03,737 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [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], [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], [301], [306], [308], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:03,741 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:03,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:04,349 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:53:04,349 INFO L272 AbstractInterpreter]: Visited 119 different actions 477 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:53:04,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:04,364 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:53:04,640 INFO L227 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 80.83% of their original sizes. [2018-11-07 12:53:04,640 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:53:04,819 INFO L415 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2018-11-07 12:53:04,820 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:53:04,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:04,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-11-07 12:53:04,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:04,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:53:04,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:53:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:53:04,822 INFO L87 Difference]: Start difference. First operand 1773 states and 2390 transitions. Second operand 10 states. [2018-11-07 12:53:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:11,185 INFO L93 Difference]: Finished difference Result 4033 states and 5481 transitions. [2018-11-07 12:53:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 12:53:11,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2018-11-07 12:53:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:11,195 INFO L225 Difference]: With dead ends: 4033 [2018-11-07 12:53:11,195 INFO L226 Difference]: Without dead ends: 2266 [2018-11-07 12:53:11,200 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 182 SyntacticMatches, 26 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:53:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2018-11-07 12:53:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2185. [2018-11-07 12:53:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2018-11-07 12:53:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2905 transitions. [2018-11-07 12:53:11,264 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2905 transitions. Word has length 217 [2018-11-07 12:53:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:11,264 INFO L480 AbstractCegarLoop]: Abstraction has 2185 states and 2905 transitions. [2018-11-07 12:53:11,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:53:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2905 transitions. [2018-11-07 12:53:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 12:53:11,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:11,272 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:53:11,273 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:11,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1182170496, now seen corresponding path program 1 times [2018-11-07 12:53:11,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:11,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:11,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 12:53:11,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:11,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:11,432 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 12:53:11,432 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], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:11,436 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:11,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:11,702 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:53:11,703 INFO L272 AbstractInterpreter]: Visited 118 different actions 232 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:53:11,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:11,711 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:53:12,114 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 81.39% of their original sizes. [2018-11-07 12:53:12,114 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:53:12,567 INFO L415 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2018-11-07 12:53:12,567 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:53:12,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:12,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-07 12:53:12,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:12,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 12:53:12,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 12:53:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:53:12,569 INFO L87 Difference]: Start difference. First operand 2185 states and 2905 transitions. Second operand 20 states. [2018-11-07 12:53:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:29,241 INFO L93 Difference]: Finished difference Result 4955 states and 6479 transitions. [2018-11-07 12:53:29,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 12:53:29,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 219 [2018-11-07 12:53:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:29,252 INFO L225 Difference]: With dead ends: 4955 [2018-11-07 12:53:29,252 INFO L226 Difference]: Without dead ends: 2776 [2018-11-07 12:53:29,258 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 233 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 12:53:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2018-11-07 12:53:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2625. [2018-11-07 12:53:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2018-11-07 12:53:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3405 transitions. [2018-11-07 12:53:29,337 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3405 transitions. Word has length 219 [2018-11-07 12:53:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:29,337 INFO L480 AbstractCegarLoop]: Abstraction has 2625 states and 3405 transitions. [2018-11-07 12:53:29,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 12:53:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3405 transitions. [2018-11-07 12:53:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 12:53:29,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:29,346 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:29,347 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:29,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2013084095, now seen corresponding path program 1 times [2018-11-07 12:53:29,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:29,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:29,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:29,663 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 12:53:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:29,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:29,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:29,952 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 12:53:29,952 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:29,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:29,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:30,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:53:30,481 INFO L272 AbstractInterpreter]: Visited 121 different actions 357 times. Merged at 8 different actions 22 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:53:30,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:30,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:53:30,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:30,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:53:30,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:30,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:53:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:30,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:53:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:53:30,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:53:30,971 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:53:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:53:31,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:53:31,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-11-07 12:53:31,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:53:31,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 12:53:31,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 12:53:31,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:53:31,247 INFO L87 Difference]: Start difference. First operand 2625 states and 3405 transitions. Second operand 15 states. [2018-11-07 12:53:31,789 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 12:53:32,860 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-07 12:53:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:35,511 INFO L93 Difference]: Finished difference Result 7136 states and 9541 transitions. [2018-11-07 12:53:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 12:53:35,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 221 [2018-11-07 12:53:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:35,532 INFO L225 Difference]: With dead ends: 7136 [2018-11-07 12:53:35,532 INFO L226 Difference]: Without dead ends: 4639 [2018-11-07 12:53:35,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 449 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 12:53:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2018-11-07 12:53:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 4245. [2018-11-07 12:53:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2018-11-07 12:53:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 5118 transitions. [2018-11-07 12:53:35,684 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 5118 transitions. Word has length 221 [2018-11-07 12:53:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:35,684 INFO L480 AbstractCegarLoop]: Abstraction has 4245 states and 5118 transitions. [2018-11-07 12:53:35,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 12:53:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 5118 transitions. [2018-11-07 12:53:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 12:53:35,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:35,698 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:53:35,698 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:35,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1678132212, now seen corresponding path program 1 times [2018-11-07 12:53:35,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:35,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:35,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 128 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-07 12:53:36,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:36,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:36,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-11-07 12:53:36,125 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [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], [301], [306], [308], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:36,129 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:36,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:40,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:53:40,201 INFO L272 AbstractInterpreter]: Visited 122 different actions 2689 times. Merged at 9 different actions 253 times. Widened at 1 different actions 19 times. Found 62 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:53:40,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:40,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:53:40,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:40,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:53:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:40,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:53:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:40,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:53:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 72 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-07 12:53:40,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:53:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 128 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-07 12:53:40,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:53:40,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 12:53:40,595 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:53:40,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 12:53:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 12:53:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:53:40,596 INFO L87 Difference]: Start difference. First operand 4245 states and 5118 transitions. Second operand 9 states. [2018-11-07 12:53:42,973 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-07 12:53:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:45,843 INFO L93 Difference]: Finished difference Result 12739 states and 16440 transitions. [2018-11-07 12:53:45,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 12:53:45,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 237 [2018-11-07 12:53:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:45,875 INFO L225 Difference]: With dead ends: 12739 [2018-11-07 12:53:45,875 INFO L226 Difference]: Without dead ends: 7688 [2018-11-07 12:53:45,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 493 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 12:53:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7688 states. [2018-11-07 12:53:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7688 to 7431. [2018-11-07 12:53:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7431 states. [2018-11-07 12:53:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7431 states to 7431 states and 8906 transitions. [2018-11-07 12:53:46,125 INFO L78 Accepts]: Start accepts. Automaton has 7431 states and 8906 transitions. Word has length 237 [2018-11-07 12:53:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:46,125 INFO L480 AbstractCegarLoop]: Abstraction has 7431 states and 8906 transitions. [2018-11-07 12:53:46,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 12:53:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 8906 transitions. [2018-11-07 12:53:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 12:53:46,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:46,151 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:53:46,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:46,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1828042951, now seen corresponding path program 1 times [2018-11-07 12:53:46,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:46,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:46,453 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:53:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 155 proven. 53 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 12:53:46,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:46,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:46,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2018-11-07 12:53:46,712 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:46,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:46,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:47,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:53:47,884 INFO L272 AbstractInterpreter]: Visited 122 different actions 976 times. Merged at 9 different actions 88 times. Widened at 1 different actions 5 times. Found 21 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 12:53:47,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:47,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:53:47,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:47,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:53:47,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:47,899 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:53:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:47,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:53:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 12:53:48,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:53:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 167 proven. 28 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-07 12:53:48,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:53:48,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-07 12:53:48,365 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:53:48,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:53:48,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:53:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:53:48,367 INFO L87 Difference]: Start difference. First operand 7431 states and 8906 transitions. Second operand 11 states. [2018-11-07 12:53:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:50,394 INFO L93 Difference]: Finished difference Result 15892 states and 19358 transitions. [2018-11-07 12:53:50,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:53:50,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 248 [2018-11-07 12:53:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:50,442 INFO L225 Difference]: With dead ends: 15892 [2018-11-07 12:53:50,442 INFO L226 Difference]: Without dead ends: 8759 [2018-11-07 12:53:50,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 498 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:53:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2018-11-07 12:53:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 8662. [2018-11-07 12:53:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2018-11-07 12:53:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 9975 transitions. [2018-11-07 12:53:50,689 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 9975 transitions. Word has length 248 [2018-11-07 12:53:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:50,690 INFO L480 AbstractCegarLoop]: Abstraction has 8662 states and 9975 transitions. [2018-11-07 12:53:50,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:53:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 9975 transitions. [2018-11-07 12:53:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-07 12:53:50,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:50,719 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:50,719 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:50,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1982816671, now seen corresponding path program 1 times [2018-11-07 12:53:50,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:50,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:50,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:50,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:50,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 144 proven. 35 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 12:53:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:51,422 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:51,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-07 12:53:51,423 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [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], [156], [160], [163], [166], [170], [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], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:51,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:51,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:51,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:53:51,898 INFO L272 AbstractInterpreter]: Visited 120 different actions 358 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:53:51,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:51,936 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:53:52,639 INFO L227 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 80.83% of their original sizes. [2018-11-07 12:53:52,639 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:53:53,175 INFO L415 sIntCurrentIteration]: We unified 259 AI predicates to 259 [2018-11-07 12:53:53,176 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:53:53,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:53,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-07 12:53:53,176 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:53,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:53:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:53:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:53:53,177 INFO L87 Difference]: Start difference. First operand 8662 states and 9975 transitions. Second operand 11 states. [2018-11-07 12:54:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:00,025 INFO L93 Difference]: Finished difference Result 17599 states and 20742 transitions. [2018-11-07 12:54:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 12:54:00,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 260 [2018-11-07 12:54:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:00,058 INFO L225 Difference]: With dead ends: 17599 [2018-11-07 12:54:00,058 INFO L226 Difference]: Without dead ends: 11053 [2018-11-07 12:54:00,077 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-11-07 12:54:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2018-11-07 12:54:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 10957. [2018-11-07 12:54:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10957 states. [2018-11-07 12:54:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10957 states to 10957 states and 12635 transitions. [2018-11-07 12:54:00,324 INFO L78 Accepts]: Start accepts. Automaton has 10957 states and 12635 transitions. Word has length 260 [2018-11-07 12:54:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:00,324 INFO L480 AbstractCegarLoop]: Abstraction has 10957 states and 12635 transitions. [2018-11-07 12:54:00,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:54:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 10957 states and 12635 transitions. [2018-11-07 12:54:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 12:54:00,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:00,357 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:00,357 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:00,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:00,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1553696004, now seen corresponding path program 1 times [2018-11-07 12:54:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:00,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:00,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:00,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:01,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:01,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:01,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-11-07 12:54:01,242 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [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], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [575], [577], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:01,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:01,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:02,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:54:02,958 INFO L272 AbstractInterpreter]: Visited 121 different actions 1069 times. Merged at 8 different actions 76 times. Widened at 1 different actions 4 times. Found 16 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:54:02,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:02,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:54:02,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:02,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:54:02,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:02,974 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:54:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:03,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:54:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 12:54:03,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:54:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 12:54:03,369 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:03,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-11-07 12:54:03,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:03,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:54:03,371 INFO L87 Difference]: Start difference. First operand 10957 states and 12635 transitions. Second operand 3 states. [2018-11-07 12:54:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:04,055 INFO L93 Difference]: Finished difference Result 20407 states and 23636 transitions. [2018-11-07 12:54:04,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:04,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-07 12:54:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:04,056 INFO L225 Difference]: With dead ends: 20407 [2018-11-07 12:54:04,056 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:54:04,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 556 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:54:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:54:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:54:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:54:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:54:04,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 279 [2018-11-07 12:54:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:04,080 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:54:04,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:54:04,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:54:04,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:54:04,432 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2018-11-07 12:54:04,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:04,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:04,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:05,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:06,293 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 316 DAG size of output: 261 [2018-11-07 12:54:06,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:07,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:07,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:07,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:07,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:07,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:54:07,650 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 359 DAG size of output: 318 [2018-11-07 12:54:08,600 WARN L179 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-07 12:54:09,615 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2018-11-07 12:54:12,014 WARN L179 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 398 DAG size of output: 67 [2018-11-07 12:54:13,325 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 287 DAG size of output: 93 [2018-11-07 12:54:15,555 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 345 DAG size of output: 97 [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:54:15,558 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)|) (= ~a17~0 |old(~a17~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,558 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:54:15,559 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:54:15,560 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,561 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:54:15,562 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:54:15,563 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:54:15,564 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:54:15,565 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,566 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:54:15,567 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:54:15,568 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:54:15,569 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:54:15,570 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse8 (= 7 ~a17~0)) (.cse11 (= ~a11~0 |old(~a11~0)|)) (.cse9 (= |old(~a28~0)| ~a28~0)) (.cse10 (= |old(~a19~0)| ~a19~0)) (.cse12 (= ~a17~0 |old(~a17~0)|)) (.cse13 (= ~a25~0 |old(~a25~0)|))) (let ((.cse4 (not (= |old(~a17~0)| 8))) (.cse6 (and .cse11 .cse9 .cse10 .cse12 .cse13)) (.cse3 (< 10 |old(~a28~0)|)) (.cse1 (and .cse9 .cse10 .cse11 .cse8 .cse13)) (.cse7 (not (= 1 |old(~a25~0)|))) (.cse0 (not (= 1 ~a21~0))) (.cse14 (= |old(~a17~0)| |old(~a28~0)|)) (.cse5 (= |old(~a11~0)| |old(~a19~0)|)) (.cse2 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 .cse1 (< |old(~a28~0)| 11) .cse2) (or .cse3 .cse0 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse6 .cse4 .cse5) (or .cse0 (and (= 7 ~a28~0) (= 1 ~a11~0) .cse8 (= 1 ~a25~0) (= 1 ~a19~0)) (not (= 7 |old(~a28~0)|)) .cse7 (not (= 1 |old(~a19~0)|)) (not (= 1 |old(~a11~0)|)) .cse2) (or .cse3 .cse0 (= 10 |old(~a28~0)|) .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse3 .cse0 .cse7 .cse4 .cse6) (or .cse3 .cse0 (< |old(~a28~0)| 10) (and .cse10 .cse11 .cse8 (<= ~a28~0 10) (<= |old(~a28~0)| ~a28~0) .cse13) .cse2) (or .cse0 .cse1 .cse7 .cse14 .cse2) (or .cse0 (and .cse9 .cse10 .cse11 .cse8) .cse14 .cse5 .cse2)))) [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,571 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:54:15,572 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:54:15,573 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 490) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,574 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:54:15,575 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:54:15,576 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:54:15,577 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:54:15,577 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 12:54:15,577 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:54:15,577 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:54:15,577 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:54:15,577 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:54:15,578 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse7 (not (= ~a19~0 ~a11~0))) (.cse5 (= ~a21~0 1))) (let ((.cse1 (and (not (= ~a17~0 7)) .cse7 .cse5)) (.cse4 (= 1 ~a25~0)) (.cse6 (not (= ~a28~0 ~a17~0))) (.cse3 (= 7 ~a17~0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse2 (<= ~a28~0 10))) (or (and (and .cse0 .cse1) .cse2) (and (= 1 ~a11~0) .cse3 .cse4 (= 1 ~a19~0)) (and (<= 10 ~a28~0) .cse3) (not .cse5) (not (= ~y~0 25)) (and .cse6 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse4 .cse2) (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)|)) (and .cse6 .cse3 .cse7) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse0 .cse2 (not (= ~a28~0 10))) (not (= 6 ~f~0))))) [2018-11-07 12:54:15,578 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:54:15,578 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:54:15,578 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (= 1 ~a25~0)) (.cse5 (not (= ~a28~0 ~a17~0))) (.cse3 (= 7 ~a17~0)) (.cse2 (not (= ~a19~0 ~a11~0))) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse1 (<= ~a28~0 10))) (or (and .cse0 .cse1 .cse2) (and (= 1 ~a11~0) .cse3 .cse4 (= 1 ~a19~0)) (and (<= 10 ~a28~0) .cse3) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse5 .cse3 .cse4) (and .cse0 .cse4 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse4 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse5 .cse3 .cse2) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse0 .cse1 (not (= ~a28~0 10))) (not (= 6 ~f~0)))) [2018-11-07 12:54:15,578 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:54:15,578 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:54:15,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:54:15 BoogieIcfgContainer [2018-11-07 12:54:15,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:54:15,603 INFO L168 Benchmark]: Toolchain (without parser) took 145527.33 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 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 12:54:15,605 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:54:15,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:15,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:15,608 INFO L168 Benchmark]: Boogie Preprocessor took 102.98 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:15,610 INFO L168 Benchmark]: RCFGBuilder took 3675.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2018-11-07 12:54:15,610 INFO L168 Benchmark]: TraceAbstraction took 140884.12 ms. Allocated memory was 2.2 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 2.6 GB in the end (delta: -595.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 12:54:15,620 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.17 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 705.81 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 153.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.98 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3675.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140884.12 ms. Allocated memory was 2.2 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 2.6 GB in the end (delta: -595.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 490]: 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: (((((((((((((((((((((((((\old(a17) == a17 && (!(a17 == 7) && !(a19 == a11)) && a21 == 1) && a28 <= 10) || (((1 == a11 && 7 == a17) && 1 == a25) && 1 == a19)) || (10 <= a28 && 7 == a17)) || !(a21 == 1)) || !(y == 25)) || ((!(a28 == a17) && 7 == a17) && 1 == a25)) || ((\old(a17) == a17 && 1 == a25) && (!(a17 == 7) && !(a19 == a11)) && a21 == 1)) || ((\old(a17) == a17 && 1 == a25) && a28 <= 10)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || ((!(a28 == a17) && 7 == a17) && !(a19 == a11))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || ((\old(a17) == a17 && a28 <= 10) && !(a28 == 10))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 140.7s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 98.4s AutomataDifference, 0.0s DeadEndRemovalTime, 11.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2043 SDtfs, 15596 SDslu, 3131 SDs, 0 SdLazy, 20343 SolverSat, 3245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.2s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 3451 GetRequests, 3043 SyntacticMatches, 158 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2448 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10957occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.9s AbstIntTime, 10 AbstIntIterations, 6 AbstIntStrong, 0.9971251002903646 AbsIntWeakeningRatio, 0.2119047619047619 AbsIntAvgWeakeningVarsNumRemoved, 23.91111111111111 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1852 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 306 PreInvPairs, 447 NumberOfFragments, 777 HoareAnnotationTreeSize, 306 FomulaSimplifications, 104287 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 164619 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 3618 NumberOfCodeBlocks, 3618 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4582 ConstructedInterpolants, 0 QuantifiedInterpolants, 2412947 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2284 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 3151/3452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...