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/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:07,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:07,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:07,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:07,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:07,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:07,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:07,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:07,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:07,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:07,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:07,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:07,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:07,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:07,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:07,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:07,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:07,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:07,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:07,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:07,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:07,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:07,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:07,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:07,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:07,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:07,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:07,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:07,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:07,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:07,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:07,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:07,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:07,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:07,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:07,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:07,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:07,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:07,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:07,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:07,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:07,608 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:05:07,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:07,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:07,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:07,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:07,630 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:07,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:07,631 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:07,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:07,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:07,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:07,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:07,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:07,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:07,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:07,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:07,633 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:07,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:07,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:07,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:07,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:07,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:07,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:07,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:07,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:07,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:07,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:07,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:07,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:07,635 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:05:07,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:07,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:07,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:07,933 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:07,934 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:07,934 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-10-13 21:05:07,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e287f0fbc/1e54731d9d0547579484fbb1d3cc9d4a/FLAG8be823b3e [2019-10-13 21:05:08,453 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:08,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-10-13 21:05:08,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e287f0fbc/1e54731d9d0547579484fbb1d3cc9d4a/FLAG8be823b3e [2019-10-13 21:05:08,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e287f0fbc/1e54731d9d0547579484fbb1d3cc9d4a [2019-10-13 21:05:08,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:08,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:08,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:08,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:08,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:08,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:08" (1/1) ... [2019-10-13 21:05:08,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7f8ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:08, skipping insertion in model container [2019-10-13 21:05:08,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:08" (1/1) ... [2019-10-13 21:05:08,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:08,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:09,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:09,183 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:09,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:09,319 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:09,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09 WrapperNode [2019-10-13 21:05:09,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:09,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:09,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:09,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:09,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (1/1) ... [2019-10-13 21:05:09,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:09,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:09,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:09,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:09,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (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:05:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:09,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:09,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:09,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:09,775 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:09,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:09 BoogieIcfgContainer [2019-10-13 21:05:09,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:09,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:09,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:09,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:09,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:08" (1/3) ... [2019-10-13 21:05:09,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220b91cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:09, skipping insertion in model container [2019-10-13 21:05:09,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:09" (2/3) ... [2019-10-13 21:05:09,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220b91cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:09, skipping insertion in model container [2019-10-13 21:05:09,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:09" (3/3) ... [2019-10-13 21:05:09,786 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-10-13 21:05:09,796 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:09,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:09,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:09,846 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:09,846 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:09,847 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:09,847 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:09,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:09,847 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:09,847 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:09,848 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-13 21:05:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:09,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:09,885 INFO L380 BasicCegarLoop]: trace histogram [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:05:09,887 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:09,894 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-10-13 21:05:09,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:09,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841172423] [2019-10-13 21:05:09,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,103 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:05:10,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841172423] [2019-10-13 21:05:10,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494082771] [2019-10-13 21:05:10,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,131 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-10-13 21:05:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,220 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-10-13 21:05:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,236 INFO L225 Difference]: With dead ends: 93 [2019-10-13 21:05:10,237 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 21:05:10,240 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:05:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 21:05:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-10-13 21:05:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 21:05:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-10-13 21:05:10,323 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-10-13 21:05:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,324 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-10-13 21:05:10,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-10-13 21:05:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:10,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,328 INFO L380 BasicCegarLoop]: trace histogram [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:05:10,328 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-10-13 21:05:10,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701348022] [2019-10-13 21:05:10,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,422 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:05:10,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701348022] [2019-10-13 21:05:10,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208517633] [2019-10-13 21:05:10,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,427 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-10-13 21:05:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,483 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-10-13 21:05:10,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,486 INFO L225 Difference]: With dead ends: 127 [2019-10-13 21:05:10,486 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 21:05:10,489 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:05:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 21:05:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-13 21:05:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 21:05:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-10-13 21:05:10,506 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-10-13 21:05:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,507 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-10-13 21:05:10,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-10-13 21:05:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:10,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,508 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:10,508 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-10-13 21:05:10,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911772270] [2019-10-13 21:05:10,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,559 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:05:10,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911772270] [2019-10-13 21:05:10,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770692064] [2019-10-13 21:05:10,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,565 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-10-13 21:05:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,611 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-10-13 21:05:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,614 INFO L225 Difference]: With dead ends: 117 [2019-10-13 21:05:10,614 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 21:05:10,615 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:05:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 21:05:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-10-13 21:05:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-13 21:05:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-10-13 21:05:10,638 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-10-13 21:05:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,639 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-10-13 21:05:10,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-10-13 21:05:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:10,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:10,640 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-10-13 21:05:10,644 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970374451] [2019-10-13 21:05:10,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,728 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:05:10,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970374451] [2019-10-13 21:05:10,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111693035] [2019-10-13 21:05:10,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,731 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-10-13 21:05:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,760 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-10-13 21:05:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,766 INFO L225 Difference]: With dead ends: 148 [2019-10-13 21:05:10,766 INFO L226 Difference]: Without dead ends: 146 [2019-10-13 21:05:10,767 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:05:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-13 21:05:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-10-13 21:05:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-13 21:05:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-10-13 21:05:10,783 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-10-13 21:05:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,783 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-10-13 21:05:10,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-10-13 21:05:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:10,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,785 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:10,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-10-13 21:05:10,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41271720] [2019-10-13 21:05:10,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,830 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:05:10,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41271720] [2019-10-13 21:05:10,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087026671] [2019-10-13 21:05:10,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,833 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-10-13 21:05:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,854 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-10-13 21:05:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,857 INFO L225 Difference]: With dead ends: 244 [2019-10-13 21:05:10,857 INFO L226 Difference]: Without dead ends: 148 [2019-10-13 21:05:10,858 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:05:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-13 21:05:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-10-13 21:05:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-13 21:05:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-10-13 21:05:10,870 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-10-13 21:05:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,871 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-10-13 21:05:10,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-10-13 21:05:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:10,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:10,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-10-13 21:05:10,874 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870923127] [2019-10-13 21:05:10,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,924 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:05:10,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870923127] [2019-10-13 21:05:10,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804996165] [2019-10-13 21:05:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,929 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-10-13 21:05:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,958 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-10-13 21:05:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,961 INFO L225 Difference]: With dead ends: 219 [2019-10-13 21:05:10,961 INFO L226 Difference]: Without dead ends: 150 [2019-10-13 21:05:10,962 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:05:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-13 21:05:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-10-13 21:05:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-13 21:05:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-10-13 21:05:10,978 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-10-13 21:05:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,978 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-10-13 21:05:10,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-10-13 21:05:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:10,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:10,981 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-10-13 21:05:10,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510265533] [2019-10-13 21:05:10,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,052 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:05:11,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510265533] [2019-10-13 21:05:11,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29640056] [2019-10-13 21:05:11,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,055 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-10-13 21:05:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,076 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-10-13 21:05:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,078 INFO L225 Difference]: With dead ends: 276 [2019-10-13 21:05:11,079 INFO L226 Difference]: Without dead ends: 274 [2019-10-13 21:05:11,079 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:05:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-13 21:05:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-10-13 21:05:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-13 21:05:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-10-13 21:05:11,093 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-10-13 21:05:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,093 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-10-13 21:05:11,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-10-13 21:05:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:11,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,095 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-10-13 21:05:11,096 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712124976] [2019-10-13 21:05:11,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,141 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:05:11,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712124976] [2019-10-13 21:05:11,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555089042] [2019-10-13 21:05:11,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,145 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-10-13 21:05:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,178 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-10-13 21:05:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,180 INFO L225 Difference]: With dead ends: 472 [2019-10-13 21:05:11,180 INFO L226 Difference]: Without dead ends: 282 [2019-10-13 21:05:11,182 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:05:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-13 21:05:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-10-13 21:05:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:05:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-10-13 21:05:11,195 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-10-13 21:05:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,195 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-10-13 21:05:11,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-10-13 21:05:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:11,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,198 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-10-13 21:05:11,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346902644] [2019-10-13 21:05:11,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,233 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:05:11,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346902644] [2019-10-13 21:05:11,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414536874] [2019-10-13 21:05:11,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,237 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-10-13 21:05:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,270 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-10-13 21:05:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,273 INFO L225 Difference]: With dead ends: 420 [2019-10-13 21:05:11,273 INFO L226 Difference]: Without dead ends: 286 [2019-10-13 21:05:11,274 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:05:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-13 21:05:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-10-13 21:05:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-13 21:05:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-10-13 21:05:11,298 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-10-13 21:05:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,298 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-10-13 21:05:11,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-10-13 21:05:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:11,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,308 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-10-13 21:05:11,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694778589] [2019-10-13 21:05:11,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,373 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:05:11,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694778589] [2019-10-13 21:05:11,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464692993] [2019-10-13 21:05:11,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,379 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-10-13 21:05:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,413 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-10-13 21:05:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,417 INFO L225 Difference]: With dead ends: 524 [2019-10-13 21:05:11,417 INFO L226 Difference]: Without dead ends: 522 [2019-10-13 21:05:11,419 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:05:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-13 21:05:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-10-13 21:05:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-13 21:05:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-10-13 21:05:11,440 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-10-13 21:05:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,442 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-10-13 21:05:11,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-10-13 21:05:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:11,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-10-13 21:05:11,446 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485213252] [2019-10-13 21:05:11,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,486 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:05:11,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485213252] [2019-10-13 21:05:11,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246402081] [2019-10-13 21:05:11,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,490 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-10-13 21:05:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,528 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-10-13 21:05:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,532 INFO L225 Difference]: With dead ends: 924 [2019-10-13 21:05:11,533 INFO L226 Difference]: Without dead ends: 546 [2019-10-13 21:05:11,534 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:05:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-13 21:05:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-10-13 21:05:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-13 21:05:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-10-13 21:05:11,554 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-10-13 21:05:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,554 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-10-13 21:05:11,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-10-13 21:05:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:11,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,559 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-10-13 21:05:11,559 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813350736] [2019-10-13 21:05:11,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,598 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:05:11,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813350736] [2019-10-13 21:05:11,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485570302] [2019-10-13 21:05:11,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,602 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-10-13 21:05:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,627 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-10-13 21:05:11,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,631 INFO L225 Difference]: With dead ends: 816 [2019-10-13 21:05:11,631 INFO L226 Difference]: Without dead ends: 554 [2019-10-13 21:05:11,632 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:05:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-13 21:05:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-10-13 21:05:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-13 21:05:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-10-13 21:05:11,652 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-10-13 21:05:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,652 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-10-13 21:05:11,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-10-13 21:05:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:11,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,654 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,654 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-10-13 21:05:11,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346165064] [2019-10-13 21:05:11,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,687 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:05:11,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346165064] [2019-10-13 21:05:11,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446788225] [2019-10-13 21:05:11,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,689 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-10-13 21:05:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,720 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-10-13 21:05:11,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,727 INFO L225 Difference]: With dead ends: 1004 [2019-10-13 21:05:11,727 INFO L226 Difference]: Without dead ends: 1002 [2019-10-13 21:05:11,728 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:05:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-10-13 21:05:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-10-13 21:05:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-13 21:05:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-10-13 21:05:11,751 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-10-13 21:05:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,752 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-10-13 21:05:11,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-10-13 21:05:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:11,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,754 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-10-13 21:05:11,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68040003] [2019-10-13 21:05:11,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,775 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:05:11,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68040003] [2019-10-13 21:05:11,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416544066] [2019-10-13 21:05:11,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,778 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-10-13 21:05:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,811 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-10-13 21:05:11,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,818 INFO L225 Difference]: With dead ends: 1820 [2019-10-13 21:05:11,818 INFO L226 Difference]: Without dead ends: 1066 [2019-10-13 21:05:11,820 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:05:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-10-13 21:05:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-10-13 21:05:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-10-13 21:05:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-10-13 21:05:11,859 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-10-13 21:05:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,859 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-10-13 21:05:11,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-10-13 21:05:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:11,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,862 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,862 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-10-13 21:05:11,863 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471616338] [2019-10-13 21:05:11,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,885 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:05:11,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471616338] [2019-10-13 21:05:11,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811726526] [2019-10-13 21:05:11,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,888 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-10-13 21:05:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,933 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-10-13 21:05:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,941 INFO L225 Difference]: With dead ends: 1596 [2019-10-13 21:05:11,942 INFO L226 Difference]: Without dead ends: 1082 [2019-10-13 21:05:11,944 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:05:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-10-13 21:05:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-10-13 21:05:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-10-13 21:05:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-10-13 21:05:11,981 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-10-13 21:05:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,982 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-10-13 21:05:11,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-10-13 21:05:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:11,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:11,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-10-13 21:05:11,986 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683724518] [2019-10-13 21:05:11,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,016 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:05:12,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683724518] [2019-10-13 21:05:12,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663401830] [2019-10-13 21:05:12,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,023 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-10-13 21:05:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,073 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-10-13 21:05:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,082 INFO L225 Difference]: With dead ends: 1932 [2019-10-13 21:05:12,083 INFO L226 Difference]: Without dead ends: 1930 [2019-10-13 21:05:12,084 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:05:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-13 21:05:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-10-13 21:05:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-13 21:05:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-10-13 21:05:12,139 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-10-13 21:05:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,139 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-10-13 21:05:12,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-10-13 21:05:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:12,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:12,144 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-10-13 21:05:12,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563352231] [2019-10-13 21:05:12,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,171 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:05:12,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563352231] [2019-10-13 21:05:12,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219414257] [2019-10-13 21:05:12,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,174 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-10-13 21:05:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,221 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-10-13 21:05:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,233 INFO L225 Difference]: With dead ends: 3596 [2019-10-13 21:05:12,233 INFO L226 Difference]: Without dead ends: 2090 [2019-10-13 21:05:12,238 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:05:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-10-13 21:05:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-10-13 21:05:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-10-13 21:05:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-10-13 21:05:12,302 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-10-13 21:05:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,303 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-10-13 21:05:12,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-10-13 21:05:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:12,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,306 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:12,307 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-10-13 21:05:12,308 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058698686] [2019-10-13 21:05:12,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,330 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:05:12,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058698686] [2019-10-13 21:05:12,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060076914] [2019-10-13 21:05:12,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,332 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-10-13 21:05:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,379 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-10-13 21:05:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,390 INFO L225 Difference]: With dead ends: 3132 [2019-10-13 21:05:12,390 INFO L226 Difference]: Without dead ends: 2122 [2019-10-13 21:05:12,393 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:05:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-13 21:05:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-10-13 21:05:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-10-13 21:05:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-10-13 21:05:12,457 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-10-13 21:05:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,457 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-10-13 21:05:12,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-10-13 21:05:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:12,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:12,461 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-10-13 21:05:12,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734755578] [2019-10-13 21:05:12,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,510 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:05:12,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734755578] [2019-10-13 21:05:12,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682089593] [2019-10-13 21:05:12,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,512 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-10-13 21:05:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,573 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-10-13 21:05:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,591 INFO L225 Difference]: With dead ends: 3724 [2019-10-13 21:05:12,591 INFO L226 Difference]: Without dead ends: 3722 [2019-10-13 21:05:12,593 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:05:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-13 21:05:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-10-13 21:05:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-13 21:05:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-10-13 21:05:12,677 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-10-13 21:05:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,678 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-10-13 21:05:12,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-10-13 21:05:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:12,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:12,684 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-10-13 21:05:12,684 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243095679] [2019-10-13 21:05:12,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,701 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:05:12,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243095679] [2019-10-13 21:05:12,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159185549] [2019-10-13 21:05:12,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,703 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-10-13 21:05:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,771 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-10-13 21:05:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,791 INFO L225 Difference]: With dead ends: 7116 [2019-10-13 21:05:12,791 INFO L226 Difference]: Without dead ends: 4106 [2019-10-13 21:05:12,797 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:05:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-13 21:05:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-10-13 21:05:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-13 21:05:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-10-13 21:05:12,917 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-10-13 21:05:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,918 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-10-13 21:05:12,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-10-13 21:05:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:12,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:12,924 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-10-13 21:05:12,925 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119697486] [2019-10-13 21:05:12,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,981 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:05:12,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119697486] [2019-10-13 21:05:12,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872455242] [2019-10-13 21:05:12,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,984 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-10-13 21:05:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,049 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-10-13 21:05:13,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,069 INFO L225 Difference]: With dead ends: 6156 [2019-10-13 21:05:13,069 INFO L226 Difference]: Without dead ends: 4170 [2019-10-13 21:05:13,074 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:05:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-10-13 21:05:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-10-13 21:05:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-10-13 21:05:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-10-13 21:05:13,227 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-10-13 21:05:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,227 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-10-13 21:05:13,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-10-13 21:05:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:13,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:13,234 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-10-13 21:05:13,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187929745] [2019-10-13 21:05:13,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,254 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:05:13,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187929745] [2019-10-13 21:05:13,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889649142] [2019-10-13 21:05:13,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,257 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-10-13 21:05:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,395 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-10-13 21:05:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,419 INFO L225 Difference]: With dead ends: 12108 [2019-10-13 21:05:13,419 INFO L226 Difference]: Without dead ends: 8074 [2019-10-13 21:05:13,429 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:05:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-13 21:05:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-10-13 21:05:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-13 21:05:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-10-13 21:05:13,681 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-10-13 21:05:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,681 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-10-13 21:05:13,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-10-13 21:05:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:13,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:13,692 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-10-13 21:05:13,693 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016062153] [2019-10-13 21:05:13,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,712 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:05:13,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016062153] [2019-10-13 21:05:13,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554906162] [2019-10-13 21:05:13,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,714 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-10-13 21:05:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,835 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-10-13 21:05:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,854 INFO L225 Difference]: With dead ends: 9100 [2019-10-13 21:05:13,855 INFO L226 Difference]: Without dead ends: 9098 [2019-10-13 21:05:13,860 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:05:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-10-13 21:05:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-10-13 21:05:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-13 21:05:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-10-13 21:05:14,149 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-10-13 21:05:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,150 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-10-13 21:05:14,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-10-13 21:05:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:14,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:14,160 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-10-13 21:05:14,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072228419] [2019-10-13 21:05:14,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,178 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:05:14,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072228419] [2019-10-13 21:05:14,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356114471] [2019-10-13 21:05:14,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,181 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-10-13 21:05:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,327 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-10-13 21:05:14,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,356 INFO L225 Difference]: With dead ends: 13708 [2019-10-13 21:05:14,356 INFO L226 Difference]: Without dead ends: 13706 [2019-10-13 21:05:14,362 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:05:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-10-13 21:05:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-10-13 21:05:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-10-13 21:05:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-10-13 21:05:14,627 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-10-13 21:05:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,627 INFO L462 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-10-13 21:05:14,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-10-13 21:05:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:14,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,650 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:14,651 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-10-13 21:05:14,651 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509158820] [2019-10-13 21:05:14,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,670 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:05:14,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509158820] [2019-10-13 21:05:14,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139820643] [2019-10-13 21:05:14,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,673 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-10-13 21:05:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,940 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-10-13 21:05:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,971 INFO L225 Difference]: With dead ends: 27788 [2019-10-13 21:05:14,971 INFO L226 Difference]: Without dead ends: 15754 [2019-10-13 21:05:14,997 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:05:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-10-13 21:05:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-10-13 21:05:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-10-13 21:05:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-10-13 21:05:15,447 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-10-13 21:05:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:15,447 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-10-13 21:05:15,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-10-13 21:05:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:05:15,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:15,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:15,469 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-10-13 21:05:15,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:15,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841192345] [2019-10-13 21:05:15,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:15,487 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:05:15,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841192345] [2019-10-13 21:05:15,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:15,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:15,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782570693] [2019-10-13 21:05:15,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:15,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:15,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:15,489 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-10-13 21:05:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:15,664 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-10-13 21:05:15,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:15,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:05:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:15,695 INFO L225 Difference]: With dead ends: 23820 [2019-10-13 21:05:15,695 INFO L226 Difference]: Without dead ends: 16138 [2019-10-13 21:05:15,714 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:05:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-10-13 21:05:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-10-13 21:05:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-10-13 21:05:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-10-13 21:05:16,589 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-10-13 21:05:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:16,589 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-10-13 21:05:16,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-10-13 21:05:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:05:16,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:16,610 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:16,610 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-10-13 21:05:16,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:16,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059785036] [2019-10-13 21:05:16,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:16,628 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:05:16,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059785036] [2019-10-13 21:05:16,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:16,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:16,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971978553] [2019-10-13 21:05:16,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:16,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:16,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:16,630 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-10-13 21:05:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:16,911 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-10-13 21:05:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:16,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:05:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:16,967 INFO L225 Difference]: With dead ends: 26636 [2019-10-13 21:05:16,967 INFO L226 Difference]: Without dead ends: 26634 [2019-10-13 21:05:16,978 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:05:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-10-13 21:05:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-10-13 21:05:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-10-13 21:05:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-10-13 21:05:17,475 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-10-13 21:05:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,476 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-10-13 21:05:17,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-10-13 21:05:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:05:17,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,532 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-10-13 21:05:17,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130003816] [2019-10-13 21:05:17,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,563 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:05:17,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130003816] [2019-10-13 21:05:17,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426258137] [2019-10-13 21:05:17,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,566 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-10-13 21:05:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,975 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-10-13 21:05:17,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:05:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,037 INFO L225 Difference]: With dead ends: 55308 [2019-10-13 21:05:18,038 INFO L226 Difference]: Without dead ends: 31242 [2019-10-13 21:05:18,083 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:05:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-10-13 21:05:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-10-13 21:05:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-10-13 21:05:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-10-13 21:05:18,857 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-10-13 21:05:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,858 INFO L462 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-10-13 21:05:18,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-10-13 21:05:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:05:18,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:18,896 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-10-13 21:05:18,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134498688] [2019-10-13 21:05:18,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,930 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:05:18,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134498688] [2019-10-13 21:05:18,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153392668] [2019-10-13 21:05:18,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,932 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-10-13 21:05:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,628 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-10-13 21:05:19,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:05:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,687 INFO L225 Difference]: With dead ends: 46860 [2019-10-13 21:05:19,687 INFO L226 Difference]: Without dead ends: 31754 [2019-10-13 21:05:19,724 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:05:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-10-13 21:05:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-10-13 21:05:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-10-13 21:05:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-10-13 21:05:20,370 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-10-13 21:05:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,371 INFO L462 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-10-13 21:05:20,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-10-13 21:05:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:05:20,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,404 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-10-13 21:05:20,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136604369] [2019-10-13 21:05:20,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,430 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:05:20,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136604369] [2019-10-13 21:05:20,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585210404] [2019-10-13 21:05:20,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,432 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-10-13 21:05:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:21,184 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-10-13 21:05:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:21,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:05:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:21,254 INFO L225 Difference]: With dead ends: 51210 [2019-10-13 21:05:21,254 INFO L226 Difference]: Without dead ends: 51208 [2019-10-13 21:05:21,266 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:05:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-10-13 21:05:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-10-13 21:05:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-10-13 21:05:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-10-13 21:05:23,344 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-10-13 21:05:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,344 INFO L462 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-10-13 21:05:23,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-10-13 21:05:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:05:23,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:23,403 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-10-13 21:05:23,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132754066] [2019-10-13 21:05:23,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,423 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:05:23,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132754066] [2019-10-13 21:05:23,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387189873] [2019-10-13 21:05:23,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,425 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-10-13 21:05:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:24,096 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-10-13 21:05:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:24,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:05:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:24,097 INFO L225 Difference]: With dead ends: 109576 [2019-10-13 21:05:24,097 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:24,198 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:05:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:24,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-13 21:05:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,199 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:24,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:24,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:24,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:24,230 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:24,230 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:24,230 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:24,230 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:24,231 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:24,231 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:24,231 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-10-13 21:05:24,231 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-13 21:05:24,231 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-10-13 21:05:24,231 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-13 21:05:24,231 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-13 21:05:24,231 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-13 21:05:24,232 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,233 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,233 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-10-13 21:05:24,233 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,233 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-10-13 21:05:24,235 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-10-13 21:05:24,235 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,235 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,235 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,236 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,237 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 21:05:24,238 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-10-13 21:05:24,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:24 BoogieIcfgContainer [2019-10-13 21:05:24,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:24,258 INFO L168 Benchmark]: Toolchain (without parser) took 15372.16 ms. Allocated memory was 143.7 MB in the beginning and 1.1 GB in the end (delta: 994.1 MB). Free memory was 103.3 MB in the beginning and 533.7 MB in the end (delta: -430.4 MB). Peak memory consumption was 563.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:24,259 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:05:24,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.10 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 103.1 MB in the beginning and 181.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:24,260 INFO L168 Benchmark]: Boogie Preprocessor took 55.21 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 179.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:24,260 INFO L168 Benchmark]: RCFGBuilder took 400.26 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 159.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:24,261 INFO L168 Benchmark]: TraceAbstraction took 14471.63 ms. Allocated memory was 202.9 MB in the beginning and 1.1 GB in the end (delta: 934.8 MB). Free memory was 159.5 MB in the beginning and 533.7 MB in the end (delta: -374.2 MB). Peak memory consumption was 560.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:24,265 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 439.10 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 103.1 MB in the beginning and 181.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.21 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 179.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 400.26 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 159.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14471.63 ms. Allocated memory was 202.9 MB in the beginning and 1.1 GB in the end (delta: 934.8 MB). Free memory was 159.5 MB in the beginning and 533.7 MB in the end (delta: -374.2 MB). Peak memory consumption was 560.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 14.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...