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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:07,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:07,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:07,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:07,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:07,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:07,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:07,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:07,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:07,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:07,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:07,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:07,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:07,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:07,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:07,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:07,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:07,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:07,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:07,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:07,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:07,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:07,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:07,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:07,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:07,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:07,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:07,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:07,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:07,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:07,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:07,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:07,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:07,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:07,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:07,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:07,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:07,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:07,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:07,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:07,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:07,105 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,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:07,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:07,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:07,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:07,132 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:07,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:07,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:07,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:07,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:07,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:07,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:07,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:07,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:07,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:07,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:07,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:07,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:07,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:07,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:07,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:07,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:07,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:07,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:07,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:07,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:07,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:07,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:07,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:07,139 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,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:07,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:07,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:07,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:07,437 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:07,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-13 21:05:07,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d41d90f/f8a635c5dba743e0a057e7ddeedfdc33/FLAG9b31e94b7 [2019-10-13 21:05:07,993 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:07,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-13 21:05:08,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d41d90f/f8a635c5dba743e0a057e7ddeedfdc33/FLAG9b31e94b7 [2019-10-13 21:05:08,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d41d90f/f8a635c5dba743e0a057e7ddeedfdc33 [2019-10-13 21:05:08,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:08,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:08,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:08,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:08,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:08,398 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,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2089993a 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,401 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,409 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:08,432 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:08,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:08,623 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:08,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:08,678 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:08,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:08 WrapperNode [2019-10-13 21:05:08,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:08,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:08,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:08,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:08,689 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:08" (1/1) ... [2019-10-13 21:05:08,689 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:08" (1/1) ... [2019-10-13 21:05:08,697 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:08" (1/1) ... [2019-10-13 21:05:08,698 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:08" (1/1) ... [2019-10-13 21:05:08,773 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:08" (1/1) ... [2019-10-13 21:05:08,780 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:08" (1/1) ... [2019-10-13 21:05:08,782 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:08" (1/1) ... [2019-10-13 21:05:08,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:08,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:08,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:08,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:08,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:08" (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:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:09,181 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:09,182 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:09,183 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,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:09,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:09,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:09,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:09,188 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,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9b6b35 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,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:08" (2/3) ... [2019-10-13 21:05:09,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9b6b35 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,190 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,191 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-13 21:05:09,201 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:09,207 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:09,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:09,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:09,242 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:09,242 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:09,242 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:09,242 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:09,243 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:09,243 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:09,243 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-13 21:05:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:09,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:09,269 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] [2019-10-13 21:05:09,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-10-13 21:05:09,282 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:09,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831142320] [2019-10-13 21:05:09,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:09,463 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:09,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831142320] [2019-10-13 21:05:09,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:09,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:09,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889955824] [2019-10-13 21:05:09,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:09,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:09,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:09,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:09,490 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-10-13 21:05:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:09,566 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2019-10-13 21:05:09,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:09,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:09,581 INFO L225 Difference]: With dead ends: 87 [2019-10-13 21:05:09,582 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 21:05:09,585 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:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 21:05:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-10-13 21:05:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 21:05:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-10-13 21:05:09,634 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-10-13 21:05:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-10-13 21:05:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-10-13 21:05:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:09,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:09,637 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] [2019-10-13 21:05:09,638 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-10-13 21:05:09,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:09,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799309566] [2019-10-13 21:05:09,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:09,740 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:09,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799309566] [2019-10-13 21:05:09,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:09,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:09,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391083198] [2019-10-13 21:05:09,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:09,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:09,748 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-10-13 21:05:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:09,775 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2019-10-13 21:05:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:09,778 INFO L225 Difference]: With dead ends: 117 [2019-10-13 21:05:09,778 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 21:05:09,779 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:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 21:05:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-13 21:05:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 21:05:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-10-13 21:05:09,791 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-10-13 21:05:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:09,791 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-10-13 21:05:09,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-10-13 21:05:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:09,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:09,793 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,793 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-10-13 21:05:09,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:09,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520584248] [2019-10-13 21:05:09,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:09,847 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:09,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520584248] [2019-10-13 21:05:09,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:09,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:09,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039319023] [2019-10-13 21:05:09,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:09,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:09,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:09,850 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-10-13 21:05:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:09,873 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2019-10-13 21:05:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:09,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:09,876 INFO L225 Difference]: With dead ends: 108 [2019-10-13 21:05:09,876 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 21:05:09,877 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:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 21:05:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-13 21:05:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 21:05:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-10-13 21:05:09,891 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-10-13 21:05:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:09,891 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-10-13 21:05:09,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-10-13 21:05:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:09,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:09,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] [2019-10-13 21:05:09,896 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-10-13 21:05:09,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:09,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867860303] [2019-10-13 21:05:09,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:09,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:09,975 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:09,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867860303] [2019-10-13 21:05:09,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:09,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:09,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900147222] [2019-10-13 21:05:09,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:09,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:09,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:09,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:09,978 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-10-13 21:05:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,005 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2019-10-13 21:05:10,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,009 INFO L225 Difference]: With dead ends: 136 [2019-10-13 21:05:10,009 INFO L226 Difference]: Without dead ends: 134 [2019-10-13 21:05:10,009 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,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-13 21:05:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-10-13 21:05:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-13 21:05:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-10-13 21:05:10,031 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-10-13 21:05:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,031 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-10-13 21:05:10,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-10-13 21:05:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:10,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,035 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,035 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-10-13 21:05:10,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534589223] [2019-10-13 21:05:10,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,089 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,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534589223] [2019-10-13 21:05:10,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192528255] [2019-10-13 21:05:10,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,092 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-10-13 21:05:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,129 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2019-10-13 21:05:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,135 INFO L225 Difference]: With dead ends: 224 [2019-10-13 21:05:10,135 INFO L226 Difference]: Without dead ends: 136 [2019-10-13 21:05:10,136 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,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-13 21:05:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-10-13 21:05:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-13 21:05:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-10-13 21:05:10,150 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-10-13 21:05:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,150 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-10-13 21:05:10,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-10-13 21:05:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:10,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,152 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,153 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-10-13 21:05:10,153 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208726944] [2019-10-13 21:05:10,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,208 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,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208726944] [2019-10-13 21:05:10,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755812450] [2019-10-13 21:05:10,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,211 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-10-13 21:05:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,227 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2019-10-13 21:05:10,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,232 INFO L225 Difference]: With dead ends: 201 [2019-10-13 21:05:10,232 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 21:05:10,233 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,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 21:05:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-13 21:05:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 21:05:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-10-13 21:05:10,245 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-10-13 21:05:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,246 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-10-13 21:05:10,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-10-13 21:05:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:10,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,248 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,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-10-13 21:05:10,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193759061] [2019-10-13 21:05:10,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,292 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,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193759061] [2019-10-13 21:05:10,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970117135] [2019-10-13 21:05:10,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,295 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-10-13 21:05:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,325 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2019-10-13 21:05:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,327 INFO L225 Difference]: With dead ends: 252 [2019-10-13 21:05:10,327 INFO L226 Difference]: Without dead ends: 250 [2019-10-13 21:05:10,328 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,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-13 21:05:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-10-13 21:05:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-13 21:05:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-10-13 21:05:10,345 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-10-13 21:05:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,345 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-10-13 21:05:10,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-10-13 21:05:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:10,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,348 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,348 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-10-13 21:05:10,349 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430165027] [2019-10-13 21:05:10,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,401 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,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430165027] [2019-10-13 21:05:10,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573257193] [2019-10-13 21:05:10,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,405 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-10-13 21:05:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,442 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2019-10-13 21:05:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,445 INFO L225 Difference]: With dead ends: 432 [2019-10-13 21:05:10,445 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 21:05:10,446 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,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 21:05:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-13 21:05:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-13 21:05:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-10-13 21:05:10,463 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-10-13 21:05:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,464 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-10-13 21:05:10,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-10-13 21:05:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:10,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,466 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,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-10-13 21:05:10,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221761365] [2019-10-13 21:05:10,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,502 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,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221761365] [2019-10-13 21:05:10,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814247306] [2019-10-13 21:05:10,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,505 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-10-13 21:05:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,529 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2019-10-13 21:05:10,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,531 INFO L225 Difference]: With dead ends: 384 [2019-10-13 21:05:10,532 INFO L226 Difference]: Without dead ends: 262 [2019-10-13 21:05:10,533 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,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-13 21:05:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-13 21:05:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 21:05:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-10-13 21:05:10,547 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-10-13 21:05:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,547 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-10-13 21:05:10,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-10-13 21:05:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:10,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,549 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,550 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-10-13 21:05:10,551 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779802310] [2019-10-13 21:05:10,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,576 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,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779802310] [2019-10-13 21:05:10,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216088043] [2019-10-13 21:05:10,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,579 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-10-13 21:05:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,609 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2019-10-13 21:05:10,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,613 INFO L225 Difference]: With dead ends: 476 [2019-10-13 21:05:10,613 INFO L226 Difference]: Without dead ends: 474 [2019-10-13 21:05:10,614 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,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-13 21:05:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-10-13 21:05:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 21:05:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-10-13 21:05:10,629 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-10-13 21:05:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,630 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-10-13 21:05:10,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-10-13 21:05:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:10,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,651 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,651 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-10-13 21:05:10,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105380945] [2019-10-13 21:05:10,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,694 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,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105380945] [2019-10-13 21:05:10,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355091871] [2019-10-13 21:05:10,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,697 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-10-13 21:05:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,729 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2019-10-13 21:05:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,734 INFO L225 Difference]: With dead ends: 844 [2019-10-13 21:05:10,734 INFO L226 Difference]: Without dead ends: 498 [2019-10-13 21:05:10,736 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,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-13 21:05:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-10-13 21:05:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-13 21:05:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-10-13 21:05:10,758 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-10-13 21:05:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,759 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-10-13 21:05:10,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-10-13 21:05:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:10,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,762 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:10,762 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,764 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-10-13 21:05:10,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572608346] [2019-10-13 21:05:10,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,790 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,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572608346] [2019-10-13 21:05:10,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591715751] [2019-10-13 21:05:10,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,793 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-10-13 21:05:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,823 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2019-10-13 21:05:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,828 INFO L225 Difference]: With dead ends: 744 [2019-10-13 21:05:10,828 INFO L226 Difference]: Without dead ends: 506 [2019-10-13 21:05:10,829 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,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-13 21:05:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-10-13 21:05:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-13 21:05:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-10-13 21:05:10,847 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-10-13 21:05:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,847 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-10-13 21:05:10,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-10-13 21:05:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:10,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,849 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:10,850 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-10-13 21:05:10,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258426715] [2019-10-13 21:05:10,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,876 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,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258426715] [2019-10-13 21:05:10,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580165123] [2019-10-13 21:05:10,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,878 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-10-13 21:05:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:10,911 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2019-10-13 21:05:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:10,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:10,920 INFO L225 Difference]: With dead ends: 908 [2019-10-13 21:05:10,920 INFO L226 Difference]: Without dead ends: 906 [2019-10-13 21:05:10,921 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,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-13 21:05:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-10-13 21:05:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-13 21:05:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-10-13 21:05:10,943 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-10-13 21:05:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:10,943 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-10-13 21:05:10,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-10-13 21:05:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:10,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:10,946 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:10,946 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-10-13 21:05:10,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:10,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099560027] [2019-10-13 21:05:10,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:10,979 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,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099560027] [2019-10-13 21:05:10,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:10,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:10,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138347536] [2019-10-13 21:05:10,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:10,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:10,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:10,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:10,981 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-10-13 21:05:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,011 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2019-10-13 21:05:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,017 INFO L225 Difference]: With dead ends: 1660 [2019-10-13 21:05:11,017 INFO L226 Difference]: Without dead ends: 970 [2019-10-13 21:05:11,019 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,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-13 21:05:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-10-13 21:05:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-13 21:05:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-10-13 21:05:11,047 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-10-13 21:05:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,048 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-10-13 21:05:11,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-10-13 21:05:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:11,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,050 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,050 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-10-13 21:05:11,051 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043436182] [2019-10-13 21:05:11,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,079 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,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043436182] [2019-10-13 21:05:11,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293383903] [2019-10-13 21:05:11,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,081 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-10-13 21:05:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,106 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2019-10-13 21:05:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,111 INFO L225 Difference]: With dead ends: 1452 [2019-10-13 21:05:11,111 INFO L226 Difference]: Without dead ends: 986 [2019-10-13 21:05:11,113 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,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-13 21:05:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-10-13 21:05:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-13 21:05:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-10-13 21:05:11,141 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-10-13 21:05:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,142 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-10-13 21:05:11,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-10-13 21:05:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:11,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,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] [2019-10-13 21:05:11,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-10-13 21:05:11,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316838939] [2019-10-13 21:05:11,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:11,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316838939] [2019-10-13 21:05:11,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801117392] [2019-10-13 21:05:11,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,168 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-10-13 21:05:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,204 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2019-10-13 21:05:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,213 INFO L225 Difference]: With dead ends: 1740 [2019-10-13 21:05:11,213 INFO L226 Difference]: Without dead ends: 1738 [2019-10-13 21:05:11,215 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,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-13 21:05:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-10-13 21:05:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-10-13 21:05:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-10-13 21:05:11,258 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-10-13 21:05:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,259 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-10-13 21:05:11,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-10-13 21:05:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:11,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,263 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,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-10-13 21:05:11,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599234068] [2019-10-13 21:05:11,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,288 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,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599234068] [2019-10-13 21:05:11,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105501715] [2019-10-13 21:05:11,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,291 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-10-13 21:05:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,349 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2019-10-13 21:05:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,362 INFO L225 Difference]: With dead ends: 3276 [2019-10-13 21:05:11,363 INFO L226 Difference]: Without dead ends: 1898 [2019-10-13 21:05:11,367 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,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-10-13 21:05:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-10-13 21:05:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-13 21:05:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-10-13 21:05:11,470 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-10-13 21:05:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,471 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-10-13 21:05:11,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-10-13 21:05:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:11,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,474 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,474 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-10-13 21:05:11,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836216142] [2019-10-13 21:05:11,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,511 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,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836216142] [2019-10-13 21:05:11,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907073999] [2019-10-13 21:05:11,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,514 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-10-13 21:05:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,572 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2019-10-13 21:05:11,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,587 INFO L225 Difference]: With dead ends: 2844 [2019-10-13 21:05:11,587 INFO L226 Difference]: Without dead ends: 1930 [2019-10-13 21:05:11,591 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,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-13 21:05:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-10-13 21:05:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-13 21:05:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-10-13 21:05:11,665 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-10-13 21:05:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,666 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-10-13 21:05:11,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-10-13 21:05:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:11,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:11,669 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,669 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-10-13 21:05:11,670 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003689180] [2019-10-13 21:05:11,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:11,690 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,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003689180] [2019-10-13 21:05:11,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:11,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:11,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191754435] [2019-10-13 21:05:11,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:11,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:11,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:11,693 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-10-13 21:05:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,758 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2019-10-13 21:05:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,773 INFO L225 Difference]: With dead ends: 3340 [2019-10-13 21:05:11,774 INFO L226 Difference]: Without dead ends: 3338 [2019-10-13 21:05:11,775 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,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-13 21:05:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-10-13 21:05:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-10-13 21:05:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-10-13 21:05:11,856 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-10-13 21:05:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-10-13 21:05:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 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,861 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,861 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-10-13 21:05:11,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:11,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134814231] [2019-10-13 21:05:11,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:11,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:11,873 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,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134814231] [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 [2099445645] [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,888 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 2824 states and 3910 transitions. Second operand 3 states. [2019-10-13 21:05:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:11,957 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2019-10-13 21:05:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:11,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:11,974 INFO L225 Difference]: With dead ends: 6476 [2019-10-13 21:05:11,974 INFO L226 Difference]: Without dead ends: 3722 [2019-10-13 21:05:11,980 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,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-13 21:05:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-10-13 21:05:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-10-13 21:05:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-10-13 21:05:12,116 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-10-13 21:05:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,116 INFO L462 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-10-13 21:05:12,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-10-13 21:05:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:12,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,121 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,122 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-10-13 21:05:12,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424895891] [2019-10-13 21:05:12,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,155 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,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424895891] [2019-10-13 21:05:12,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51485844] [2019-10-13 21:05:12,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,157 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-10-13 21:05:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,220 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2019-10-13 21:05:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,238 INFO L225 Difference]: With dead ends: 5580 [2019-10-13 21:05:12,238 INFO L226 Difference]: Without dead ends: 3786 [2019-10-13 21:05:12,244 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,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-13 21:05:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-13 21:05:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-13 21:05:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-10-13 21:05:12,354 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-10-13 21:05:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,355 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-10-13 21:05:12,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-10-13 21:05:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:12,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,360 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,360 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-10-13 21:05:12,361 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903660416] [2019-10-13 21:05:12,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,386 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,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903660416] [2019-10-13 21:05:12,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124018305] [2019-10-13 21:05:12,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,389 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-10-13 21:05:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:12,492 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2019-10-13 21:05:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:12,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:12,535 INFO L225 Difference]: With dead ends: 10956 [2019-10-13 21:05:12,536 INFO L226 Difference]: Without dead ends: 7306 [2019-10-13 21:05:12,544 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,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-13 21:05:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-10-13 21:05:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-13 21:05:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-10-13 21:05:12,778 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-10-13 21:05:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:12,779 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-10-13 21:05:12,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-10-13 21:05:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:12,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:12,794 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,795 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-10-13 21:05:12,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:12,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746013040] [2019-10-13 21:05:12,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:12,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:12,825 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,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746013040] [2019-10-13 21:05:12,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:12,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:12,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931794986] [2019-10-13 21:05:12,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:12,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:12,833 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-10-13 21:05:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,059 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2019-10-13 21:05:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,086 INFO L225 Difference]: With dead ends: 8076 [2019-10-13 21:05:13,086 INFO L226 Difference]: Without dead ends: 8074 [2019-10-13 21:05:13,089 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,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-13 21:05:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-10-13 21:05:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-13 21:05:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-10-13 21:05:13,371 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-10-13 21:05:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,371 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-10-13 21:05:13,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-10-13 21:05:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:13,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,386 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,386 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-10-13 21:05:13,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339061083] [2019-10-13 21:05:13,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:13,416 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,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339061083] [2019-10-13 21:05:13,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:13,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:13,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304342732] [2019-10-13 21:05:13,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:13,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:13,420 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-10-13 21:05:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:13,643 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2019-10-13 21:05:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:13,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:13,670 INFO L225 Difference]: With dead ends: 12172 [2019-10-13 21:05:13,671 INFO L226 Difference]: Without dead ends: 12170 [2019-10-13 21:05:13,677 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,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-13 21:05:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-10-13 21:05:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-13 21:05:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-10-13 21:05:13,967 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-10-13 21:05:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:13,967 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-10-13 21:05:13,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-10-13 21:05:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:05:13,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:13,984 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,984 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-10-13 21:05:13,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:13,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830962028] [2019-10-13 21:05:13,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:13,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,004 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,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830962028] [2019-10-13 21:05:14,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52095187] [2019-10-13 21:05:14,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,009 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-10-13 21:05:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,192 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2019-10-13 21:05:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:05:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,218 INFO L225 Difference]: With dead ends: 25228 [2019-10-13 21:05:14,218 INFO L226 Difference]: Without dead ends: 14218 [2019-10-13 21:05:14,239 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,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-10-13 21:05:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-10-13 21:05:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-13 21:05:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-10-13 21:05:14,754 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-10-13 21:05:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:14,755 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-10-13 21:05:14,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-10-13 21:05:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:14,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:14,773 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,773 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-10-13 21:05:14,774 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:14,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446448485] [2019-10-13 21:05:14,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:14,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:14,791 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,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446448485] [2019-10-13 21:05:14,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:14,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:14,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390919054] [2019-10-13 21:05:14,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:14,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:14,794 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-10-13 21:05:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:14,963 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2019-10-13 21:05:14,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:14,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:14,989 INFO L225 Difference]: With dead ends: 21516 [2019-10-13 21:05:14,989 INFO L226 Difference]: Without dead ends: 14602 [2019-10-13 21:05:15,005 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,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-10-13 21:05:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-10-13 21:05:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-10-13 21:05:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-10-13 21:05:15,294 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-10-13 21:05:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:15,294 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-10-13 21:05:15,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-10-13 21:05:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:15,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:15,316 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:15,316 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-10-13 21:05:15,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:15,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185054308] [2019-10-13 21:05:15,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:15,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:15,336 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,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185054308] [2019-10-13 21:05:15,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:15,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:15,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73729144] [2019-10-13 21:05:15,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:15,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:15,338 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-10-13 21:05:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:15,704 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2019-10-13 21:05:15,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:15,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:15,747 INFO L225 Difference]: With dead ends: 23562 [2019-10-13 21:05:15,747 INFO L226 Difference]: Without dead ends: 23560 [2019-10-13 21:05:15,755 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,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-10-13 21:05:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-10-13 21:05:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-10-13 21:05:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-10-13 21:05:16,130 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-10-13 21:05:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:16,131 INFO L462 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-10-13 21:05:16,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-10-13 21:05:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:05:16,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:16,173 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:16,173 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-10-13 21:05:16,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:16,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853974498] [2019-10-13 21:05:16,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:16,193 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,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853974498] [2019-10-13 21:05:16,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:16,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:16,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397073363] [2019-10-13 21:05:16,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:16,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:16,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:16,196 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-10-13 21:05:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:16,999 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2019-10-13 21:05:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:16,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 21:05:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,000 INFO L225 Difference]: With dead ends: 50184 [2019-10-13 21:05:17,000 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:17,090 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:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:17,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-13 21:05:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,092 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:17,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:17,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:17,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:17,128 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:17,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:17,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:17,129 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:17,129 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:17,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:17,130 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-13 21:05:17,130 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-10-13 21:05:17,130 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,130 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,130 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,132 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,132 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-13 21:05:17,133 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,133 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-13 21:05:17,133 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,133 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,133 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,134 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-13 21:05:17,134 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-10-13 21:05:17,134 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-13 21:05:17,134 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-10-13 21:05:17,134 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-13 21:05:17,134 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-13 21:05:17,135 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,135 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,135 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-13 21:05:17,135 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-13 21:05:17,135 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,135 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,136 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,136 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,136 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,136 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-13 21:05:17,136 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,136 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-13 21:05:17,137 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,137 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-13 21:05:17,137 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-13 21:05:17,137 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-13 21:05:17,137 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,138 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-13 21:05:17,138 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 21:05:17,138 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-13 21:05:17,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:17 BoogieIcfgContainer [2019-10-13 21:05:17,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:17,165 INFO L168 Benchmark]: Toolchain (without parser) took 8767.10 ms. Allocated memory was 138.9 MB in the beginning and 602.9 MB in the end (delta: 464.0 MB). Free memory was 103.4 MB in the beginning and 395.8 MB in the end (delta: -292.4 MB). Peak memory consumption was 171.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:17,171 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 21:05:17,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.24 ms. Allocated memory was 138.9 MB in the beginning and 167.8 MB in the end (delta: 28.8 MB). Free memory was 103.2 MB in the beginning and 145.3 MB in the end (delta: -42.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:17,175 INFO L168 Benchmark]: Boogie Preprocessor took 106.02 ms. Allocated memory was 167.8 MB in the beginning and 223.3 MB in the end (delta: 55.6 MB). Free memory was 145.3 MB in the beginning and 208.8 MB in the end (delta: -63.5 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:17,175 INFO L168 Benchmark]: RCFGBuilder took 398.38 ms. Allocated memory is still 223.3 MB. Free memory was 208.8 MB in the beginning and 189.3 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:17,178 INFO L168 Benchmark]: TraceAbstraction took 7973.21 ms. Allocated memory was 223.3 MB in the beginning and 602.9 MB in the end (delta: 379.6 MB). Free memory was 189.3 MB in the beginning and 395.8 MB in the end (delta: -206.5 MB). Peak memory consumption was 173.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:17,184 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.24 ms. Allocated memory was 138.9 MB in the beginning and 167.8 MB in the end (delta: 28.8 MB). Free memory was 103.2 MB in the beginning and 145.3 MB in the end (delta: -42.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.02 ms. Allocated memory was 167.8 MB in the beginning and 223.3 MB in the end (delta: 55.6 MB). Free memory was 145.3 MB in the beginning and 208.8 MB in the end (delta: -63.5 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.38 ms. Allocated memory is still 223.3 MB. Free memory was 208.8 MB in the beginning and 189.3 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7973.21 ms. Allocated memory was 223.3 MB in the beginning and 602.9 MB in the end (delta: 379.6 MB). Free memory was 189.3 MB in the beginning and 395.8 MB in the end (delta: -206.5 MB). Peak memory consumption was 173.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. Result: SAFE, OverallTime: 7.8s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...