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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:09:19,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:09:19,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:09:19,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:09:19,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:09:19,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:09:19,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:09:19,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:09:19,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:09:19,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:09:19,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:09:19,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:09:19,510 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:09:19,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:09:19,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:09:19,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:09:19,514 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:09:19,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:09:19,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:09:19,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:09:19,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:09:19,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:09:19,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:09:19,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:09:19,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:09:19,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:09:19,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:09:19,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:09:19,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:09:19,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:09:19,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:09:19,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:09:19,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:09:19,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:09:19,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:09:19,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:09:19,534 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:09:19,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:09:19,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:09:19,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:09:19,554 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:09:19,554 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:09:19,555 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:09:19,558 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:09:19,558 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:09:19,558 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:09:19,558 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:09:19,558 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:09:19,559 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:09:19,559 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:09:19,559 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:09:19,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:09:19,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:09:19,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:09:19,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:09:19,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:09:19,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:09:19,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:09:19,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:09:19,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:09:19,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:09:19,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:09:19,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:09:19,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:09:19,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:09:19,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:09:19,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:09:19,564 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:09:19,564 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:09:19,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:09:19,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:09:19,565 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:09:19,565 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:09:19,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:09:19,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:09:19,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:09:19,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:09:19,660 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:09:19,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-11-07 07:09:19,722 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00f4d036/1eda5f8de2b2498d9e91cf47de5810be/FLAG2b68b4c14 [2018-11-07 07:09:20,282 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:09:20,283 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-11-07 07:09:20,298 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00f4d036/1eda5f8de2b2498d9e91cf47de5810be/FLAG2b68b4c14 [2018-11-07 07:09:20,328 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00f4d036/1eda5f8de2b2498d9e91cf47de5810be [2018-11-07 07:09:20,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:09:20,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:09:20,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:20,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:09:20,360 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:09:20,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:20" (1/1) ... [2018-11-07 07:09:20,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675b5dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:20, skipping insertion in model container [2018-11-07 07:09:20,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:20" (1/1) ... [2018-11-07 07:09:20,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:09:20,454 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:09:20,899 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:20,904 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:09:21,021 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:21,044 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:09:21,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21 WrapperNode [2018-11-07 07:09:21,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:21,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:21,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:09:21,047 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:09:21,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:21,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:09:21,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:09:21,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:09:21,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (1/1) ... [2018-11-07 07:09:21,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:09:21,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:09:21,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:09:21,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:09:21,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (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 07:09:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:09:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:09:21,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:09:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:09:21,345 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:09:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:09:21,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:09:21,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:09:21,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:09:24,532 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:09:24,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:24 BoogieIcfgContainer [2018-11-07 07:09:24,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:09:24,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:09:24,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:09:24,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:09:24,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:09:20" (1/3) ... [2018-11-07 07:09:24,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a33ead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:24, skipping insertion in model container [2018-11-07 07:09:24,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:21" (2/3) ... [2018-11-07 07:09:24,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a33ead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:24, skipping insertion in model container [2018-11-07 07:09:24,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:24" (3/3) ... [2018-11-07 07:09:24,547 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-11-07 07:09:24,559 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:09:24,571 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:09:24,590 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:09:24,648 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:09:24,649 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:09:24,649 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:09:24,649 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:09:24,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:09:24,650 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:09:24,650 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:09:24,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:09:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 07:09:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 07:09:24,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:24,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:24,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:24,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:24,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1592268880, now seen corresponding path program 1 times [2018-11-07 07:09:24,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:24,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:24,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:25,396 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:25,542 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 07:09:25,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:09:25,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:25,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:09:25,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:09:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:25,575 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 07:09:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:27,095 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 07:09:27,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:09:27,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-11-07 07:09:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:27,116 INFO L225 Difference]: With dead ends: 621 [2018-11-07 07:09:27,116 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 07:09:27,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 07:09:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 07:09:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 07:09:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 07:09:27,203 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 118 [2018-11-07 07:09:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:27,205 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 07:09:27,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:09:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 07:09:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 07:09:27,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:27,213 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:27,213 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1462652163, now seen corresponding path program 1 times [2018-11-07 07:09:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:27,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:27,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:27,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:27,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:27,674 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 07:09:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:29,102 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 07:09:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:29,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-07 07:09:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:29,108 INFO L225 Difference]: With dead ends: 903 [2018-11-07 07:09:29,109 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 07:09:29,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 07:09:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 07:09:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 07:09:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 07:09:29,144 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 127 [2018-11-07 07:09:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:29,145 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 07:09:29,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 07:09:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 07:09:29,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:29,151 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:29,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:29,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1825296655, now seen corresponding path program 1 times [2018-11-07 07:09:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:29,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:29,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:29,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:29,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:29,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:29,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:29,593 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 07:09:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:31,310 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 07:09:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:31,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-07 07:09:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:31,318 INFO L225 Difference]: With dead ends: 901 [2018-11-07 07:09:31,318 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 07:09:31,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 07:09:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 07:09:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 07:09:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 07:09:31,339 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 133 [2018-11-07 07:09:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:31,340 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 07:09:31,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 07:09:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 07:09:31,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:31,343 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:31,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:31,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1056401542, now seen corresponding path program 1 times [2018-11-07 07:09:31,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:31,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:31,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:31,597 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:31,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:31,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:09:31,990 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:31,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:31,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:31,991 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 07:09:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:36,480 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 07:09:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:09:36,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-07 07:09:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:36,486 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 07:09:36,487 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 07:09:36,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 07:09:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 07:09:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 07:09:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 07:09:36,531 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 141 [2018-11-07 07:09:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:36,532 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 07:09:36,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 07:09:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 07:09:36,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:36,536 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:36,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:36,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2142875510, now seen corresponding path program 1 times [2018-11-07 07:09:36,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:36,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:36,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:36,968 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 07:09:37,208 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 07:09:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:37,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:37,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:37,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:37,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:37,289 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 07:09:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:38,548 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 07:09:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:38,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 07:09:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:38,562 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 07:09:38,562 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 07:09:38,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 07:09:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 07:09:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 07:09:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 07:09:38,600 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 143 [2018-11-07 07:09:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:38,601 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 07:09:38,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 07:09:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 07:09:38,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:38,605 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, 1, 1, 1, 1, 1] [2018-11-07 07:09:38,607 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:38,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1822889842, now seen corresponding path program 1 times [2018-11-07 07:09:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:38,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:38,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:38,888 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 07:09:38,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:38,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:38,889 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:38,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:38,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:38,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:38,890 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 07:09:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:40,462 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 07:09:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:40,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-07 07:09:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:40,469 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 07:09:40,469 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 07:09:40,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 07:09:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 07:09:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 07:09:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 07:09:40,506 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 145 [2018-11-07 07:09:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:40,507 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 07:09:40,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 07:09:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 07:09:40,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:40,511 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:40,511 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:40,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2129057642, now seen corresponding path program 1 times [2018-11-07 07:09:40,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:40,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:40,743 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:40,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:09:40,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:40,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:40,944 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 07:09:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:42,366 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 07:09:42,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:09:42,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-07 07:09:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:42,383 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 07:09:42,383 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 07:09:42,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 07:09:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 07:09:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 07:09:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 07:09:42,435 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 149 [2018-11-07 07:09:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:42,435 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 07:09:42,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 07:09:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 07:09:42,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:42,443 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:42,443 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:42,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -702189192, now seen corresponding path program 1 times [2018-11-07 07:09:42,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:42,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:42,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:42,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:42,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:42,642 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 07:09:42,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:42,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:42,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-07 07:09:42,646 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], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:42,697 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:42,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:43,517 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:09:43,519 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 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 07:09:43,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:43,535 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:09:44,018 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 82.55% of their original sizes. [2018-11-07 07:09:44,018 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:09:44,815 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-07 07:09:44,816 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:09:44,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:09:44,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:09:44,817 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:44,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:09:44,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:09:44,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:09:44,819 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-11-07 07:09:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:58,119 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-11-07 07:09:58,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 07:09:58,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-11-07 07:09:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:58,130 INFO L225 Difference]: With dead ends: 3925 [2018-11-07 07:09:58,131 INFO L226 Difference]: Without dead ends: 2373 [2018-11-07 07:09:58,137 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-07 07:09:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-11-07 07:09:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-11-07 07:09:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-11-07 07:09:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-11-07 07:09:58,194 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 184 [2018-11-07 07:09:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:58,194 INFO L480 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-11-07 07:09:58,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:09:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-11-07 07:09:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 07:09:58,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:58,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:58,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:58,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1613721515, now seen corresponding path program 1 times [2018-11-07 07:09:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:58,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:58,447 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:58,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:58,536 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:58,536 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-07 07:09:58,536 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], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:58,542 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:58,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:58,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:09:58,850 INFO L272 AbstractInterpreter]: Visited 124 different actions 368 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:09:58,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:58,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:09:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:58,857 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 07:09:58,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:58,869 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:09:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:58,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:09:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:09:59,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:09:59,706 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 07:10:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:10:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 07:10:00,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:10:00,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 07:10:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 07:10:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 07:10:00,344 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-11-07 07:10:04,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:04,972 INFO L93 Difference]: Finished difference Result 7743 states and 10793 transitions. [2018-11-07 07:10:04,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 07:10:04,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-11-07 07:10:04,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:04,987 INFO L225 Difference]: With dead ends: 7743 [2018-11-07 07:10:04,987 INFO L226 Difference]: Without dead ends: 3066 [2018-11-07 07:10:05,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 07:10:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2018-11-07 07:10:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3043. [2018-11-07 07:10:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-11-07 07:10:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3614 transitions. [2018-11-07 07:10:05,087 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3614 transitions. Word has length 189 [2018-11-07 07:10:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:05,088 INFO L480 AbstractCegarLoop]: Abstraction has 3043 states and 3614 transitions. [2018-11-07 07:10:05,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 07:10:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3614 transitions. [2018-11-07 07:10:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-07 07:10:05,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:05,099 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, 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] [2018-11-07 07:10:05,100 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:05,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:05,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1703504543, now seen corresponding path program 1 times [2018-11-07 07:10:05,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:05,102 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:05,500 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 07:10:06,115 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-07 07:10:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:06,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:06,342 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:06,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-11-07 07:10:06,342 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], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:06,347 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:06,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:06,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:06,833 INFO L272 AbstractInterpreter]: Visited 126 different actions 496 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:10:06,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:06,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:06,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:06,874 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 07:10:06,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:06,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:07,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-07 07:10:07,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-07 07:10:07,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:10:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2018-11-07 07:10:07,666 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:10:07,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 07:10:07,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 07:10:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-11-07 07:10:07,668 INFO L87 Difference]: Start difference. First operand 3043 states and 3614 transitions. Second operand 20 states. [2018-11-07 07:10:07,851 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-11-07 07:10:08,094 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-11-07 07:10:08,736 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-11-07 07:10:10,342 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2018-11-07 07:10:10,537 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 07:10:10,982 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-11-07 07:10:11,440 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-11-07 07:10:12,929 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-07 07:10:13,091 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-07 07:10:15,562 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-11-07 07:10:16,052 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2018-11-07 07:10:16,364 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-11-07 07:10:16,549 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-07 07:10:16,823 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2018-11-07 07:10:17,108 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-11-07 07:10:19,885 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 07:10:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:20,665 INFO L93 Difference]: Finished difference Result 7005 states and 9063 transitions. [2018-11-07 07:10:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 07:10:20,666 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 268 [2018-11-07 07:10:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:20,689 INFO L225 Difference]: With dead ends: 7005 [2018-11-07 07:10:20,689 INFO L226 Difference]: Without dead ends: 3740 [2018-11-07 07:10:20,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 564 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1295, Invalid=5185, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 07:10:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2018-11-07 07:10:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3082. [2018-11-07 07:10:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-11-07 07:10:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3580 transitions. [2018-11-07 07:10:20,836 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3580 transitions. Word has length 268 [2018-11-07 07:10:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:20,836 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 3580 transitions. [2018-11-07 07:10:20,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 07:10:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3580 transitions. [2018-11-07 07:10:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-07 07:10:20,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:20,850 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:20,850 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:20,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash -936896460, now seen corresponding path program 1 times [2018-11-07 07:10:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:20,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:20,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 07:10:21,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:21,275 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:21,275 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-11-07 07:10:21,276 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], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:21,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:21,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:21,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:21,544 INFO L272 AbstractInterpreter]: Visited 124 different actions 366 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:10:21,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:21,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:21,548 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 07:10:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:21,557 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:21,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-07 07:10:21,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 07:10:22,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:10:22,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 07:10:22,309 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:10:22,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:10:22,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:10:22,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:10:22,310 INFO L87 Difference]: Start difference. First operand 3082 states and 3580 transitions. Second operand 9 states. [2018-11-07 07:10:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:25,293 INFO L93 Difference]: Finished difference Result 6217 states and 7251 transitions. [2018-11-07 07:10:25,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 07:10:25,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-11-07 07:10:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:25,305 INFO L225 Difference]: With dead ends: 6217 [2018-11-07 07:10:25,305 INFO L226 Difference]: Without dead ends: 2205 [2018-11-07 07:10:25,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-11-07 07:10:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-11-07 07:10:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2182. [2018-11-07 07:10:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-11-07 07:10:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2474 transitions. [2018-11-07 07:10:25,377 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2474 transitions. Word has length 271 [2018-11-07 07:10:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:25,377 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 2474 transitions. [2018-11-07 07:10:25,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:10:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2474 transitions. [2018-11-07 07:10:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-07 07:10:25,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:25,388 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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] [2018-11-07 07:10:25,388 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:25,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1348455113, now seen corresponding path program 1 times [2018-11-07 07:10:25,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:25,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:25,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:25,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 07:10:25,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:25,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:25,921 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 313 with the following transitions: [2018-11-07 07:10:25,922 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], [159], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:25,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:25,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:26,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:26,255 INFO L272 AbstractInterpreter]: Visited 127 different actions 501 times. Merged at 9 different actions 33 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 07:10:26,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:26,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:26,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:26,261 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 07:10:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:26,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:26,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 07:10:26,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 07:10:26,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:10:26,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-07 07:10:26,848 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:10:26,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:10:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:10:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:10:26,849 INFO L87 Difference]: Start difference. First operand 2182 states and 2474 transitions. Second operand 6 states. [2018-11-07 07:10:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:27,572 INFO L93 Difference]: Finished difference Result 3904 states and 4501 transitions. [2018-11-07 07:10:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:10:27,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 312 [2018-11-07 07:10:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:27,573 INFO L225 Difference]: With dead ends: 3904 [2018-11-07 07:10:27,573 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:10:27,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:10:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:10:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:10:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:10:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:10:27,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 312 [2018-11-07 07:10:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:27,582 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:10:27,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:10:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:10:27,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:10:27,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:10:27,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,945 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 139 [2018-11-07 07:10:27,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,134 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 151 [2018-11-07 07:10:28,616 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2018-11-07 07:10:28,868 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2018-11-07 07:10:30,476 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 199 DAG size of output: 77 [2018-11-07 07:10:31,382 WARN L179 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 57 [2018-11-07 07:10:32,458 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 156 DAG size of output: 57 [2018-11-07 07:10:32,462 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:32,462 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 07:10:32,463 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 07:10:32,464 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,465 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 07:10:32,466 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:32,467 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 07:10:32,468 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 07:10:32,469 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 07:10:32,470 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 07:10:32,471 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 07:10:32,472 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 07:10:32,473 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,474 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 07:10:32,475 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 07:10:32,476 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 07:10:32,477 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,478 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 07:10:32,479 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,480 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,481 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,481 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,481 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= |old(~a11~0)| ~a11~0)) (.cse17 (= ~a19~0 |old(~a19~0)|)) (.cse23 (= 1 |old(~a19~0)|)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse12 (= 1 ~a11~0)) (.cse16 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse19 (= 1 |old(~a25~0)|))) (let ((.cse5 (= 9 |old(~a28~0)|)) (.cse8 (not (= 7 |old(~a28~0)|))) (.cse21 (= 8 ~a17~0)) (.cse13 (= 1 ~a19~0)) (.cse9 (not .cse19)) (.cse20 (not (= 8 |old(~a17~0)|))) (.cse24 (not (= 10 |old(~a28~0)|))) (.cse11 (not .cse1)) (.cse22 (and .cse15 .cse12 .cse16 .cse18)) (.cse2 (= 8 |old(~a28~0)|)) (.cse3 (< 7 |old(~a17~0)|)) (.cse4 (< 10 |old(~a28~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse10 (not .cse23)) (.cse6 (not (= |old(~a17~0)| 8))) (.cse7 (and .cse14 .cse15 .cse17 .cse16 .cse18))) (and (or .cse0 .cse1 .cse2 (not (= ~a11~0 1)) .cse3) (or .cse4 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13) (not (= 7 |old(~a17~0)|))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse4 .cse0 .cse1 .cse5 .cse6 .cse19)) (or .cse0 .cse9 .cse10 .cse20 (and .cse12 (= 1 ~a25~0) (= 9 ~a28~0) .cse21 .cse13) (not .cse5) .cse11) (or .cse4 .cse0 .cse22 .cse2 .cse6 .cse11 .cse19) (or .cse23 .cse0 .cse8 .cse20 (not .cse13) .cse19) (or .cse0 .cse1 .cse9 .cse10 .cse20 (and .cse14 .cse21 .cse17 .cse16 .cse18)) (or .cse13 .cse0 .cse24 .cse9 .cse10 .cse20) (or .cse0 .cse24 .cse6 .cse11 .cse22) (or (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) .cse16) .cse0 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse10 .cse6 .cse7)))) [2018-11-07 07:10:32,481 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,481 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 07:10:32,482 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,483 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 07:10:32,484 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,485 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 07:10:32,486 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 07:10:32,487 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 07:10:32,488 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:32,488 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 07:10:32,488 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:10:32,488 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:32,488 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 07:10:32,488 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 07:10:32,489 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse5 (= 1 ~a11~0)) (.cse0 (not (= ~a28~0 8))) (.cse7 (= 1 ~a19~0)) (.cse6 (= 8 ~a17~0)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse8 (not (= ~a25~0 1))) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a28~0 10)) (.cse4 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse5 (= 9 ~a28~0) .cse6 .cse7) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse2 .cse3 .cse7) (and (and .cse2 (= 10 ~a28~0)) .cse5) (and .cse5 (and .cse8 .cse2 .cse3 .cse0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse1 (= 1 ~a25~0) .cse7 .cse6) (and .cse1 (and .cse8 .cse2 .cse3 .cse4)))) [2018-11-07 07:10:32,489 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:32,489 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:32,489 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (= 1 ~a11~0)) (.cse0 (not (= ~a28~0 8))) (.cse7 (= 1 ~a19~0)) (.cse6 (= 8 ~a17~0)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse8 (not (= ~a25~0 1))) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a28~0 10)) (.cse4 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse5 (= 9 ~a28~0) .cse6 .cse7) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse2 .cse3 .cse7) (and (and .cse2 (= 10 ~a28~0)) .cse5) (and .cse5 (and .cse8 .cse2 .cse3 .cse0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse1 (= 1 ~a25~0) .cse7 .cse6) (and .cse1 (and .cse8 .cse2 .cse3 .cse4)))) [2018-11-07 07:10:32,489 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 07:10:32,489 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 07:10:32,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:10:32 BoogieIcfgContainer [2018-11-07 07:10:32,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:10:32,505 INFO L168 Benchmark]: Toolchain (without parser) took 72156.87 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -823.0 MB). Peak memory consumption was 887.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:32,506 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:10:32,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.71 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 07:10:32,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:32,508 INFO L168 Benchmark]: Boogie Preprocessor took 86.84 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:10:32,508 INFO L168 Benchmark]: RCFGBuilder took 3273.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:32,509 INFO L168 Benchmark]: TraceAbstraction took 67969.70 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 960.0 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -139.3 MB). Peak memory consumption was 820.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:32,514 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 695.71 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 125.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.84 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3273.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67969.70 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 960.0 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -139.3 MB). Peak memory consumption was 820.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || (((1 == a11 && 9 == a28) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && 1 == a19)) || ((\old(a17) == a17 && 10 == a28) && 1 == a11)) || (1 == a11 && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8))) || !(1 == \old(a19))) || !(8 == \old(a17))) || (((a11 == \old(a11) && 1 == a25) && 1 == a19) && 8 == a17)) || (a11 == \old(a11) && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 67.8s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 48.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1312 SDtfs, 12054 SDslu, 2229 SDs, 0 SdLazy, 17663 SolverSat, 3212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2527 GetRequests, 2325 SyntacticMatches, 13 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9974983518377926 AbsIntWeakeningRatio, 0.18032786885245902 AbsIntAvgWeakeningVarsNumRemoved, 26.25136612021858 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 815 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 136 PreInvPairs, 222 NumberOfFragments, 732 HoareAnnotationTreeSize, 136 FomulaSimplifications, 8152 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 7484 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 3220 NumberOfCodeBlocks, 3220 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4240 ConstructedInterpolants, 0 QuantifiedInterpolants, 3351177 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2344 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 3316/3422 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...