/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/ssh-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:03:12,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:03:12,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:03:12,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:03:12,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:03:12,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:03:12,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:03:12,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:03:12,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:03:12,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:03:12,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:03:12,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:03:12,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:03:12,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:03:12,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:03:12,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:03:12,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:03:12,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:03:12,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:03:12,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:03:12,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:03:12,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:03:12,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:03:12,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:03:12,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:03:12,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:03:12,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:03:12,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:03:12,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:03:12,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:03:12,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:03:12,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:03:12,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:03:12,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:03:12,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:03:12,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:03:12,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:03:12,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:03:12,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:03:12,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:03:12,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:03:12,764 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 06:03:12,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:03:12,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:03:12,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:03:12,787 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:03:12,788 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:03:12,788 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:03:12,788 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:03:12,789 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:03:12,789 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:03:12,789 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:03:12,790 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:03:12,790 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:03:12,790 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:03:12,791 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:03:12,791 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:03:12,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:03:12,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:03:12,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:03:12,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:03:12,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:03:12,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:03:12,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:03:12,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:03:12,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:03:12,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:03:12,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:03:12,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:03:12,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:03:12,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:03:12,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:03:12,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:03:12,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:03:12,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:03:12,797 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:03:12,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:03:12,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:03:12,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:03:12,798 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:03:13,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:03:13,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:03:13,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:03:13,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:03:13,126 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:03:13,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-11-24 06:03:13,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbd30a31/fa507c8c329f46c8893444ae80cab723/FLAGcf6599c0e [2019-11-24 06:03:13,646 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:03:13,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-11-24 06:03:13,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbd30a31/fa507c8c329f46c8893444ae80cab723/FLAGcf6599c0e [2019-11-24 06:03:14,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbd30a31/fa507c8c329f46c8893444ae80cab723 [2019-11-24 06:03:14,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:03:14,025 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:03:14,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:03:14,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:03:14,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:03:14,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5766bd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14, skipping insertion in model container [2019-11-24 06:03:14,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:03:14,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:03:14,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:03:14,311 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:03:14,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:03:14,350 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:03:14,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14 WrapperNode [2019-11-24 06:03:14,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:03:14,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:03:14,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:03:14,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:03:14,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:03:14,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:03:14,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:03:14,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:03:14,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (1/1) ... [2019-11-24 06:03:14,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:03:14,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:03:14,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:03:14,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:03:14,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (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 06:03:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:03:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:03:14,951 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:03:14,952 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-24 06:03:14,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:03:14 BoogieIcfgContainer [2019-11-24 06:03:14,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:03:14,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:03:14,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:03:14,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:03:14,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:03:14" (1/3) ... [2019-11-24 06:03:14,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2626918d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:03:14, skipping insertion in model container [2019-11-24 06:03:14,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:14" (2/3) ... [2019-11-24 06:03:14,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2626918d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:03:14, skipping insertion in model container [2019-11-24 06:03:14,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:03:14" (3/3) ... [2019-11-24 06:03:14,965 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-11-24 06:03:14,975 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:03:14,982 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:03:14,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:03:15,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:03:15,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:03:15,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:03:15,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:03:15,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:03:15,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:03:15,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:03:15,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:03:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-24 06:03:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 06:03:15,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:15,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 06:03:15,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash 963516, now seen corresponding path program 1 times [2019-11-24 06:03:15,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:15,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336253381] [2019-11-24 06:03:15,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:15,204 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 06:03:15,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336253381] [2019-11-24 06:03:15,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:15,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:15,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535089315] [2019-11-24 06:03:15,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:15,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:15,225 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-11-24 06:03:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:15,326 INFO L93 Difference]: Finished difference Result 86 states and 152 transitions. [2019-11-24 06:03:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:15,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-24 06:03:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:15,340 INFO L225 Difference]: With dead ends: 86 [2019-11-24 06:03:15,341 INFO L226 Difference]: Without dead ends: 51 [2019-11-24 06:03:15,344 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 06:03:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-24 06:03:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-24 06:03:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-24 06:03:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2019-11-24 06:03:15,390 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 4 [2019-11-24 06:03:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:15,390 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2019-11-24 06:03:15,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2019-11-24 06:03:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 06:03:15,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:15,391 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-24 06:03:15,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1358093686, now seen corresponding path program 1 times [2019-11-24 06:03:15,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:15,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016115438] [2019-11-24 06:03:15,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:15,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016115438] [2019-11-24 06:03:15,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767791966] [2019-11-24 06:03:15,433 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 06:03:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:15,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 06:03:15,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:15,499 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:03:15,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:03:15,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 5 [2019-11-24 06:03:15,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335197345] [2019-11-24 06:03:15,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:15,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:03:15,544 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand 3 states. [2019-11-24 06:03:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:15,611 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2019-11-24 06:03:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:15,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 06:03:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:15,614 INFO L225 Difference]: With dead ends: 125 [2019-11-24 06:03:15,614 INFO L226 Difference]: Without dead ends: 99 [2019-11-24 06:03:15,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 06:03:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-24 06:03:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-24 06:03:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-24 06:03:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2019-11-24 06:03:15,634 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 7 [2019-11-24 06:03:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:15,634 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2019-11-24 06:03:15,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2019-11-24 06:03:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:03:15,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:15,636 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:15,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:15,839 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash -50673671, now seen corresponding path program 1 times [2019-11-24 06:03:15,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:15,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156544835] [2019-11-24 06:03:15,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:15,882 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 06:03:15,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156544835] [2019-11-24 06:03:15,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:15,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:15,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162404110] [2019-11-24 06:03:15,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:15,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:15,885 INFO L87 Difference]: Start difference. First operand 99 states and 165 transitions. Second operand 3 states. [2019-11-24 06:03:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:15,987 INFO L93 Difference]: Finished difference Result 152 states and 253 transitions. [2019-11-24 06:03:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:15,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 06:03:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:15,989 INFO L225 Difference]: With dead ends: 152 [2019-11-24 06:03:15,989 INFO L226 Difference]: Without dead ends: 54 [2019-11-24 06:03:15,992 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 06:03:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-24 06:03:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-24 06:03:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-24 06:03:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2019-11-24 06:03:16,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 20 [2019-11-24 06:03:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:16,002 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 88 transitions. [2019-11-24 06:03:16,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2019-11-24 06:03:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:03:16,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:16,004 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:16,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -752735073, now seen corresponding path program 2 times [2019-11-24 06:03:16,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:16,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594430464] [2019-11-24 06:03:16,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:16,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594430464] [2019-11-24 06:03:16,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:16,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:16,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749617097] [2019-11-24 06:03:16,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:16,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:16,050 INFO L87 Difference]: Start difference. First operand 54 states and 88 transitions. Second operand 3 states. [2019-11-24 06:03:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:16,135 INFO L93 Difference]: Finished difference Result 114 states and 186 transitions. [2019-11-24 06:03:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:16,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 06:03:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:16,137 INFO L225 Difference]: With dead ends: 114 [2019-11-24 06:03:16,137 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 06:03:16,138 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 06:03:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 06:03:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-24 06:03:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 06:03:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2019-11-24 06:03:16,147 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 20 [2019-11-24 06:03:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:16,147 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2019-11-24 06:03:16,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2019-11-24 06:03:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 06:03:16,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:16,148 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:16,149 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1143523049, now seen corresponding path program 1 times [2019-11-24 06:03:16,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:16,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637912544] [2019-11-24 06:03:16,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 06:03:16,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637912544] [2019-11-24 06:03:16,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:16,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:16,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155903434] [2019-11-24 06:03:16,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:16,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:16,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:16,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:16,207 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand 3 states. [2019-11-24 06:03:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:16,303 INFO L93 Difference]: Finished difference Result 108 states and 173 transitions. [2019-11-24 06:03:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:16,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 06:03:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:16,306 INFO L225 Difference]: With dead ends: 108 [2019-11-24 06:03:16,306 INFO L226 Difference]: Without dead ends: 78 [2019-11-24 06:03:16,307 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 06:03:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-24 06:03:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-11-24 06:03:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-24 06:03:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2019-11-24 06:03:16,331 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 24 [2019-11-24 06:03:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:16,332 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2019-11-24 06:03:16,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2019-11-24 06:03:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 06:03:16,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:16,334 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:16,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2083326824, now seen corresponding path program 1 times [2019-11-24 06:03:16,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:16,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083017234] [2019-11-24 06:03:16,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:16,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083017234] [2019-11-24 06:03:16,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550675585] [2019-11-24 06:03:16,448 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 06:03:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:16,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:03:16,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:16,520 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:16,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:16,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:16,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:03:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:16,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 06:03:16,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 5] total 7 [2019-11-24 06:03:16,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563580534] [2019-11-24 06:03:16,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:16,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:16,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:03:16,573 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand 3 states. [2019-11-24 06:03:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:16,613 INFO L93 Difference]: Finished difference Result 120 states and 173 transitions. [2019-11-24 06:03:16,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:16,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 06:03:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:16,615 INFO L225 Difference]: With dead ends: 120 [2019-11-24 06:03:16,615 INFO L226 Difference]: Without dead ends: 118 [2019-11-24 06:03:16,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:03:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-24 06:03:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-11-24 06:03:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-24 06:03:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2019-11-24 06:03:16,628 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 38 [2019-11-24 06:03:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:16,629 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2019-11-24 06:03:16,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2019-11-24 06:03:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:03:16,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:16,630 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:16,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:16,834 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash 620476285, now seen corresponding path program 1 times [2019-11-24 06:03:16,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:16,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265907513] [2019-11-24 06:03:16,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:16,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265907513] [2019-11-24 06:03:16,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683380055] [2019-11-24 06:03:16,944 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 06:03:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:16,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-24 06:03:16,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:16,996 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:17,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:03:17,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 8 [2019-11-24 06:03:17,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49576758] [2019-11-24 06:03:17,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:17,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:03:17,015 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand 4 states. [2019-11-24 06:03:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:17,157 INFO L93 Difference]: Finished difference Result 236 states and 354 transitions. [2019-11-24 06:03:17,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:03:17,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-24 06:03:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:17,160 INFO L225 Difference]: With dead ends: 236 [2019-11-24 06:03:17,160 INFO L226 Difference]: Without dead ends: 124 [2019-11-24 06:03:17,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:03:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-24 06:03:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2019-11-24 06:03:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-24 06:03:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2019-11-24 06:03:17,185 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 40 [2019-11-24 06:03:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:17,186 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2019-11-24 06:03:17,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2019-11-24 06:03:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 06:03:17,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:17,189 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:17,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:17,393 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash 737503484, now seen corresponding path program 1 times [2019-11-24 06:03:17,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:17,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86333052] [2019-11-24 06:03:17,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:17,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86333052] [2019-11-24 06:03:17,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601161971] [2019-11-24 06:03:17,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:17,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 06:03:17,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:17,558 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:17,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:03:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-24 06:03:17,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445915981] [2019-11-24 06:03:17,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:17,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:03:17,570 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 3 states. [2019-11-24 06:03:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:17,634 INFO L93 Difference]: Finished difference Result 230 states and 263 transitions. [2019-11-24 06:03:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:17,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 06:03:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:17,635 INFO L225 Difference]: With dead ends: 230 [2019-11-24 06:03:17,636 INFO L226 Difference]: Without dead ends: 148 [2019-11-24 06:03:17,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:03:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-24 06:03:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-11-24 06:03:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-24 06:03:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2019-11-24 06:03:17,650 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 54 [2019-11-24 06:03:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:17,651 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2019-11-24 06:03:17,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2019-11-24 06:03:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 06:03:17,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:17,653 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:17,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:17,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash -709739287, now seen corresponding path program 1 times [2019-11-24 06:03:17,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:17,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713110471] [2019-11-24 06:03:17,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-24 06:03:17,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713110471] [2019-11-24 06:03:17,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946064124] [2019-11-24 06:03:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:18,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 06:03:18,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:18,039 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-24 06:03:18,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:03:18,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-24 06:03:18,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813386188] [2019-11-24 06:03:18,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:18,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:03:18,048 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand 3 states. [2019-11-24 06:03:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:18,064 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2019-11-24 06:03:18,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:18,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-24 06:03:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:18,067 INFO L225 Difference]: With dead ends: 235 [2019-11-24 06:03:18,067 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 06:03:18,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:03:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 06:03:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 06:03:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 06:03:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 06:03:18,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-11-24 06:03:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:18,069 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 06:03:18,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 06:03:18,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 06:03:18,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:18,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 06:03:18,727 INFO L440 ceAbstractionStarter]: At program point L60(lines 60 189) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,728 INFO L444 ceAbstractionStarter]: For program point L151-1(lines 74 183) no Hoare annotation was computed. [2019-11-24 06:03:18,728 INFO L440 ceAbstractionStarter]: At program point L52(lines 52 193) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,728 INFO L440 ceAbstractionStarter]: At program point L176(lines 22 211) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,728 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 197) no Hoare annotation was computed. [2019-11-24 06:03:18,729 INFO L440 ceAbstractionStarter]: At program point L36(lines 36 201) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,729 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 06:03:18,730 INFO L440 ceAbstractionStarter]: At program point L45(lines 44 197) the Hoare annotation is: (and (<= ULTIMATE.start_main_~blastFlag~0 2) (< 8512 ULTIMATE.start_main_~s__state~0)) [2019-11-24 06:03:18,730 INFO L444 ceAbstractionStarter]: For program point L169-1(lines 74 183) no Hoare annotation was computed. [2019-11-24 06:03:18,730 INFO L440 ceAbstractionStarter]: At program point L29(lines 29 204) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,730 INFO L440 ceAbstractionStarter]: At program point L120(lines 113 122) the Hoare annotation is: (and (<= ULTIMATE.start_main_~blastFlag~0 2) (< 8512 ULTIMATE.start_main_~s__state~0)) [2019-11-24 06:03:18,730 INFO L440 ceAbstractionStarter]: At program point L112(lines 105 123) the Hoare annotation is: (and (<= ULTIMATE.start_main_~blastFlag~0 2) (< 8512 ULTIMATE.start_main_~s__state~0)) [2019-11-24 06:03:18,730 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 123) no Hoare annotation was computed. [2019-11-24 06:03:18,731 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 183) no Hoare annotation was computed. [2019-11-24 06:03:18,731 INFO L440 ceAbstractionStarter]: At program point L64(lines 64 187) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,731 INFO L440 ceAbstractionStarter]: At program point L56(lines 56 191) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,731 INFO L444 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-24 06:03:18,731 INFO L447 ceAbstractionStarter]: At program point L213(lines 8 217) the Hoare annotation is: true [2019-11-24 06:03:18,731 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 118) no Hoare annotation was computed. [2019-11-24 06:03:18,731 INFO L440 ceAbstractionStarter]: At program point L48(lines 48 195) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,732 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 174) no Hoare annotation was computed. [2019-11-24 06:03:18,732 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 110) no Hoare annotation was computed. [2019-11-24 06:03:18,732 INFO L440 ceAbstractionStarter]: At program point L73(lines 72 183) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) [2019-11-24 06:03:18,732 INFO L440 ceAbstractionStarter]: At program point L40(lines 40 199) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,732 INFO L440 ceAbstractionStarter]: At program point L32(lines 32 203) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2) (and (= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0)))) [2019-11-24 06:03:18,732 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2019-11-24 06:03:18,732 INFO L440 ceAbstractionStarter]: At program point L173(lines 8 217) the Hoare annotation is: false [2019-11-24 06:03:18,733 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 06:03:18,733 INFO L447 ceAbstractionStarter]: At program point L216(lines 8 217) the Hoare annotation is: true [2019-11-24 06:03:18,733 INFO L440 ceAbstractionStarter]: At program point L68(lines 68 185) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) (< ULTIMATE.start_main_~blastFlag~0 5)) (<= ULTIMATE.start_main_~blastFlag~0 2)) [2019-11-24 06:03:18,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:03:18 BoogieIcfgContainer [2019-11-24 06:03:18,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:03:18,761 INFO L168 Benchmark]: Toolchain (without parser) took 4732.31 ms. Allocated memory was 147.3 MB in the beginning and 241.7 MB in the end (delta: 94.4 MB). Free memory was 105.2 MB in the beginning and 200.1 MB in the end (delta: -94.9 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:18,762 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 147.3 MB. Free memory is still 123.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 06:03:18,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.05 ms. Allocated memory is still 147.3 MB. Free memory was 105.2 MB in the beginning and 94.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:18,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.99 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 94.0 MB in the beginning and 181.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:18,764 INFO L168 Benchmark]: Boogie Preprocessor took 23.05 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:18,767 INFO L168 Benchmark]: RCFGBuilder took 464.67 ms. Allocated memory is still 202.4 MB. Free memory was 179.2 MB in the beginning and 153.1 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:18,768 INFO L168 Benchmark]: TraceAbstraction took 3798.85 ms. Allocated memory was 202.4 MB in the beginning and 241.7 MB in the end (delta: 39.3 MB). Free memory was 153.1 MB in the beginning and 200.1 MB in the end (delta: -47.0 MB). Peak memory consumption was 92.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:18,774 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.28 ms. Allocated memory is still 147.3 MB. Free memory is still 123.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.05 ms. Allocated memory is still 147.3 MB. Free memory was 105.2 MB in the beginning and 94.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.99 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 94.0 MB in the beginning and 181.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.05 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.67 ms. Allocated memory is still 202.4 MB. Free memory was 179.2 MB in the beginning and 153.1 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3798.85 ms. Allocated memory was 202.4 MB in the beginning and 241.7 MB in the end (delta: 39.3 MB). Free memory was 153.1 MB in the beginning and 200.1 MB in the end (delta: -47.0 MB). Peak memory consumption was 92.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 215]: 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: 48]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 8512 < s__state - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 8672 <= s__state && blastFlag < 5 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 8512 < s__state - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 8512 < s__state - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag < 5) || blastFlag <= 2) || (8640 == s__state && !(s__hit == 0)) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (8672 <= s__state && blastFlag < 5) || blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 398 SDtfs, 157 SDslu, 202 SDs, 0 SdLazy, 284 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 400 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=8, 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, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 107 NumberOfFragments, 232 HoareAnnotationTreeSize, 18 FomulaSimplifications, 768 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 119 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 59139 SizeOfPredicates, 3 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 605/759 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...