java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label01.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:19:13,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:19:13,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:19:13,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:19:13,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:19:13,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:19:13,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:19:13,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:19:13,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:19:13,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:19:13,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:19:13,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:19:13,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:19:13,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:19:13,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:19:13,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:19:13,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:19:13,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:19:13,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:19:13,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:19:13,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:19:13,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:19:13,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:19:13,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:19:13,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:19:13,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:19:13,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:19:13,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:19:13,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:19:13,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:19:13,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:19:13,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:19:13,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:19:13,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:19:13,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:19:13,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:19:13,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:19:13,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:19:13,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:19:13,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:19:13,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:19:13,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 20:19:13,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:19:13,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:19:13,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:19:13,784 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:19:13,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:19:13,785 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:19:13,785 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:19:13,786 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:19:13,786 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:19:13,786 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:19:13,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:19:13,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:19:13,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:19:13,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:19:13,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:19:13,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:19:13,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:19:13,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:19:13,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:19:13,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:19:13,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:19:13,791 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:19:13,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:19:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:19:13,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:19:13,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:19:13,792 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:19:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:19:13,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:19:13,793 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:19:13,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:19:13,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:19:13,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:19:13,840 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:19:13,840 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:19:13,841 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label01.c [2019-10-02 20:19:13,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627eaffbc/7591fe618fc34d27ae3c13646dcea653/FLAG82fe1f911 [2019-10-02 20:19:14,460 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:19:14,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label01.c [2019-10-02 20:19:14,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627eaffbc/7591fe618fc34d27ae3c13646dcea653/FLAG82fe1f911 [2019-10-02 20:19:14,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627eaffbc/7591fe618fc34d27ae3c13646dcea653 [2019-10-02 20:19:14,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:19:14,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:19:14,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:19:14,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:19:14,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:19:14,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:19:14" (1/1) ... [2019-10-02 20:19:14,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62648d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:14, skipping insertion in model container [2019-10-02 20:19:14,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:19:14" (1/1) ... [2019-10-02 20:19:14,713 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:19:14,774 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:19:15,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:19:15,331 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:19:15,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:19:15,639 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:19:15,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15 WrapperNode [2019-10-02 20:19:15,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:19:15,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:19:15,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:19:15,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:19:15,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (1/1) ... [2019-10-02 20:19:15,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:19:15,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:19:15,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:19:15,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:19:15,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (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 [2019-10-02 20:19:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:19:15,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:19:15,930 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:19:15,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:19:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:19:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:19:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:19:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:19:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:19:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:19:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:19:17,393 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:19:17,394 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:19:17,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:19:17 BoogieIcfgContainer [2019-10-02 20:19:17,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:19:17,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:19:17,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:19:17,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:19:17,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:19:14" (1/3) ... [2019-10-02 20:19:17,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbbf734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:19:17, skipping insertion in model container [2019-10-02 20:19:17,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:19:15" (2/3) ... [2019-10-02 20:19:17,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbbf734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:19:17, skipping insertion in model container [2019-10-02 20:19:17,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:19:17" (3/3) ... [2019-10-02 20:19:17,404 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label01.c [2019-10-02 20:19:17,414 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:19:17,427 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:19:17,445 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:19:17,487 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:19:17,488 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:19:17,488 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:19:17,488 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:19:17,488 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:19:17,489 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:19:17,489 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:19:17,489 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:19:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:19:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 20:19:17,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:19:17,550 INFO L411 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] [2019-10-02 20:19:17,553 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:19:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:19:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash -184228989, now seen corresponding path program 1 times [2019-10-02 20:19:17,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:19:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:17,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:19:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:17,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:19:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:19:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:19:18,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:19:18,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:19:18,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:19:18,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:19:18,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:19:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:19:18,040 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 20:19:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:19:19,426 INFO L93 Difference]: Finished difference Result 440 states and 713 transitions. [2019-10-02 20:19:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:19:19,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 20:19:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:19:19,446 INFO L225 Difference]: With dead ends: 440 [2019-10-02 20:19:19,446 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 20:19:19,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:19:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 20:19:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 20:19:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:19:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2019-10-02 20:19:19,530 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 60 [2019-10-02 20:19:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:19:19,531 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2019-10-02 20:19:19,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:19:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2019-10-02 20:19:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 20:19:19,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:19:19,539 INFO L411 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, 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] [2019-10-02 20:19:19,539 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:19:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:19:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash 264991034, now seen corresponding path program 1 times [2019-10-02 20:19:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:19:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:19:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:19,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:19:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:19:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:19:19,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:19:19,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 20:19:19,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:19:19,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 20:19:19,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 20:19:19,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 20:19:19,765 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand 5 states. [2019-10-02 20:19:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:19:21,193 INFO L93 Difference]: Finished difference Result 574 states and 848 transitions. [2019-10-02 20:19:21,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 20:19:21,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-02 20:19:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:19:21,204 INFO L225 Difference]: With dead ends: 574 [2019-10-02 20:19:21,205 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 20:19:21,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 20:19:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 20:19:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 564. [2019-10-02 20:19:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 20:19:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 831 transitions. [2019-10-02 20:19:21,265 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 831 transitions. Word has length 136 [2019-10-02 20:19:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:19:21,266 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 831 transitions. [2019-10-02 20:19:21,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 20:19:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 831 transitions. [2019-10-02 20:19:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 20:19:21,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:19:21,272 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:19:21,272 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:19:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:19:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1698067270, now seen corresponding path program 1 times [2019-10-02 20:19:21,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:19:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:21,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:19:21,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:21,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:19:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:19:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:19:21,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:19:21,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:19:21,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:19:21,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:19:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:19:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:19:21,594 INFO L87 Difference]: Start difference. First operand 564 states and 831 transitions. Second operand 6 states. [2019-10-02 20:19:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:19:25,087 INFO L93 Difference]: Finished difference Result 968 states and 1421 transitions. [2019-10-02 20:19:25,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:19:25,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-10-02 20:19:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:19:25,095 INFO L225 Difference]: With dead ends: 968 [2019-10-02 20:19:25,095 INFO L226 Difference]: Without dead ends: 968 [2019-10-02 20:19:25,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 20:19:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-02 20:19:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 942. [2019-10-02 20:19:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-10-02 20:19:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1352 transitions. [2019-10-02 20:19:25,136 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1352 transitions. Word has length 200 [2019-10-02 20:19:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:19:25,137 INFO L475 AbstractCegarLoop]: Abstraction has 942 states and 1352 transitions. [2019-10-02 20:19:25,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:19:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1352 transitions. [2019-10-02 20:19:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 20:19:25,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:19:25,144 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:19:25,144 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:19:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:19:25,145 INFO L82 PathProgramCache]: Analyzing trace with hash 328652488, now seen corresponding path program 1 times [2019-10-02 20:19:25,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:19:25,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:19:25,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:19:25,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:19:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:19:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:19:25,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:19:25,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:19:25,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2019-10-02 20:19:25,305 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:19:25,349 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:19:25,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:19:29,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:19:29,760 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 13. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 20:19:29,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:19:29,764 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:19:33,962 INFO L227 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 78.37% of their original sizes. [2019-10-02 20:19:33,962 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:19:34,045 INFO L420 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2019-10-02 20:19:34,045 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:19:34,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:19:34,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 20:19:34,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:19:34,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:19:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:19:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:19:34,048 INFO L87 Difference]: Start difference. First operand 942 states and 1352 transitions. Second operand 10 states. [2019-10-02 20:20:57,561 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:22:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:22:49,114 INFO L93 Difference]: Finished difference Result 1128 states and 1547 transitions. [2019-10-02 20:22:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 20:22:49,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2019-10-02 20:22:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:22:49,121 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 20:22:49,121 INFO L226 Difference]: Without dead ends: 1128 [2019-10-02 20:22:49,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-02 20:22:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-10-02 20:22:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1124. [2019-10-02 20:22:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-02 20:22:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1541 transitions. [2019-10-02 20:22:49,154 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1541 transitions. Word has length 219 [2019-10-02 20:22:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:22:49,154 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1541 transitions. [2019-10-02 20:22:49,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:22:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1541 transitions. [2019-10-02 20:22:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 20:22:49,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:22:49,160 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:22:49,161 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:22:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:22:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash -56962879, now seen corresponding path program 1 times [2019-10-02 20:22:49,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:22:49,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:22:49,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:22:49,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:22:49,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:22:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:22:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 244 proven. 146 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:22:49,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:22:49,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:22:49,750 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2019-10-02 20:22:49,750 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:22:49,756 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:22:49,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:22:52,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:22:52,953 INFO L272 AbstractInterpreter]: Visited 93 different actions 181 times. Merged at 4 different actions 5 times. Never widened. Performed 400 root evaluator evaluations with a maximum evaluation depth of 13. Performed 400 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:22:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:22:52,954 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:22:55,341 INFO L227 lantSequenceWeakener]: Weakened 300 states. On average, predicates are now at 77.93% of their original sizes. [2019-10-02 20:22:55,341 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:22:55,414 INFO L420 sIntCurrentIteration]: We unified 302 AI predicates to 302 [2019-10-02 20:22:55,414 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:22:55,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:22:55,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:22:55,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:22:55,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:22:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:22:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:22:55,416 INFO L87 Difference]: Start difference. First operand 1124 states and 1541 transitions. Second operand 11 states. [2019-10-02 20:23:29,081 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:24:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:24:52,766 INFO L93 Difference]: Finished difference Result 1340 states and 1768 transitions. [2019-10-02 20:24:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:24:52,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 303 [2019-10-02 20:24:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:24:52,774 INFO L225 Difference]: With dead ends: 1340 [2019-10-02 20:24:52,774 INFO L226 Difference]: Without dead ends: 1340 [2019-10-02 20:24:52,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:24:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-10-02 20:24:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1124. [2019-10-02 20:24:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-02 20:24:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1541 transitions. [2019-10-02 20:24:52,804 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1541 transitions. Word has length 303 [2019-10-02 20:24:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:24:52,805 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1541 transitions. [2019-10-02 20:24:52,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:24:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1541 transitions. [2019-10-02 20:24:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 20:24:52,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:24:52,811 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 20:24:52,811 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:24:52,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:24:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1304265749, now seen corresponding path program 1 times [2019-10-02 20:24:52,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:24:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:24:52,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:24:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:24:52,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:24:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:24:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 216 proven. 125 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 20:24:53,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:24:53,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:24:53,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2019-10-02 20:24:53,185 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:24:53,190 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:24:53,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:25:07,972 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:25:07,972 INFO L272 AbstractInterpreter]: Visited 119 different actions 233 times. Merged at 4 different actions 5 times. Never widened. Performed 557 root evaluator evaluations with a maximum evaluation depth of 13. Performed 557 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:25:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:25:07,973 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:25:15,422 INFO L227 lantSequenceWeakener]: Weakened 326 states. On average, predicates are now at 77.88% of their original sizes. [2019-10-02 20:25:15,422 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:25:15,506 INFO L420 sIntCurrentIteration]: We unified 328 AI predicates to 328 [2019-10-02 20:25:15,506 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:25:15,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:25:15,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 20:25:15,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:25:15,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:25:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:25:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:25:15,509 INFO L87 Difference]: Start difference. First operand 1124 states and 1541 transitions. Second operand 11 states. [2019-10-02 20:25:57,816 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:27:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:27:11,626 INFO L93 Difference]: Finished difference Result 1492 states and 1931 transitions. [2019-10-02 20:27:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 20:27:11,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 329 [2019-10-02 20:27:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:27:11,634 INFO L225 Difference]: With dead ends: 1492 [2019-10-02 20:27:11,634 INFO L226 Difference]: Without dead ends: 1492 [2019-10-02 20:27:11,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-02 20:27:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-10-02 20:27:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1490. [2019-10-02 20:27:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-10-02 20:27:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1929 transitions. [2019-10-02 20:27:11,667 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1929 transitions. Word has length 329 [2019-10-02 20:27:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:27:11,668 INFO L475 AbstractCegarLoop]: Abstraction has 1490 states and 1929 transitions. [2019-10-02 20:27:11,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:27:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1929 transitions. [2019-10-02 20:27:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-10-02 20:27:11,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:27:11,675 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:27:11,675 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:27:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:27:11,675 INFO L82 PathProgramCache]: Analyzing trace with hash 854689473, now seen corresponding path program 1 times [2019-10-02 20:27:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:27:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:27:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:27:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:27:11,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:27:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:27:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 20:27:11,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:27:11,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:27:11,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 356 with the following transitions: [2019-10-02 20:27:11,937 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:27:11,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:27:11,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:27:25,722 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:27:42,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:27:42,701 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 6 different actions 19 times. Never widened. Performed 866 root evaluator evaluations with a maximum evaluation depth of 22. Performed 866 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:27:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:27:42,701 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:27:50,453 INFO L227 lantSequenceWeakener]: Weakened 352 states. On average, predicates are now at 77.83% of their original sizes. [2019-10-02 20:27:50,453 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:27:50,524 INFO L420 sIntCurrentIteration]: We unified 354 AI predicates to 354 [2019-10-02 20:27:50,524 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:27:50,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:27:50,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-10-02 20:27:50,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:27:50,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:27:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:27:50,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:27:50,526 INFO L87 Difference]: Start difference. First operand 1490 states and 1929 transitions. Second operand 10 states. [2019-10-02 20:29:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:29:23,966 INFO L93 Difference]: Finished difference Result 1683 states and 2160 transitions. [2019-10-02 20:29:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 20:29:23,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 355 [2019-10-02 20:29:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:29:23,976 INFO L225 Difference]: With dead ends: 1683 [2019-10-02 20:29:23,977 INFO L226 Difference]: Without dead ends: 1683 [2019-10-02 20:29:23,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:29:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-10-02 20:29:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1676. [2019-10-02 20:29:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-10-02 20:29:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2153 transitions. [2019-10-02 20:29:24,019 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2153 transitions. Word has length 355 [2019-10-02 20:29:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:29:24,019 INFO L475 AbstractCegarLoop]: Abstraction has 1676 states and 2153 transitions. [2019-10-02 20:29:24,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:29:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2153 transitions. [2019-10-02 20:29:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-10-02 20:29:24,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:29:24,030 INFO L411 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 20:29:24,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:29:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:29:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash -642340274, now seen corresponding path program 1 times [2019-10-02 20:29:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:29:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:29:24,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:29:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:29:24,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:29:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:29:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 302 proven. 157 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-02 20:29:24,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:29:24,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:29:24,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 414 with the following transitions: [2019-10-02 20:29:24,422 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:29:24,427 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:29:24,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:29:39,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:29:39,621 INFO L272 AbstractInterpreter]: Visited 121 different actions 358 times. Merged at 6 different actions 17 times. Never widened. Performed 653 root evaluator evaluations with a maximum evaluation depth of 13. Performed 653 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2019-10-02 20:29:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:29:39,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:29:39,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:29:39,623 INFO L193 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 [2019-10-02 20:29:39,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:29:39,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:29:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:29:39,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:29:39,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:29:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 504 proven. 2 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-10-02 20:29:40,031 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:29:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 302 proven. 157 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-02 20:29:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-02 20:29:40,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2019-10-02 20:29:40,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-02 20:29:40,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 20:29:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 20:29:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:29:40,358 INFO L87 Difference]: Start difference. First operand 1676 states and 2153 transitions. Second operand 9 states. [2019-10-02 20:29:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:29:44,703 INFO L93 Difference]: Finished difference Result 3016 states and 3578 transitions. [2019-10-02 20:29:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 20:29:44,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 413 [2019-10-02 20:29:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:29:44,723 INFO L225 Difference]: With dead ends: 3016 [2019-10-02 20:29:44,723 INFO L226 Difference]: Without dead ends: 2832 [2019-10-02 20:29:44,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 842 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-10-02 20:29:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2019-10-02 20:29:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2640. [2019-10-02 20:29:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-10-02 20:29:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3120 transitions. [2019-10-02 20:29:44,786 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3120 transitions. Word has length 413 [2019-10-02 20:29:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:29:44,786 INFO L475 AbstractCegarLoop]: Abstraction has 2640 states and 3120 transitions. [2019-10-02 20:29:44,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 20:29:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3120 transitions. [2019-10-02 20:29:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-10-02 20:29:44,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:29:44,793 INFO L411 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, 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, 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, 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] [2019-10-02 20:29:44,794 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:29:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:29:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1865192865, now seen corresponding path program 1 times [2019-10-02 20:29:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:29:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:29:44,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:29:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:29:44,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:29:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:29:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 302 proven. 166 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-02 20:29:45,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:29:45,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:29:45,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 461 with the following transitions: [2019-10-02 20:29:45,152 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:29:45,155 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:29:45,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:30:00,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:30:00,587 INFO L272 AbstractInterpreter]: Visited 123 different actions 365 times. Merged at 6 different actions 18 times. Never widened. Performed 665 root evaluator evaluations with a maximum evaluation depth of 13. Performed 665 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:30:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:30:00,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:30:00,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:30:00,587 INFO L193 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 [2019-10-02 20:30:00,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:30:00,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:30:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:30:00,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:30:00,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:30:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-02 20:30:00,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:30:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 302 proven. 166 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-02 20:30:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-02 20:30:01,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2019-10-02 20:30:01,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-02 20:30:01,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 20:30:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 20:30:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:30:01,128 INFO L87 Difference]: Start difference. First operand 2640 states and 3120 transitions. Second operand 9 states. [2019-10-02 20:30:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:30:03,767 INFO L93 Difference]: Finished difference Result 3956 states and 4650 transitions. [2019-10-02 20:30:03,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 20:30:03,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 460 [2019-10-02 20:30:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:30:03,785 INFO L225 Difference]: With dead ends: 3956 [2019-10-02 20:30:03,785 INFO L226 Difference]: Without dead ends: 3956 [2019-10-02 20:30:03,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 921 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-10-02 20:30:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2019-10-02 20:30:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3580. [2019-10-02 20:30:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-10-02 20:30:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4155 transitions. [2019-10-02 20:30:03,865 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4155 transitions. Word has length 460 [2019-10-02 20:30:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:30:03,866 INFO L475 AbstractCegarLoop]: Abstraction has 3580 states and 4155 transitions. [2019-10-02 20:30:03,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 20:30:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4155 transitions. [2019-10-02 20:30:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-10-02 20:30:03,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:30:03,875 INFO L411 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, 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, 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, 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] [2019-10-02 20:30:03,875 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:30:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:30:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash 714742968, now seen corresponding path program 1 times [2019-10-02 20:30:03,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:30:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:30:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:30:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:30:03,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:30:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:30:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 318 proven. 449 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:30:04,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:30:04,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:30:04,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 464 with the following transitions: [2019-10-02 20:30:04,955 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:30:04,958 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:30:04,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:30:23,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:30:23,810 INFO L272 AbstractInterpreter]: Visited 123 different actions 359 times. Merged at 6 different actions 12 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 13. Performed 724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:30:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:30:23,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:30:23,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:30:23,810 INFO L193 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 [2019-10-02 20:30:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:30:23,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:30:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:30:23,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:30:23,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:30:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-10-02 20:30:24,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:30:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-10-02 20:30:24,231 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:30:24,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [16] total 18 [2019-10-02 20:30:24,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:30:24,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:30:24,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:30:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:30:24,233 INFO L87 Difference]: Start difference. First operand 3580 states and 4155 transitions. Second operand 3 states. [2019-10-02 20:30:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:30:25,077 INFO L93 Difference]: Finished difference Result 4680 states and 5355 transitions. [2019-10-02 20:30:25,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:30:25,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 463 [2019-10-02 20:30:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:30:25,100 INFO L225 Difference]: With dead ends: 4680 [2019-10-02 20:30:25,100 INFO L226 Difference]: Without dead ends: 4680 [2019-10-02 20:30:25,101 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 925 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:30:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-10-02 20:30:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 3758. [2019-10-02 20:30:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3758 states. [2019-10-02 20:30:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 4287 transitions. [2019-10-02 20:30:25,180 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 4287 transitions. Word has length 463 [2019-10-02 20:30:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:30:25,181 INFO L475 AbstractCegarLoop]: Abstraction has 3758 states and 4287 transitions. [2019-10-02 20:30:25,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:30:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 4287 transitions. [2019-10-02 20:30:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-10-02 20:30:25,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:30:25,190 INFO L411 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, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:30:25,190 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:30:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:30:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1998918461, now seen corresponding path program 1 times [2019-10-02 20:30:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:30:25,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:30:25,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:30:25,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:30:25,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:30:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:30:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 318 proven. 471 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:30:26,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:30:26,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:30:26,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 475 with the following transitions: [2019-10-02 20:30:26,010 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [638], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:30:26,013 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:30:26,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:30:53,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:30:53,277 INFO L272 AbstractInterpreter]: Visited 123 different actions 476 times. Merged at 6 different actions 17 times. Never widened. Performed 1007 root evaluator evaluations with a maximum evaluation depth of 13. Performed 1007 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:30:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:30:53,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:30:53,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:30:53,278 INFO L193 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 [2019-10-02 20:30:53,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:30:53,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:30:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:30:53,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:30:53,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:30:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-10-02 20:30:53,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:30:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-10-02 20:30:53,763 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:30:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [16] total 18 [2019-10-02 20:30:53,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:30:53,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:30:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:30:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:30:53,765 INFO L87 Difference]: Start difference. First operand 3758 states and 4287 transitions. Second operand 3 states. [2019-10-02 20:30:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:30:54,596 INFO L93 Difference]: Finished difference Result 4498 states and 5119 transitions. [2019-10-02 20:30:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:30:54,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 474 [2019-10-02 20:30:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:30:54,600 INFO L225 Difference]: With dead ends: 4498 [2019-10-02 20:30:54,600 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 20:30:54,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:30:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 20:30:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 20:30:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 20:30:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 20:30:54,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 474 [2019-10-02 20:30:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:30:54,603 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 20:30:54,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:30:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 20:30:54,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 20:30:54,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 08:30:54 BoogieIcfgContainer [2019-10-02 20:30:54,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 20:30:54,617 INFO L168 Benchmark]: Toolchain (without parser) took 699917.86 ms. Allocated memory was 132.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 85.3 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 241.1 MB. Max. memory is 7.1 GB. [2019-10-02 20:30:54,617 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 20:30:54,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 944.58 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 85.3 MB in the beginning and 154.2 MB in the end (delta: -68.9 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2019-10-02 20:30:54,629 INFO L168 Benchmark]: Boogie Preprocessor took 194.44 ms. Allocated memory is still 201.3 MB. Free memory was 154.2 MB in the beginning and 148.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-10-02 20:30:54,630 INFO L168 Benchmark]: RCFGBuilder took 1558.74 ms. Allocated memory was 201.3 MB in the beginning and 224.9 MB in the end (delta: 23.6 MB). Free memory was 148.5 MB in the beginning and 142.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. [2019-10-02 20:30:54,637 INFO L168 Benchmark]: TraceAbstraction took 697214.80 ms. Allocated memory was 224.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 141.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 204.6 MB. Max. memory is 7.1 GB. [2019-10-02 20:30:54,644 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 944.58 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 85.3 MB in the beginning and 154.2 MB in the end (delta: -68.9 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.44 ms. Allocated memory is still 201.3 MB. Free memory was 154.2 MB in the beginning and 148.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1558.74 ms. Allocated memory was 201.3 MB in the beginning and 224.9 MB in the end (delta: 23.6 MB). Free memory was 148.5 MB in the beginning and 142.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 697214.80 ms. Allocated memory was 224.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 141.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 204.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 697.1s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 537.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 913 SDtfs, 6531 SDslu, 453 SDs, 0 SdLazy, 11916 SolverSat, 2304 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 523.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4971 GetRequests, 4811 SyntacticMatches, 9 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3758occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 129.9s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.997032425723738 AbsIntWeakeningRatio, 0.10149750415973377 AbsIntAvgWeakeningVarsNumRemoved, 8.407653910149751 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1755 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 5222 NumberOfCodeBlocks, 5222 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 7013 ConstructedInterpolants, 0 QuantifiedInterpolants, 9752212 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2839 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 8699/10544 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...