/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:39:21,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:39:21,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:39:21,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:39:21,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:39:21,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:39:21,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:39:21,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:39:21,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:39:21,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:39:21,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:39:21,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:39:21,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:39:21,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:39:21,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:39:21,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:39:21,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:39:21,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:39:21,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:39:21,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:39:21,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:39:21,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:39:21,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:39:21,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:39:21,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:39:21,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:39:21,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:39:21,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:39:21,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:39:21,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:39:21,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:39:21,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:39:21,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:39:21,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:39:21,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:39:21,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:39:21,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:39:21,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:39:21,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:39:21,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:39:21,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:39:21,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 05:39:21,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:39:21,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:39:21,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:39:21,824 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:39:21,825 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:39:21,825 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:39:21,825 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:39:21,825 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:39:21,825 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:39:21,826 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:39:21,827 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:39:21,827 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:39:21,827 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:39:21,828 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:39:21,828 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:39:21,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:39:21,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:39:21,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:39:21,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:39:21,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:39:21,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:39:21,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:39:21,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:39:21,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:39:21,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:39:21,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:39:21,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:39:21,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:39:21,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:39:21,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:39:21,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:39:21,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:39:21,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:39:21,834 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:39:21,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:39:21,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:39:21,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:39:21,835 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:39:22,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:39:22,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:39:22,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:39:22,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:39:22,164 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:39:22,164 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-11-24 05:39:22,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac2c6fdd/b4e4dc3919c24b489046ad1feee1371b/FLAG4620821ec [2019-11-24 05:39:22,716 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:39:22,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-11-24 05:39:22,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac2c6fdd/b4e4dc3919c24b489046ad1feee1371b/FLAG4620821ec [2019-11-24 05:39:23,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac2c6fdd/b4e4dc3919c24b489046ad1feee1371b [2019-11-24 05:39:23,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:39:23,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:39:23,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:39:23,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:39:23,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:39:23,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bed0f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23, skipping insertion in model container [2019-11-24 05:39:23,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:39:23,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:39:23,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:39:23,517 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:39:23,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:39:23,622 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:39:23,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23 WrapperNode [2019-11-24 05:39:23,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:39:23,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:39:23,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:39:23,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:39:23,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:39:23,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:39:23,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:39:23,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:39:23,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (1/1) ... [2019-11-24 05:39:23,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:39:23,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:39:23,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:39:23,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:39:23,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (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-11-24 05:39:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:39:23,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:39:24,871 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:39:24,871 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-24 05:39:24,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:39:24 BoogieIcfgContainer [2019-11-24 05:39:24,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:39:24,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:39:24,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:39:24,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:39:24,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:39:23" (1/3) ... [2019-11-24 05:39:24,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f098ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:39:24, skipping insertion in model container [2019-11-24 05:39:24,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:39:23" (2/3) ... [2019-11-24 05:39:24,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f098ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:39:24, skipping insertion in model container [2019-11-24 05:39:24,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:39:24" (3/3) ... [2019-11-24 05:39:24,882 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-11-24 05:39:24,891 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:39:24,899 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 05:39:24,911 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 05:39:24,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:39:24,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:39:24,951 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:39:24,951 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:39:24,951 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:39:24,952 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:39:24,952 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:39:24,952 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:39:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-24 05:39:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:39:24,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:24,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:24,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1235094703, now seen corresponding path program 1 times [2019-11-24 05:39:24,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:24,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950483773] [2019-11-24 05:39:24,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:25,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950483773] [2019-11-24 05:39:25,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:25,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:39:25,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266917548] [2019-11-24 05:39:25,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:39:25,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:39:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:39:25,159 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-24 05:39:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:25,192 INFO L93 Difference]: Finished difference Result 213 states and 413 transitions. [2019-11-24 05:39:25,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:39:25,194 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:39:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:25,206 INFO L225 Difference]: With dead ends: 213 [2019-11-24 05:39:25,206 INFO L226 Difference]: Without dead ends: 99 [2019-11-24 05:39:25,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:39:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-24 05:39:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-24 05:39:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-24 05:39:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 164 transitions. [2019-11-24 05:39:25,270 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 164 transitions. Word has length 8 [2019-11-24 05:39:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:25,270 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 164 transitions. [2019-11-24 05:39:25,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:39:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 164 transitions. [2019-11-24 05:39:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:39:25,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:25,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:25,273 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash 899257357, now seen corresponding path program 1 times [2019-11-24 05:39:25,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:25,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98142483] [2019-11-24 05:39:25,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:25,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98142483] [2019-11-24 05:39:25,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:25,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:39:25,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142498732] [2019-11-24 05:39:25,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:25,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:25,365 INFO L87 Difference]: Start difference. First operand 99 states and 164 transitions. Second operand 3 states. [2019-11-24 05:39:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:25,462 INFO L93 Difference]: Finished difference Result 200 states and 331 transitions. [2019-11-24 05:39:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:25,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:39:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:25,464 INFO L225 Difference]: With dead ends: 200 [2019-11-24 05:39:25,464 INFO L226 Difference]: Without dead ends: 102 [2019-11-24 05:39:25,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-24 05:39:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-24 05:39:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-24 05:39:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 167 transitions. [2019-11-24 05:39:25,483 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 167 transitions. Word has length 9 [2019-11-24 05:39:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:25,484 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 167 transitions. [2019-11-24 05:39:25,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 167 transitions. [2019-11-24 05:39:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 05:39:25,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:25,485 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:25,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1778638772, now seen corresponding path program 1 times [2019-11-24 05:39:25,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:25,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547422222] [2019-11-24 05:39:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:26,013 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-24 05:39:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:26,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547422222] [2019-11-24 05:39:26,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:26,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:39:26,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874159646] [2019-11-24 05:39:26,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:39:26,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:39:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:39:26,021 INFO L87 Difference]: Start difference. First operand 102 states and 167 transitions. Second operand 4 states. [2019-11-24 05:39:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:26,397 INFO L93 Difference]: Finished difference Result 204 states and 333 transitions. [2019-11-24 05:39:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:26,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 05:39:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:26,400 INFO L225 Difference]: With dead ends: 204 [2019-11-24 05:39:26,400 INFO L226 Difference]: Without dead ends: 185 [2019-11-24 05:39:26,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:39:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-24 05:39:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2019-11-24 05:39:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-24 05:39:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 280 transitions. [2019-11-24 05:39:26,416 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 280 transitions. Word has length 14 [2019-11-24 05:39:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:26,416 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 280 transitions. [2019-11-24 05:39:26,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:39:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 280 transitions. [2019-11-24 05:39:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:39:26,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:26,418 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:26,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2054474346, now seen corresponding path program 1 times [2019-11-24 05:39:26,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:26,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662603816] [2019-11-24 05:39:26,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:26,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662603816] [2019-11-24 05:39:26,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:26,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:39:26,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676081842] [2019-11-24 05:39:26,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:26,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:26,463 INFO L87 Difference]: Start difference. First operand 171 states and 280 transitions. Second operand 3 states. [2019-11-24 05:39:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:26,502 INFO L93 Difference]: Finished difference Result 292 states and 476 transitions. [2019-11-24 05:39:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:26,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 05:39:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:26,505 INFO L225 Difference]: With dead ends: 292 [2019-11-24 05:39:26,505 INFO L226 Difference]: Without dead ends: 123 [2019-11-24 05:39:26,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-24 05:39:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-24 05:39:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-24 05:39:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2019-11-24 05:39:26,529 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 15 [2019-11-24 05:39:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:26,530 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2019-11-24 05:39:26,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2019-11-24 05:39:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 05:39:26,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:26,532 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:26,532 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -728910377, now seen corresponding path program 1 times [2019-11-24 05:39:26,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:26,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742416632] [2019-11-24 05:39:26,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:39:26,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742416632] [2019-11-24 05:39:26,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:26,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:39:26,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383157261] [2019-11-24 05:39:26,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:26,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:26,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:26,600 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 3 states. [2019-11-24 05:39:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:26,638 INFO L93 Difference]: Finished difference Result 225 states and 357 transitions. [2019-11-24 05:39:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:26,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 05:39:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:26,640 INFO L225 Difference]: With dead ends: 225 [2019-11-24 05:39:26,640 INFO L226 Difference]: Without dead ends: 106 [2019-11-24 05:39:26,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-24 05:39:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-24 05:39:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-24 05:39:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 162 transitions. [2019-11-24 05:39:26,660 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 162 transitions. Word has length 20 [2019-11-24 05:39:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:26,661 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 162 transitions. [2019-11-24 05:39:26,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 162 transitions. [2019-11-24 05:39:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:39:26,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:26,662 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:26,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1707782936, now seen corresponding path program 1 times [2019-11-24 05:39:26,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:26,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112849944] [2019-11-24 05:39:26,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:31,060 WARN L192 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-11-24 05:39:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:31,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112849944] [2019-11-24 05:39:31,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756977998] [2019-11-24 05:39:31,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:39:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:31,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-24 05:39:31,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:39:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:31,223 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:39:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:31,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053407368] [2019-11-24 05:39:31,320 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-11-24 05:39:31,320 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:39:31,329 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:39:31,341 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:39:31,342 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:39:32,589 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 05:39:32,824 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-11-24 05:39:33,426 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 149 [2019-11-24 05:39:34,230 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2019-11-24 05:39:34,562 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 55 [2019-11-24 05:39:35,145 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 50 [2019-11-24 05:39:35,896 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-11-24 05:39:35,956 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 05:39:35,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 05:39:35,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-11-24 05:39:35,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944432797] [2019-11-24 05:39:35,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:39:35,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:39:35,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:39:35,959 INFO L87 Difference]: Start difference. First operand 104 states and 162 transitions. Second operand 9 states. [2019-11-24 05:39:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:36,845 INFO L93 Difference]: Finished difference Result 358 states and 563 transitions. [2019-11-24 05:39:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:39:36,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-24 05:39:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:36,852 INFO L225 Difference]: With dead ends: 358 [2019-11-24 05:39:36,853 INFO L226 Difference]: Without dead ends: 318 [2019-11-24 05:39:36,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2019-11-24 05:39:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-24 05:39:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 274. [2019-11-24 05:39:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-24 05:39:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 433 transitions. [2019-11-24 05:39:36,868 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 433 transitions. Word has length 22 [2019-11-24 05:39:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:36,868 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 433 transitions. [2019-11-24 05:39:36,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:39:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 433 transitions. [2019-11-24 05:39:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:39:36,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:36,870 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:37,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:39:37,083 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash -97156331, now seen corresponding path program 1 times [2019-11-24 05:39:37,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:37,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367468155] [2019-11-24 05:39:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:39:37,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367468155] [2019-11-24 05:39:37,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:37,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:39:37,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716720689] [2019-11-24 05:39:37,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:37,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:37,135 INFO L87 Difference]: Start difference. First operand 274 states and 433 transitions. Second operand 3 states. [2019-11-24 05:39:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:37,176 INFO L93 Difference]: Finished difference Result 547 states and 860 transitions. [2019-11-24 05:39:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:37,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:39:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:37,179 INFO L225 Difference]: With dead ends: 547 [2019-11-24 05:39:37,179 INFO L226 Difference]: Without dead ends: 296 [2019-11-24 05:39:37,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-24 05:39:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-24 05:39:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-24 05:39:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 453 transitions. [2019-11-24 05:39:37,199 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 453 transitions. Word has length 24 [2019-11-24 05:39:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:37,200 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 453 transitions. [2019-11-24 05:39:37,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 453 transitions. [2019-11-24 05:39:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:39:37,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:37,205 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:37,205 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2003320486, now seen corresponding path program 1 times [2019-11-24 05:39:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:37,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011237645] [2019-11-24 05:39:37,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:37,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011237645] [2019-11-24 05:39:37,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117446176] [2019-11-24 05:39:37,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:39:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:37,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-24 05:39:37,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:39:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 05:39:37,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:39:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 05:39:37,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:39:37,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-24 05:39:37,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145520248] [2019-11-24 05:39:37,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:39:37,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:39:37,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:39:37,642 INFO L87 Difference]: Start difference. First operand 294 states and 453 transitions. Second operand 4 states. [2019-11-24 05:39:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:37,666 INFO L93 Difference]: Finished difference Result 297 states and 455 transitions. [2019-11-24 05:39:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:37,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 05:39:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:37,669 INFO L225 Difference]: With dead ends: 297 [2019-11-24 05:39:37,669 INFO L226 Difference]: Without dead ends: 291 [2019-11-24 05:39:37,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:39:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-24 05:39:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-11-24 05:39:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-24 05:39:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 441 transitions. [2019-11-24 05:39:37,680 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 441 transitions. Word has length 26 [2019-11-24 05:39:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:37,681 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 441 transitions. [2019-11-24 05:39:37,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:39:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 441 transitions. [2019-11-24 05:39:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 05:39:37,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:37,684 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:37,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:39:37,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:37,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1408238156, now seen corresponding path program 1 times [2019-11-24 05:39:37,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:37,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249334140] [2019-11-24 05:39:37,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:39:37,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249334140] [2019-11-24 05:39:37,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:37,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:39:37,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598740012] [2019-11-24 05:39:37,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:37,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:37,944 INFO L87 Difference]: Start difference. First operand 290 states and 441 transitions. Second operand 3 states. [2019-11-24 05:39:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:37,975 INFO L93 Difference]: Finished difference Result 509 states and 774 transitions. [2019-11-24 05:39:37,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:37,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 05:39:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:37,979 INFO L225 Difference]: With dead ends: 509 [2019-11-24 05:39:37,979 INFO L226 Difference]: Without dead ends: 242 [2019-11-24 05:39:37,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-24 05:39:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-11-24 05:39:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-24 05:39:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2019-11-24 05:39:37,992 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 32 [2019-11-24 05:39:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:37,993 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2019-11-24 05:39:37,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2019-11-24 05:39:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 05:39:37,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:37,997 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-24 05:39:37,997 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:37,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash -487022107, now seen corresponding path program 1 times [2019-11-24 05:39:37,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:37,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989144686] [2019-11-24 05:39:37,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:39:38,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989144686] [2019-11-24 05:39:38,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:38,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:39:38,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493251001] [2019-11-24 05:39:38,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:38,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:38,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:38,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:38,050 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand 3 states. [2019-11-24 05:39:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:38,084 INFO L93 Difference]: Finished difference Result 423 states and 631 transitions. [2019-11-24 05:39:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:38,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 05:39:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:38,086 INFO L225 Difference]: With dead ends: 423 [2019-11-24 05:39:38,086 INFO L226 Difference]: Without dead ends: 224 [2019-11-24 05:39:38,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-24 05:39:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-11-24 05:39:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-24 05:39:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2019-11-24 05:39:38,095 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 36 [2019-11-24 05:39:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:38,095 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2019-11-24 05:39:38,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2019-11-24 05:39:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 05:39:38,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:38,096 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:39:38,096 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1378383767, now seen corresponding path program 1 times [2019-11-24 05:39:38,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:38,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177519007] [2019-11-24 05:39:38,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-24 05:39:38,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177519007] [2019-11-24 05:39:38,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:39:38,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:39:38,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423421569] [2019-11-24 05:39:38,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:39:38,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:39:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:38,154 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand 3 states. [2019-11-24 05:39:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:38,191 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-24 05:39:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:39:38,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-24 05:39:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:38,193 INFO L225 Difference]: With dead ends: 304 [2019-11-24 05:39:38,193 INFO L226 Difference]: Without dead ends: 142 [2019-11-24 05:39:38,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:39:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-24 05:39:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-11-24 05:39:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-24 05:39:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2019-11-24 05:39:38,200 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 45 [2019-11-24 05:39:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:38,200 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2019-11-24 05:39:38,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:39:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2019-11-24 05:39:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 05:39:38,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:39:38,201 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 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] [2019-11-24 05:39:38,202 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:39:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:39:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1173572958, now seen corresponding path program 1 times [2019-11-24 05:39:38,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:39:38,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715936987] [2019-11-24 05:39:38,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:39:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:39:38,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715936987] [2019-11-24 05:39:38,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954923643] [2019-11-24 05:39:38,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:39:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:39:38,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-24 05:39:38,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:39:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:38,539 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:39:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:39:38,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [134443887] [2019-11-24 05:39:38,656 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-11-24 05:39:38,656 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:39:38,657 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:39:38,657 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:39:38,657 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:39:42,097 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 05:39:42,706 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 112 [2019-11-24 05:39:43,459 WARN L192 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-11-24 05:39:43,716 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-11-24 05:39:43,956 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-11-24 05:39:44,856 WARN L192 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-24 05:39:45,099 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-11-24 05:39:45,329 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-11-24 05:39:45,508 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-11-24 05:39:46,305 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 05:39:46,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 05:39:46,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-11-24 05:39:46,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303861888] [2019-11-24 05:39:46,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 05:39:46,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:39:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 05:39:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2019-11-24 05:39:46,308 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand 14 states. [2019-11-24 05:39:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:39:46,620 INFO L93 Difference]: Finished difference Result 162 states and 230 transitions. [2019-11-24 05:39:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:39:46,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-11-24 05:39:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:39:46,621 INFO L225 Difference]: With dead ends: 162 [2019-11-24 05:39:46,621 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 05:39:46,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2019-11-24 05:39:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 05:39:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 05:39:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 05:39:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 05:39:46,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-11-24 05:39:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:39:46,624 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 05:39:46,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 05:39:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 05:39:46,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 05:39:46,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:39:46,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 05:39:47,062 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-11-24 05:39:47,126 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-11-24 05:39:47,127 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-11-24 05:39:47,128 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-11-24 05:39:47,128 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-11-24 05:39:47,128 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-11-24 05:39:47,128 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-11-24 05:39:47,129 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-11-24 05:39:47,129 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-11-24 05:39:47,129 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-11-24 05:39:47,129 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-11-24 05:39:47,129 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-11-24 05:39:47,130 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-11-24 05:39:47,130 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-11-24 05:39:47,130 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-24 05:39:47,130 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-24 05:39:47,130 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-24 05:39:47,130 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-11-24 05:39:47,131 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-11-24 05:39:47,131 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-11-24 05:39:47,131 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-11-24 05:39:47,131 INFO L447 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-11-24 05:39:47,131 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-11-24 05:39:47,131 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-11-24 05:39:47,131 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-24 05:39:47,132 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L440 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-11-24 05:39:47,133 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L440 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)))) [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-11-24 05:39:47,134 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-11-24 05:39:47,135 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L440 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse5 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse4 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 1) .cse1 .cse4 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 3) .cse5 .cse0 .cse2 .cse3) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse4 .cse2 .cse3))) [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-11-24 05:39:47,136 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-11-24 05:39:47,137 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-11-24 05:39:47,138 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-11-24 05:39:47,139 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-24 05:39:47,140 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-11-24 05:39:47,140 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-11-24 05:39:47,140 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-11-24 05:39:47,140 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-11-24 05:39:47,140 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-24 05:39:47,140 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-24 05:39:47,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 05:39:47 BoogieIcfgContainer [2019-11-24 05:39:47,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 05:39:47,161 INFO L168 Benchmark]: Toolchain (without parser) took 24105.72 ms. Allocated memory was 147.8 MB in the beginning and 531.6 MB in the end (delta: 383.8 MB). Free memory was 103.4 MB in the beginning and 114.1 MB in the end (delta: -10.7 MB). Peak memory consumption was 373.1 MB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,161 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.22 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.2 MB in the beginning and 176.3 MB in the end (delta: -73.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 204.5 MB. Free memory was 176.3 MB in the beginning and 171.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,163 INFO L168 Benchmark]: Boogie Preprocessor took 78.11 ms. Allocated memory is still 204.5 MB. Free memory was 171.6 MB in the beginning and 167.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,164 INFO L168 Benchmark]: RCFGBuilder took 1096.65 ms. Allocated memory is still 204.5 MB. Free memory was 167.8 MB in the beginning and 113.1 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,165 INFO L168 Benchmark]: TraceAbstraction took 22284.08 ms. Allocated memory was 204.5 MB in the beginning and 531.6 MB in the end (delta: 327.2 MB). Free memory was 113.1 MB in the beginning and 114.1 MB in the end (delta: -959.7 kB). Peak memory consumption was 326.2 MB. Max. memory is 7.1 GB. [2019-11-24 05:39:47,169 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.22 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 566.22 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.2 MB in the beginning and 176.3 MB in the end (delta: -73.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.22 ms. Allocated memory is still 204.5 MB. Free memory was 176.3 MB in the beginning and 171.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.11 ms. Allocated memory is still 204.5 MB. Free memory was 171.6 MB in the beginning and 167.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1096.65 ms. Allocated memory is still 204.5 MB. Free memory was 167.8 MB in the beginning and 113.1 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22284.08 ms. Allocated memory was 204.5 MB in the beginning and 531.6 MB in the end (delta: 327.2 MB). Free memory was 113.1 MB in the beginning and 114.1 MB in the end (delta: -959.7 kB). Peak memory consumption was 326.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((q == 1 && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((q == 3 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && this_buffer_empty == 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((0 <= this_expect && this_buffer_empty == 0) && this_expect <= 0) && q == 0)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((0 <= this_expect && this_buffer_empty == 0) && this_expect <= 0) && q == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Result: SAFE, OverallTime: 22.1s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 1790 SDtfs, 2028 SDslu, 2271 SDs, 0 SdLazy, 513 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 71 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 484 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 250 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 467 ConstructedInterpolants, 11 QuantifiedInterpolants, 127966 SizeOfPredicates, 11 NumberOfNonLiveVariables, 692 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 153/235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...