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/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:06:09,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:06:09,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:06:09,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:06:09,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:06:09,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:06:09,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:06:09,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:06:09,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:06:09,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:06:09,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:06:09,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:06:09,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:06:09,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:06:09,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:06:09,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:06:09,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:06:09,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:06:09,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:06:09,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:06:09,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:06:09,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:06:09,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:06:09,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:06:09,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:06:09,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:06:09,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:06:09,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:06:09,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:06:09,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:06:09,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:06:09,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:06:09,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:06:09,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:06:09,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:06:09,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:06:09,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:06:09,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:06:09,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:06:09,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:06:09,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:06:09,208 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-13 21:06:09,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:06:09,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:06:09,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:06:09,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:06:09,250 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:06:09,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:06:09,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:06:09,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:06:09,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:06:09,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:06:09,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:06:09,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:06:09,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:06:09,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:06:09,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:06:09,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:06:09,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:06:09,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:06:09,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:06:09,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:06:09,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:06:09,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:06:09,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:06:09,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:06:09,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:06:09,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:06:09,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:06:09,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:06:09,255 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-13 21:06:09,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:06:09,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:06:09,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:06:09,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:06:09,592 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:06:09,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-13 21:06:09,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebda83af5/7c1b5a12866e4a4b956495a3db788f29/FLAGf864c0939 [2019-10-13 21:06:10,087 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:06:10,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-13 21:06:10,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebda83af5/7c1b5a12866e4a4b956495a3db788f29/FLAGf864c0939 [2019-10-13 21:06:10,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebda83af5/7c1b5a12866e4a4b956495a3db788f29 [2019-10-13 21:06:10,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:06:10,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:06:10,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:10,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:06:10,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:06:10,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b193a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10, skipping insertion in model container [2019-10-13 21:06:10,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,549 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:06:10,572 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:06:10,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:10,825 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:06:10,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:10,876 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:06:10,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10 WrapperNode [2019-10-13 21:06:10,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:10,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:06:10,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:06:10,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:06:10,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:11,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:06:11,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:06:11,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:06:11,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:06:11,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (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-13 21:06:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:06:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:06:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:06:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:06:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:06:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:06:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:06:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:06:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:06:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:06:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:06:11,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:06:11,464 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:06:11,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:11 BoogieIcfgContainer [2019-10-13 21:06:11,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:06:11,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:06:11,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:06:11,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:06:11,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:06:10" (1/3) ... [2019-10-13 21:06:11,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff3cd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:11, skipping insertion in model container [2019-10-13 21:06:11,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (2/3) ... [2019-10-13 21:06:11,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff3cd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:11, skipping insertion in model container [2019-10-13 21:06:11,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:11" (3/3) ... [2019-10-13 21:06:11,474 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-10-13 21:06:11,484 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:06:11,492 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:06:11,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:06:11,530 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:06:11,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:06:11,531 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:06:11,531 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:06:11,531 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:06:11,532 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:06:11,532 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:06:11,532 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:06:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-13 21:06:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:06:11,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:11,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:11,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-10-13 21:06:11,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:11,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450625883] [2019-10-13 21:06:11,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:11,763 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-13 21:06:11,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450625883] [2019-10-13 21:06:11,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:11,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:11,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729152959] [2019-10-13 21:06:11,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:11,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:11,786 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-10-13 21:06:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:11,951 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-10-13 21:06:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:11,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 21:06:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:11,967 INFO L225 Difference]: With dead ends: 83 [2019-10-13 21:06:11,967 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:06:11,972 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-13 21:06:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:06:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-13 21:06:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 21:06:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-10-13 21:06:12,040 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-10-13 21:06:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,041 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-10-13 21:06:12,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-10-13 21:06:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:06:12,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,047 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-10-13 21:06:12,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502122894] [2019-10-13 21:06:12,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,166 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-13 21:06:12,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502122894] [2019-10-13 21:06:12,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:12,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860492765] [2019-10-13 21:06:12,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:12,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:12,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:12,178 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-10-13 21:06:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,316 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-10-13 21:06:12,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:12,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 21:06:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,319 INFO L225 Difference]: With dead ends: 49 [2019-10-13 21:06:12,319 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 21:06:12,320 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-13 21:06:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 21:06:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-13 21:06:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:06:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-10-13 21:06:12,337 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-10-13 21:06:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,338 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-10-13 21:06:12,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-10-13 21:06:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:06:12,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,341 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-10-13 21:06:12,342 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134641682] [2019-10-13 21:06:12,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,419 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-13 21:06:12,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134641682] [2019-10-13 21:06:12,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:06:12,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224275815] [2019-10-13 21:06:12,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:06:12,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:06:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:12,422 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-10-13 21:06:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,670 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-10-13 21:06:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:12,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-13 21:06:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,673 INFO L225 Difference]: With dead ends: 79 [2019-10-13 21:06:12,673 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 21:06:12,674 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-13 21:06:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 21:06:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-10-13 21:06:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:06:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-10-13 21:06:12,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-10-13 21:06:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,706 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-10-13 21:06:12,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:06:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-10-13 21:06:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:06:12,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,708 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,708 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-10-13 21:06:12,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364085272] [2019-10-13 21:06:12,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,808 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-13 21:06:12,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364085272] [2019-10-13 21:06:12,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:06:12,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714033066] [2019-10-13 21:06:12,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:06:12,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:06:12,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:12,812 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-10-13 21:06:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,109 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-10-13 21:06:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:13,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-13 21:06:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,116 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:06:13,116 INFO L226 Difference]: Without dead ends: 103 [2019-10-13 21:06:13,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:06:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-13 21:06:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-10-13 21:06:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-13 21:06:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-10-13 21:06:13,162 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-10-13 21:06:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,162 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-10-13 21:06:13,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:06:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-10-13 21:06:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:06:13,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,167 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-10-13 21:06:13,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015824084] [2019-10-13 21:06:13,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,245 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-13 21:06:13,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015824084] [2019-10-13 21:06:13,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165502439] [2019-10-13 21:06:13,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,249 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-10-13 21:06:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,325 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-10-13 21:06:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:13,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-13 21:06:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,329 INFO L225 Difference]: With dead ends: 106 [2019-10-13 21:06:13,329 INFO L226 Difference]: Without dead ends: 104 [2019-10-13 21:06:13,330 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-13 21:06:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-13 21:06:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-13 21:06:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-13 21:06:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-13 21:06:13,350 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-10-13 21:06:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,351 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-13 21:06:13,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-13 21:06:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:06:13,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,353 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-10-13 21:06:13,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649201121] [2019-10-13 21:06:13,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,413 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-13 21:06:13,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649201121] [2019-10-13 21:06:13,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:06:13,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564721875] [2019-10-13 21:06:13,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:06:13,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:06:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:13,418 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-10-13 21:06:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,638 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-10-13 21:06:13,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:06:13,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 21:06:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,642 INFO L225 Difference]: With dead ends: 157 [2019-10-13 21:06:13,642 INFO L226 Difference]: Without dead ends: 155 [2019-10-13 21:06:13,643 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-13 21:06:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-13 21:06:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-10-13 21:06:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-13 21:06:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-10-13 21:06:13,706 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-10-13 21:06:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,707 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-10-13 21:06:13,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:06:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-10-13 21:06:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:06:13,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,712 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-10-13 21:06:13,719 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560093473] [2019-10-13 21:06:13,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,770 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-13 21:06:13,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560093473] [2019-10-13 21:06:13,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:06:13,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828874716] [2019-10-13 21:06:13,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:06:13,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:06:13,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:13,775 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-10-13 21:06:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,983 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-10-13 21:06:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:06:13,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 21:06:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,986 INFO L225 Difference]: With dead ends: 189 [2019-10-13 21:06:13,986 INFO L226 Difference]: Without dead ends: 187 [2019-10-13 21:06:13,987 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-13 21:06:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-13 21:06:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-10-13 21:06:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-13 21:06:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-10-13 21:06:14,011 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-10-13 21:06:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:14,011 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-10-13 21:06:14,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:06:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-10-13 21:06:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:06:14,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:14,013 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:14,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-10-13 21:06:14,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:14,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407803991] [2019-10-13 21:06:14,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:14,040 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-13 21:06:14,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407803991] [2019-10-13 21:06:14,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:14,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:06:14,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147859227] [2019-10-13 21:06:14,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:06:14,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:14,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:06:14,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:14,043 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-10-13 21:06:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:14,094 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-10-13 21:06:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:06:14,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:06:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:14,100 INFO L225 Difference]: With dead ends: 309 [2019-10-13 21:06:14,100 INFO L226 Difference]: Without dead ends: 232 [2019-10-13 21:06:14,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-13 21:06:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-10-13 21:06:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-13 21:06:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-10-13 21:06:14,146 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-10-13 21:06:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:14,148 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-10-13 21:06:14,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:06:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-10-13 21:06:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:06:14,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:14,150 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] [2019-10-13 21:06:14,150 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-10-13 21:06:14,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:14,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586165032] [2019-10-13 21:06:14,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:14,216 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-13 21:06:14,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586165032] [2019-10-13 21:06:14,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:14,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:06:14,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197545225] [2019-10-13 21:06:14,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:06:14,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:06:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:14,220 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-10-13 21:06:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:14,391 INFO L93 Difference]: Finished difference Result 276 states and 448 transitions. [2019-10-13 21:06:14,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:14,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-13 21:06:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:14,395 INFO L225 Difference]: With dead ends: 276 [2019-10-13 21:06:14,395 INFO L226 Difference]: Without dead ends: 274 [2019-10-13 21:06:14,396 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-13 21:06:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-13 21:06:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2019-10-13 21:06:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-13 21:06:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2019-10-13 21:06:14,430 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 26 [2019-10-13 21:06:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:14,431 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2019-10-13 21:06:14,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:06:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2019-10-13 21:06:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:06:14,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:14,434 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:14,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-10-13 21:06:14,438 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:14,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831971219] [2019-10-13 21:06:14,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:06:14,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831971219] [2019-10-13 21:06:14,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588850981] [2019-10-13 21:06:14,567 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-13 21:06:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:14,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:06:14,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:06:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:06:14,781 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:06:14,847 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:06:14,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [10] total 15 [2019-10-13 21:06:14,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020491435] [2019-10-13 21:06:14,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:06:14,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:06:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:06:14,849 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand 10 states. [2019-10-13 21:06:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:15,079 INFO L93 Difference]: Finished difference Result 251 states and 399 transitions. [2019-10-13 21:06:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:15,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-10-13 21:06:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:15,084 INFO L225 Difference]: With dead ends: 251 [2019-10-13 21:06:15,085 INFO L226 Difference]: Without dead ends: 249 [2019-10-13 21:06:15,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:06:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-13 21:06:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-10-13 21:06:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 21:06:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 396 transitions. [2019-10-13 21:06:15,126 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 396 transitions. Word has length 28 [2019-10-13 21:06:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:15,127 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 396 transitions. [2019-10-13 21:06:15,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:06:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 396 transitions. [2019-10-13 21:06:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:06:15,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:15,131 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-13 21:06:15,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:15,343 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-10-13 21:06:15,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:15,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281428545] [2019-10-13 21:06:15,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:15,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:15,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:15,417 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-13 21:06:15,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281428545] [2019-10-13 21:06:15,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:15,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:06:15,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181786024] [2019-10-13 21:06:15,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:06:15,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:06:15,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:15,419 INFO L87 Difference]: Start difference. First operand 248 states and 396 transitions. Second operand 7 states. [2019-10-13 21:06:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:15,694 INFO L93 Difference]: Finished difference Result 417 states and 695 transitions. [2019-10-13 21:06:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:15,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-13 21:06:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:15,699 INFO L225 Difference]: With dead ends: 417 [2019-10-13 21:06:15,699 INFO L226 Difference]: Without dead ends: 415 [2019-10-13 21:06:15,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:06:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-10-13 21:06:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 371. [2019-10-13 21:06:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-13 21:06:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 617 transitions. [2019-10-13 21:06:15,745 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 617 transitions. Word has length 31 [2019-10-13 21:06:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:15,746 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 617 transitions. [2019-10-13 21:06:15,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:06:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 617 transitions. [2019-10-13 21:06:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:06:15,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:15,747 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-13 21:06:15,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2019-10-13 21:06:15,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:15,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700768078] [2019-10-13 21:06:15,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:15,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:15,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:15,791 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-13 21:06:15,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700768078] [2019-10-13 21:06:15,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:15,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:06:15,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648730959] [2019-10-13 21:06:15,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:06:15,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:06:15,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:15,793 INFO L87 Difference]: Start difference. First operand 371 states and 617 transitions. Second operand 7 states. [2019-10-13 21:06:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:16,093 INFO L93 Difference]: Finished difference Result 392 states and 648 transitions. [2019-10-13 21:06:16,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:16,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-13 21:06:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:16,098 INFO L225 Difference]: With dead ends: 392 [2019-10-13 21:06:16,098 INFO L226 Difference]: Without dead ends: 390 [2019-10-13 21:06:16,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:06:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-13 21:06:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-10-13 21:06:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-10-13 21:06:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 626 transitions. [2019-10-13 21:06:16,141 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 626 transitions. Word has length 31 [2019-10-13 21:06:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:16,141 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 626 transitions. [2019-10-13 21:06:16,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:06:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 626 transitions. [2019-10-13 21:06:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 21:06:16,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:16,143 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:16,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1751188594, now seen corresponding path program 1 times [2019-10-13 21:06:16,144 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:16,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614119285] [2019-10-13 21:06:16,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:16,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:16,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:06:16,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614119285] [2019-10-13 21:06:16,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384362262] [2019-10-13 21:06:16,250 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-13 21:06:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:16,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:06:16,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:06:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:06:16,368 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:06:16,402 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:06:16,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 14 [2019-10-13 21:06:16,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971813954] [2019-10-13 21:06:16,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:06:16,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:06:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:06:16,404 INFO L87 Difference]: Start difference. First operand 378 states and 626 transitions. Second operand 9 states. [2019-10-13 21:06:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:16,603 INFO L93 Difference]: Finished difference Result 440 states and 727 transitions. [2019-10-13 21:06:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:06:16,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-10-13 21:06:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:16,608 INFO L225 Difference]: With dead ends: 440 [2019-10-13 21:06:16,608 INFO L226 Difference]: Without dead ends: 438 [2019-10-13 21:06:16,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:06:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-13 21:06:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2019-10-13 21:06:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-13 21:06:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 629 transitions. [2019-10-13 21:06:16,681 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 629 transitions. Word has length 40 [2019-10-13 21:06:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 629 transitions. [2019-10-13 21:06:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:06:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 629 transitions. [2019-10-13 21:06:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:06:16,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:16,684 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 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-13 21:06:16,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:16,895 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-10-13 21:06:16,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:16,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104655685] [2019-10-13 21:06:16,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:16,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:16,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-13 21:06:16,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104655685] [2019-10-13 21:06:16,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:16,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:06:16,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121207973] [2019-10-13 21:06:16,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:06:16,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:06:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:16,983 INFO L87 Difference]: Start difference. First operand 382 states and 629 transitions. Second operand 7 states. [2019-10-13 21:06:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:17,290 INFO L93 Difference]: Finished difference Result 435 states and 701 transitions. [2019-10-13 21:06:17,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:17,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-13 21:06:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:17,295 INFO L225 Difference]: With dead ends: 435 [2019-10-13 21:06:17,295 INFO L226 Difference]: Without dead ends: 433 [2019-10-13 21:06:17,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:06:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-13 21:06:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 312. [2019-10-13 21:06:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-13 21:06:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 499 transitions. [2019-10-13 21:06:17,348 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 499 transitions. Word has length 41 [2019-10-13 21:06:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:17,349 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 499 transitions. [2019-10-13 21:06:17,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:06:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 499 transitions. [2019-10-13 21:06:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:06:17,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:17,354 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:17,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-10-13 21:06:17,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:17,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173185836] [2019-10-13 21:06:17,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:17,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:17,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:06:17,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173185836] [2019-10-13 21:06:17,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133590222] [2019-10-13 21:06:17,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:17,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:06:17,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-13 21:06:17,643 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:06:17,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:06:17,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 15 [2019-10-13 21:06:17,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737679349] [2019-10-13 21:06:17,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:06:17,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:06:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:06:17,736 INFO L87 Difference]: Start difference. First operand 312 states and 499 transitions. Second operand 6 states. [2019-10-13 21:06:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:18,031 INFO L93 Difference]: Finished difference Result 679 states and 1090 transitions. [2019-10-13 21:06:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:06:18,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-13 21:06:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:18,035 INFO L225 Difference]: With dead ends: 679 [2019-10-13 21:06:18,035 INFO L226 Difference]: Without dead ends: 395 [2019-10-13 21:06:18,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:06:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-13 21:06:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 360. [2019-10-13 21:06:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 21:06:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 583 transitions. [2019-10-13 21:06:18,094 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 583 transitions. Word has length 61 [2019-10-13 21:06:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:18,095 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 583 transitions. [2019-10-13 21:06:18,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:06:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 583 transitions. [2019-10-13 21:06:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 21:06:18,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:18,098 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:18,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:18,301 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1184410446, now seen corresponding path program 1 times [2019-10-13 21:06:18,303 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:18,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539566876] [2019-10-13 21:06:18,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:18,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-13 21:06:18,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539566876] [2019-10-13 21:06:18,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069838822] [2019-10-13 21:06:18,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:18,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:06:18,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-13 21:06:18,958 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-13 21:06:36,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [551520890] [2019-10-13 21:06:36,413 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 76 [2019-10-13 21:06:36,446 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:06:36,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:06:36,513 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:06:36,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:06:36,689 INFO L272 AbstractInterpreter]: Visited 37 different actions 136 times. Merged at 15 different actions 15 times. Never widened. Performed 159 root evaluator evaluations with a maximum evaluation depth of 8. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 3 fixpoints after 2 different actions. Largest state had 15 variables. [2019-10-13 21:06:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:36,696 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:36,696 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:06:36,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2019-10-13 21:06:36,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320910552] [2019-10-13 21:06:36,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:06:36,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:06:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=532, Unknown=4, NotChecked=0, Total=600 [2019-10-13 21:06:36,699 INFO L87 Difference]: Start difference. First operand 360 states and 583 transitions. Second operand 25 states. [2019-10-13 21:06:46,960 WARN L191 SmtUtils]: Spent 10.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 23