java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:21,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:21,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:21,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:21,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:21,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:21,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:21,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:21,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:21,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:21,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:21,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:21,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:21,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:21,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:21,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:21,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:21,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:21,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:21,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:21,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:21,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:21,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:21,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:21,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:21,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:21,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:21,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:21,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:21,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:21,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:21,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:21,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:21,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:21,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:21,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:21,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:21,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:21,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:21,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:21,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:21,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:05:21,793 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:21,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:21,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:21,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:21,795 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:21,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:21,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:21,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:21,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:21,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:21,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:21,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:21,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:21,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:21,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:21,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:21,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:21,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:21,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:21,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:21,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:21,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:21,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:21,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:21,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:21,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:21,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:21,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:21,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:22,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:22,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:22,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:22,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:22,117 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:22,118 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-15 01:05:22,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48beefcd1/9d9511d54c704eb4a6e8f4c412c3e1f7/FLAG3ff55ff3f [2019-10-15 01:05:22,666 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:22,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-15 01:05:22,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48beefcd1/9d9511d54c704eb4a6e8f4c412c3e1f7/FLAG3ff55ff3f [2019-10-15 01:05:23,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48beefcd1/9d9511d54c704eb4a6e8f4c412c3e1f7 [2019-10-15 01:05:23,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:23,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:23,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:23,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:23,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:23,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@780f94d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23, skipping insertion in model container [2019-10-15 01:05:23,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,113 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:23,130 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:23,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:23,316 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:23,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:23,347 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:23,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23 WrapperNode [2019-10-15 01:05:23,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:23,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:23,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:23,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:23,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:23,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:23,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:23,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:23,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05: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-10-15 01:05:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:05:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:23,778 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:23,778 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:05:23,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:23 BoogieIcfgContainer [2019-10-15 01:05:23,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:23,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:23,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:23,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:23,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:23" (1/3) ... [2019-10-15 01:05:23,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39948ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:23, skipping insertion in model container [2019-10-15 01:05:23,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (2/3) ... [2019-10-15 01:05:23,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39948ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:23, skipping insertion in model container [2019-10-15 01:05:23,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:23" (3/3) ... [2019-10-15 01:05:23,790 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-10-15 01:05:23,802 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:23,811 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:05:23,825 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:05:23,868 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:23,868 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:23,875 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:23,876 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:23,876 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:23,876 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:23,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:23,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:23,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-15 01:05:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:05:23,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:23,908 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:23,910 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-10-15 01:05:23,923 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:23,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887520389] [2019-10-15 01:05:23,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:23,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:23,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887520389] [2019-10-15 01:05:24,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:05:24,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337248418] [2019-10-15 01:05:24,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:05:24,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:05:24,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:05:24,058 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-15 01:05:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,088 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2019-10-15 01:05:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:05:24,090 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-15 01:05:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,100 INFO L225 Difference]: With dead ends: 61 [2019-10-15 01:05:24,101 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:05:24,105 INFO L600 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-10-15 01:05:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:05:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:05:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:05:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-10-15 01:05:24,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-10-15 01:05:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-15 01:05:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:05:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-10-15 01:05:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:05:24,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,159 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,159 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-10-15 01:05:24,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691602778] [2019-10-15 01:05:24,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691602778] [2019-10-15 01:05:24,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:24,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094014310] [2019-10-15 01:05:24,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:24,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:24,266 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-10-15 01:05:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,424 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-15 01:05:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:24,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-15 01:05:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,426 INFO L225 Difference]: With dead ends: 35 [2019-10-15 01:05:24,426 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 01:05:24,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 01:05:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-15 01:05:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 01:05:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-15 01:05:24,452 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-10-15 01:05:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,453 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-15 01:05:24,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-10-15 01:05:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:05:24,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,456 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-10-15 01:05:24,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110713479] [2019-10-15 01:05:24,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110713479] [2019-10-15 01:05:24,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:24,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298176274] [2019-10-15 01:05:24,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:24,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:24,593 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-10-15 01:05:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,739 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-10-15 01:05:24,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:24,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 01:05:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,742 INFO L225 Difference]: With dead ends: 48 [2019-10-15 01:05:24,742 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 01:05:24,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 01:05:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-15 01:05:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 01:05:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-15 01:05:24,755 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-10-15 01:05:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,756 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-15 01:05:24,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-15 01:05:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:05:24,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,757 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,758 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-10-15 01:05:24,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361469622] [2019-10-15 01:05:24,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:05:24,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361469622] [2019-10-15 01:05:24,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:24,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179008551] [2019-10-15 01:05:24,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:24,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:24,822 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-10-15 01:05:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,923 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-10-15 01:05:24,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:24,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 01:05:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,925 INFO L225 Difference]: With dead ends: 55 [2019-10-15 01:05:24,926 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 01:05:24,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 01:05:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-15 01:05:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-15 01:05:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-10-15 01:05:24,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-10-15 01:05:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,943 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-10-15 01:05:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-10-15 01:05:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:05:24,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,945 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-10-15 01:05:24,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233429142] [2019-10-15 01:05:24,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:05:25,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233429142] [2019-10-15 01:05:25,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:25,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:25,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361365038] [2019-10-15 01:05:25,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:25,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:25,065 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-10-15 01:05:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:25,258 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-10-15 01:05:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:25,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-15 01:05:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:25,261 INFO L225 Difference]: With dead ends: 70 [2019-10-15 01:05:25,261 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 01:05:25,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:05:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 01:05:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-15 01:05:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 01:05:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-10-15 01:05:25,275 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-10-15 01:05:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:25,275 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-10-15 01:05:25,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-10-15 01:05:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:05:25,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:25,277 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:25,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-10-15 01:05:25,278 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:25,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339706387] [2019-10-15 01:05:25,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:25,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:25,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:05:25,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339706387] [2019-10-15 01:05:25,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:25,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:05:25,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167924537] [2019-10-15 01:05:25,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:05:25,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:05:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:25,375 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-10-15 01:05:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:25,566 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-10-15 01:05:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:05:25,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-10-15 01:05:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:25,568 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:05:25,568 INFO L226 Difference]: Without dead ends: 70 [2019-10-15 01:05:25,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:05:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-15 01:05:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-10-15 01:05:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-15 01:05:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-15 01:05:25,593 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-10-15 01:05:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:25,594 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-15 01:05:25,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:05:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-15 01:05:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:05:25,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:25,599 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:25,599 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-10-15 01:05:25,600 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:25,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34434758] [2019-10-15 01:05:25,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:25,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:25,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 01:05:25,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34434758] [2019-10-15 01:05:25,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931721953] [2019-10-15 01:05:25,760 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-10-15 01:05:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:25,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-15 01:05:25,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:26,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-15 01:05:26,094 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:26,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:26,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:26,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-15 01:05:26,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1693305106] [2019-10-15 01:05:26,301 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 57 [2019-10-15 01:05:26,341 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:26,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:26,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:26,769 INFO L272 AbstractInterpreter]: Visited 36 different actions 443 times. Merged at 14 different actions 84 times. Widened at 1 different actions 2 times. Performed 514 root evaluator evaluations with a maximum evaluation depth of 6. Performed 514 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2019-10-15 01:05:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:26,776 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:26,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:26,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2019-10-15 01:05:26,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869006777] [2019-10-15 01:05:26,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 01:05:26,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:26,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 01:05:26,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:05:26,781 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 19 states. [2019-10-15 01:05:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:27,522 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2019-10-15 01:05:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:05:27,522 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-10-15 01:05:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:27,528 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:05:27,528 INFO L226 Difference]: Without dead ends: 96 [2019-10-15 01:05:27,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-10-15 01:05:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-15 01:05:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-10-15 01:05:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 01:05:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-10-15 01:05:27,569 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-10-15 01:05:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:27,569 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-10-15 01:05:27,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 01:05:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-10-15 01:05:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:05:27,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:27,573 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:27,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:27,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-10-15 01:05:27,779 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:27,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884321453] [2019-10-15 01:05:27,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:27,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:27,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 01:05:27,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884321453] [2019-10-15 01:05:27,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721772349] [2019-10-15 01:05:27,901 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-10-15 01:05:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:27,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:05:27,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:27,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 01:05:28,015 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 01:05:28,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [75769202] [2019-10-15 01:05:28,083 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 59 [2019-10-15 01:05:28,087 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:28,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:28,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:28,210 INFO L272 AbstractInterpreter]: Visited 27 different actions 240 times. Merged at 9 different actions 54 times. Widened at 1 different actions 2 times. Performed 286 root evaluator evaluations with a maximum evaluation depth of 6. Performed 286 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2019-10-15 01:05:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:28,210 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:28,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:28,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2019-10-15 01:05:28,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929432148] [2019-10-15 01:05:28,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:05:28,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:05:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:05:28,214 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-10-15 01:05:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:28,440 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-10-15 01:05:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:05:28,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-10-15 01:05:28,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:28,443 INFO L225 Difference]: With dead ends: 97 [2019-10-15 01:05:28,443 INFO L226 Difference]: Without dead ends: 95 [2019-10-15 01:05:28,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:05:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-15 01:05:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-15 01:05:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-15 01:05:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-10-15 01:05:28,476 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-10-15 01:05:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:28,477 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-10-15 01:05:28,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:05:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-10-15 01:05:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:05:28,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:28,480 INFO L380 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:28,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:28,688 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-10-15 01:05:28,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:28,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505301653] [2019-10-15 01:05:28,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:28,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:28,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-15 01:05:28,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505301653] [2019-10-15 01:05:28,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754638926] [2019-10-15 01:05:28,858 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-10-15 01:05:28,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-15 01:05:28,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:05:28,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:05:28,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:29,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-10-15 01:05:29,214 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:29,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:29,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-10-15 01:05:29,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [393204725] [2019-10-15 01:05:29,729 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 01:05:29,729 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 01:05:29,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:29,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 33 [2019-10-15 01:05:29,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126994728] [2019-10-15 01:05:29,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 01:05:29,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:29,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 01:05:29,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 01:05:29,736 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 33 states. [2019-10-15 01:05:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:31,097 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2019-10-15 01:05:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:05:31,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 83 [2019-10-15 01:05:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:31,101 INFO L225 Difference]: With dead ends: 135 [2019-10-15 01:05:31,101 INFO L226 Difference]: Without dead ends: 133 [2019-10-15 01:05:31,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-10-15 01:05:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-15 01:05:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2019-10-15 01:05:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-15 01:05:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2019-10-15 01:05:31,117 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 83 [2019-10-15 01:05:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:31,117 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2019-10-15 01:05:31,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-15 01:05:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2019-10-15 01:05:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:05:31,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:31,120 INFO L380 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:31,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:31,326 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-10-15 01:05:31,327 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:31,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049362855] [2019-10-15 01:05:31,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:31,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:31,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-15 01:05:31,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049362855] [2019-10-15 01:05:31,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732772330] [2019-10-15 01:05:31,538 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-10-15 01:05:31,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 01:05:31,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:05:31,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-15 01:05:31,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 100 proven. 26 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-10-15 01:05:31,783 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:31,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:31,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:31,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 100 proven. 26 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-10-15 01:05:32,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1259906276] [2019-10-15 01:05:32,023 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 01:05:32,023 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 01:05:32,023 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:32,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2019-10-15 01:05:32,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623512384] [2019-10-15 01:05:32,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 01:05:32,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:32,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 01:05:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:05:32,026 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 24 states. [2019-10-15 01:05:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:32,328 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2019-10-15 01:05:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:05:32,329 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 106 [2019-10-15 01:05:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:32,330 INFO L225 Difference]: With dead ends: 126 [2019-10-15 01:05:32,330 INFO L226 Difference]: Without dead ends: 113 [2019-10-15 01:05:32,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 197 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2019-10-15 01:05:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-15 01:05:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-15 01:05:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-15 01:05:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-10-15 01:05:32,344 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 106 [2019-10-15 01:05:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:32,344 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-10-15 01:05:32,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 01:05:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-10-15 01:05:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:05:32,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:32,349 INFO L380 BasicCegarLoop]: trace histogram [24, 23, 23, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:32,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:32,550 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 480072479, now seen corresponding path program 3 times [2019-10-15 01:05:32,551 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:32,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877472150] [2019-10-15 01:05:32,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:32,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:32,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 55 proven. 96 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2019-10-15 01:05:32,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877472150] [2019-10-15 01:05:32,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076254030] [2019-10-15 01:05:32,908 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-10-15 01:05:32,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:05:32,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:05:32,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-15 01:05:32,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:33,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 104 proven. 203 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-10-15 01:05:33,367 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:33,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:33,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:33,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:05:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 104 proven. 203 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-10-15 01:05:33,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [956256810] [2019-10-15 01:05:33,929 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 01:05:33,929 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 01:05:33,929 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:33,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 46 [2019-10-15 01:05:33,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790651540] [2019-10-15 01:05:33,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-15 01:05:33,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:33,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-15 01:05:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 01:05:33,932 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 46 states. [2019-10-15 01:05:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:36,286 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2019-10-15 01:05:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-15 01:05:36,287 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 158 [2019-10-15 01:05:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:36,288 INFO L225 Difference]: With dead ends: 147 [2019-10-15 01:05:36,288 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:05:36,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 286 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1090, Invalid=4762, Unknown=0, NotChecked=0, Total=5852 [2019-10-15 01:05:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:05:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:05:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:05:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:05:36,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-10-15 01:05:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:36,292 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:05:36,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-15 01:05:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:05:36,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:05:36,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:36,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:05:36,774 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2019-10-15 01:05:36,941 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-10-15 01:05:37,112 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-10-15 01:05:37,290 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:05:37,290 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:37,290 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:37,290 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:05:37,290 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:37,291 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:37,291 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse1 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (< main_~buf~0 main_~buflim~0))) (or (and (<= 0 main_~in~0) .cse0 .cse1 .cse2 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse1 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse2 .cse0))) [2019-10-15 01:05:37,291 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse1 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (< main_~buf~0 main_~buflim~0))) (or (and (<= 0 main_~in~0) .cse0 .cse1 .cse2 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse1 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse2 .cse0))) [2019-10-15 01:05:37,291 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-10-15 01:05:37,291 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-10-15 01:05:37,291 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-10-15 01:05:37,292 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-15 01:05:37,292 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-15 01:05:37,292 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buf~0 (+ main_~buflim~0 1))) [2019-10-15 01:05:37,292 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (< main_~buf~0 (+ main_~buflim~0 1))) [2019-10-15 01:05:37,292 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-15 01:05:37,292 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-10-15 01:05:37,293 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse1 (< main_~buf~0 (+ main_~buflim~0 1))) (and .cse0 (<= 0 main_~in~0) .cse1 (= main_~buf~0 0) (<= 2 main_~bufferlen~0)))) [2019-10-15 01:05:37,293 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-10-15 01:05:37,293 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-15 01:05:37,293 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-10-15 01:05:37,293 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2019-10-15 01:05:37,293 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-10-15 01:05:37,293 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-10-15 01:05:37,293 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-10-15 01:05:37,293 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-10-15 01:05:37,293 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-10-15 01:05:37,294 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-15 01:05:37,294 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-10-15 01:05:37,294 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-15 01:05:37,294 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-15 01:05:37,294 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:05:37,294 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-15 01:05:37,294 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-15 01:05:37,295 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:05:37,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:37 BoogieIcfgContainer [2019-10-15 01:05:37,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:05:37,313 INFO L168 Benchmark]: Toolchain (without parser) took 14212.30 ms. Allocated memory was 138.4 MB in the beginning and 355.5 MB in the end (delta: 217.1 MB). Free memory was 103.3 MB in the beginning and 291.0 MB in the end (delta: -187.7 MB). Peak memory consumption was 229.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:37,320 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 01:05:37,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.17 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:37,322 INFO L168 Benchmark]: Boogie Preprocessor took 122.03 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.2 MB in the beginning and 180.7 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:37,323 INFO L168 Benchmark]: RCFGBuilder took 309.51 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 166.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:37,324 INFO L168 Benchmark]: TraceAbstraction took 13529.70 ms. Allocated memory was 202.4 MB in the beginning and 355.5 MB in the end (delta: 153.1 MB). Free memory was 166.7 MB in the beginning and 291.0 MB in the end (delta: -124.3 MB). Peak memory consumption was 228.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:37,335 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.23 ms. Allocated memory is still 138.4 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.17 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.03 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.2 MB in the beginning and 180.7 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.51 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 166.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13529.70 ms. Allocated memory was 202.4 MB in the beginning and 355.5 MB in the end (delta: 153.1 MB). Free memory was 166.7 MB in the beginning and 291.0 MB in the end (delta: -124.3 MB). Peak memory consumption was 228.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 23]: Loop Invariant Derived loop invariant: (((((bufferlen + 1 <= inlen && bufferlen == buflim + 2) && 1 <= in) && 0 <= buf) && in + buflim + 3 <= buf + inlen) && buf < buflim + 1) || ((((bufferlen == buflim + 2 && 0 <= in) && in + buflim + 3 <= buf + inlen) && buf == 0) && 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 24, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 411 SDtfs, 653 SDslu, 2468 SDs, 0 SdLazy, 2908 SolverSat, 937 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 841 SyntacticMatches, 26 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2726 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 78 PreInvPairs, 145 NumberOfFragments, 280 HoareAnnotationTreeSize, 78 FomulaSimplifications, 2109 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 2153 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 615311 SizeOfPredicates, 35 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 5753/6502 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...