/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:32:27,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:32:27,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:32:27,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:32:27,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:32:27,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:32:27,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:32:27,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:32:27,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:32:27,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:32:27,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:32:27,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:32:27,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:32:27,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:32:27,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:32:27,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:32:27,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:32:27,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:32:27,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:32:27,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:32:27,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:32:27,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:32:27,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:32:27,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:32:27,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:32:27,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:32:27,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:32:27,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:32:27,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:32:27,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:32:27,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:32:27,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:32:27,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:32:27,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:32:27,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:32:27,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:32:27,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:32:27,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:32:27,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:32:27,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:32:27,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:32:27,704 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-11-07 00:32:27,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:32:27,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:32:27,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:32:27,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:32:27,719 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:32:27,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:32:27,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:32:27,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:32:27,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:32:27,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:32:27,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:32:27,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:32:27,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:32:27,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:32:27,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:32:27,721 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:32:27,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:32:27,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:32:27,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:32:27,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:32:27,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:32:27,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:27,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:32:27,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:32:27,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:32:27,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:32:27,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:32:27,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:32:27,724 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-11-07 00:32:28,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:32:28,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:32:28,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:32:28,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:32:28,033 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:32:28,034 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-11-07 00:32:28,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2d25d56/db3c548139ec49279cf2ea551ff2d6e4/FLAGfffde085e [2019-11-07 00:32:28,577 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:32:28,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-11-07 00:32:28,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2d25d56/db3c548139ec49279cf2ea551ff2d6e4/FLAGfffde085e [2019-11-07 00:32:28,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2d25d56/db3c548139ec49279cf2ea551ff2d6e4 [2019-11-07 00:32:28,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:32:28,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:32:28,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:28,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:32:28,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:32:28,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:28" (1/1) ... [2019-11-07 00:32:28,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d1ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:28, skipping insertion in model container [2019-11-07 00:32:28,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:28" (1/1) ... [2019-11-07 00:32:28,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:32:28,994 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:32:29,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:29,199 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:32:29,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:29,322 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:32:29,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29 WrapperNode [2019-11-07 00:32:29,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:29,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:32:29,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:32:29,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:32:29,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... [2019-11-07 00:32:29,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:32:29,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:32:29,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:32:29,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:32:29,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:32:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:32:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:32:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:32:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:32:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:32:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:32:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:32:29,761 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:32:29,761 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:32:29,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:29 BoogieIcfgContainer [2019-11-07 00:32:29,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:32:29,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:32:29,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:32:29,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:32:29,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:28" (1/3) ... [2019-11-07 00:32:29,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b08ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:29, skipping insertion in model container [2019-11-07 00:32:29,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:29" (2/3) ... [2019-11-07 00:32:29,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b08ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:29, skipping insertion in model container [2019-11-07 00:32:29,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:29" (3/3) ... [2019-11-07 00:32:29,789 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-07 00:32:29,812 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:32:29,825 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:32:29,834 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:32:29,860 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:32:29,860 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:32:29,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:32:29,861 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:32:29,861 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:32:29,863 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:32:29,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:32:29,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:32:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-07 00:32:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:32:29,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:29,889 INFO L410 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-11-07 00:32:29,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-11-07 00:32:29,904 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:29,904 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791048342] [2019-11-07 00:32:29,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,100 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791048342] [2019-11-07 00:32:30,101 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,101 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565606272] [2019-11-07 00:32:30,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,109 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,128 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-11-07 00:32:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:30,218 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2019-11-07 00:32:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:30,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 00:32:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:30,233 INFO L225 Difference]: With dead ends: 99 [2019-11-07 00:32:30,233 INFO L226 Difference]: Without dead ends: 84 [2019-11-07 00:32:30,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-07 00:32:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-11-07 00:32:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-07 00:32:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-11-07 00:32:30,294 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-11-07 00:32:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:30,295 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-11-07 00:32:30,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-11-07 00:32:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:32:30,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:30,297 INFO L410 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-11-07 00:32:30,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-11-07 00:32:30,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:30,298 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268269170] [2019-11-07 00:32:30,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,387 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268269170] [2019-11-07 00:32:30,388 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,388 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495118816] [2019-11-07 00:32:30,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,394 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-11-07 00:32:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:30,431 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2019-11-07 00:32:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:30,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 00:32:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:30,434 INFO L225 Difference]: With dead ends: 137 [2019-11-07 00:32:30,434 INFO L226 Difference]: Without dead ends: 84 [2019-11-07 00:32:30,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-07 00:32:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-07 00:32:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-07 00:32:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-11-07 00:32:30,454 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-11-07 00:32:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:30,455 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-11-07 00:32:30,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-11-07 00:32:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:32:30,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:30,457 INFO L410 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-11-07 00:32:30,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-11-07 00:32:30,458 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:30,458 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755821641] [2019-11-07 00:32:30,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,515 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755821641] [2019-11-07 00:32:30,516 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,516 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49562040] [2019-11-07 00:32:30,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,518 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,519 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-11-07 00:32:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:30,564 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2019-11-07 00:32:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:30,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 00:32:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:30,566 INFO L225 Difference]: With dead ends: 126 [2019-11-07 00:32:30,566 INFO L226 Difference]: Without dead ends: 87 [2019-11-07 00:32:30,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-07 00:32:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-11-07 00:32:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-07 00:32:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-11-07 00:32:30,580 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-11-07 00:32:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:30,581 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-11-07 00:32:30,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-11-07 00:32:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:32:30,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:30,582 INFO L410 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-11-07 00:32:30,582 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-11-07 00:32:30,583 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:30,583 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680627397] [2019-11-07 00:32:30,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,631 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680627397] [2019-11-07 00:32:30,632 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,632 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623607046] [2019-11-07 00:32:30,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,633 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,634 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-11-07 00:32:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:30,674 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2019-11-07 00:32:30,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:30,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 00:32:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:30,679 INFO L225 Difference]: With dead ends: 160 [2019-11-07 00:32:30,679 INFO L226 Difference]: Without dead ends: 158 [2019-11-07 00:32:30,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-07 00:32:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-11-07 00:32:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-07 00:32:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-11-07 00:32:30,701 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-11-07 00:32:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:30,701 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-11-07 00:32:30,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-11-07 00:32:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:32:30,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:30,703 INFO L410 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-11-07 00:32:30,703 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-11-07 00:32:30,704 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:30,704 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059251785] [2019-11-07 00:32:30,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,763 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059251785] [2019-11-07 00:32:30,763 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,763 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765577866] [2019-11-07 00:32:30,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,764 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,765 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-11-07 00:32:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:30,785 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2019-11-07 00:32:30,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:30,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 00:32:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:30,787 INFO L225 Difference]: With dead ends: 264 [2019-11-07 00:32:30,788 INFO L226 Difference]: Without dead ends: 160 [2019-11-07 00:32:30,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-07 00:32:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-07 00:32:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-07 00:32:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-11-07 00:32:30,804 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-11-07 00:32:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:30,804 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-11-07 00:32:30,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-11-07 00:32:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:32:30,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:30,806 INFO L410 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-11-07 00:32:30,806 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:30,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-11-07 00:32:30,807 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:30,807 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695929401] [2019-11-07 00:32:30,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695929401] [2019-11-07 00:32:30,883 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,883 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685068685] [2019-11-07 00:32:30,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,885 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,886 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-11-07 00:32:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:30,912 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2019-11-07 00:32:30,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:30,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 00:32:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:30,915 INFO L225 Difference]: With dead ends: 237 [2019-11-07 00:32:30,915 INFO L226 Difference]: Without dead ends: 162 [2019-11-07 00:32:30,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-07 00:32:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-11-07 00:32:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-07 00:32:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-11-07 00:32:30,935 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-11-07 00:32:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:30,935 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-11-07 00:32:30,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-11-07 00:32:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:32:30,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:30,940 INFO L410 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-11-07 00:32:30,940 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:30,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:30,940 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-11-07 00:32:30,941 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:30,941 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675302478] [2019-11-07 00:32:30,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:30,995 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675302478] [2019-11-07 00:32:30,996 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:30,996 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:30,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157790369] [2019-11-07 00:32:30,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:30,997 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:30,998 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-11-07 00:32:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,023 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2019-11-07 00:32:31,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 00:32:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,026 INFO L225 Difference]: With dead ends: 300 [2019-11-07 00:32:31,027 INFO L226 Difference]: Without dead ends: 298 [2019-11-07 00:32:31,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-07 00:32:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-11-07 00:32:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-07 00:32:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-07 00:32:31,049 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-11-07 00:32:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,050 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-07 00:32:31,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-07 00:32:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:32:31,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,057 INFO L410 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-11-07 00:32:31,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-11-07 00:32:31,058 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,059 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712273677] [2019-11-07 00:32:31,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712273677] [2019-11-07 00:32:31,122 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,122 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252138776] [2019-11-07 00:32:31,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,123 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,124 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-11-07 00:32:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,150 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2019-11-07 00:32:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 00:32:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,153 INFO L225 Difference]: With dead ends: 512 [2019-11-07 00:32:31,153 INFO L226 Difference]: Without dead ends: 306 [2019-11-07 00:32:31,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-07 00:32:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-11-07 00:32:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-07 00:32:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-11-07 00:32:31,178 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-11-07 00:32:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,178 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-11-07 00:32:31,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-11-07 00:32:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:32:31,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,185 INFO L410 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-11-07 00:32:31,186 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-11-07 00:32:31,186 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,186 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057057196] [2019-11-07 00:32:31,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,225 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057057196] [2019-11-07 00:32:31,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,225 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002616449] [2019-11-07 00:32:31,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,227 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,228 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-11-07 00:32:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,254 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2019-11-07 00:32:31,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:32:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,258 INFO L225 Difference]: With dead ends: 456 [2019-11-07 00:32:31,258 INFO L226 Difference]: Without dead ends: 310 [2019-11-07 00:32:31,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-07 00:32:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-11-07 00:32:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-07 00:32:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-11-07 00:32:31,279 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-11-07 00:32:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,279 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-11-07 00:32:31,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-11-07 00:32:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:32:31,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,281 INFO L410 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-11-07 00:32:31,282 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,282 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-11-07 00:32:31,282 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504767079] [2019-11-07 00:32:31,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,343 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504767079] [2019-11-07 00:32:31,343 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,343 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956986242] [2019-11-07 00:32:31,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,347 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,348 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-11-07 00:32:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,385 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2019-11-07 00:32:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:32:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,391 INFO L225 Difference]: With dead ends: 572 [2019-11-07 00:32:31,391 INFO L226 Difference]: Without dead ends: 570 [2019-11-07 00:32:31,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-07 00:32:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-11-07 00:32:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-07 00:32:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-11-07 00:32:31,415 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-11-07 00:32:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,418 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-11-07 00:32:31,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-11-07 00:32:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:32:31,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,423 INFO L410 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-11-07 00:32:31,423 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-11-07 00:32:31,424 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,424 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679019022] [2019-11-07 00:32:31,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,459 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679019022] [2019-11-07 00:32:31,462 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20580426] [2019-11-07 00:32:31,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,463 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,467 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-11-07 00:32:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,503 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2019-11-07 00:32:31,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:32:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,508 INFO L225 Difference]: With dead ends: 1004 [2019-11-07 00:32:31,510 INFO L226 Difference]: Without dead ends: 594 [2019-11-07 00:32:31,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-07 00:32:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-11-07 00:32:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:32:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-11-07 00:32:31,536 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-11-07 00:32:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,537 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-11-07 00:32:31,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-11-07 00:32:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:32:31,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,538 INFO L410 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-11-07 00:32:31,539 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-11-07 00:32:31,539 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,539 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394714575] [2019-11-07 00:32:31,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,581 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394714575] [2019-11-07 00:32:31,581 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,581 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357856319] [2019-11-07 00:32:31,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,583 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,583 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-11-07 00:32:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,608 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2019-11-07 00:32:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 00:32:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,613 INFO L225 Difference]: With dead ends: 888 [2019-11-07 00:32:31,613 INFO L226 Difference]: Without dead ends: 602 [2019-11-07 00:32:31,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-07 00:32:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-11-07 00:32:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-07 00:32:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-11-07 00:32:31,633 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-11-07 00:32:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,633 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-11-07 00:32:31,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-11-07 00:32:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:32:31,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,635 INFO L410 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-11-07 00:32:31,636 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-11-07 00:32:31,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,636 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958528080] [2019-11-07 00:32:31,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,666 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958528080] [2019-11-07 00:32:31,667 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,667 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937044328] [2019-11-07 00:32:31,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,668 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,668 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-11-07 00:32:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,699 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2019-11-07 00:32:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 00:32:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,706 INFO L225 Difference]: With dead ends: 1100 [2019-11-07 00:32:31,706 INFO L226 Difference]: Without dead ends: 1098 [2019-11-07 00:32:31,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-11-07 00:32:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-11-07 00:32:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-07 00:32:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-11-07 00:32:31,737 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-11-07 00:32:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,738 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-11-07 00:32:31,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-11-07 00:32:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:32:31,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,741 INFO L410 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-11-07 00:32:31,741 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-11-07 00:32:31,742 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,743 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603865333] [2019-11-07 00:32:31,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,782 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603865333] [2019-11-07 00:32:31,783 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,783 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605478896] [2019-11-07 00:32:31,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,784 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,785 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-11-07 00:32:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,823 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2019-11-07 00:32:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 00:32:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,830 INFO L225 Difference]: With dead ends: 1980 [2019-11-07 00:32:31,830 INFO L226 Difference]: Without dead ends: 1162 [2019-11-07 00:32:31,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-07 00:32:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-11-07 00:32:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-11-07 00:32:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-11-07 00:32:31,874 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-11-07 00:32:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,875 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-11-07 00:32:31,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-11-07 00:32:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:32:31,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,877 INFO L410 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-11-07 00:32:31,878 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-11-07 00:32:31,879 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,879 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142893633] [2019-11-07 00:32:31,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:31,905 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142893633] [2019-11-07 00:32:31,905 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:31,905 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:31,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553109901] [2019-11-07 00:32:31,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:31,906 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,907 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-11-07 00:32:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:31,953 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2019-11-07 00:32:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:31,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 00:32:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:31,959 INFO L225 Difference]: With dead ends: 1740 [2019-11-07 00:32:31,960 INFO L226 Difference]: Without dead ends: 1178 [2019-11-07 00:32:31,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-07 00:32:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-11-07 00:32:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-11-07 00:32:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-11-07 00:32:31,994 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-11-07 00:32:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:31,995 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-11-07 00:32:31,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-11-07 00:32:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:32:31,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:31,997 INFO L410 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-11-07 00:32:31,997 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-11-07 00:32:31,998 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:31,998 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036427117] [2019-11-07 00:32:31,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,019 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036427117] [2019-11-07 00:32:32,019 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,019 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291000039] [2019-11-07 00:32:32,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,022 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,022 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-11-07 00:32:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,060 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2019-11-07 00:32:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 00:32:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,076 INFO L225 Difference]: With dead ends: 2124 [2019-11-07 00:32:32,076 INFO L226 Difference]: Without dead ends: 2122 [2019-11-07 00:32:32,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-11-07 00:32:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-11-07 00:32:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-07 00:32:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-11-07 00:32:32,135 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-11-07 00:32:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-11-07 00:32:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-11-07 00:32:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:32:32,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,139 INFO L410 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-11-07 00:32:32,139 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-11-07 00:32:32,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049065794] [2019-11-07 00:32:32,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,164 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049065794] [2019-11-07 00:32:32,164 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,164 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743688677] [2019-11-07 00:32:32,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,165 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,167 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-11-07 00:32:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,223 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2019-11-07 00:32:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 00:32:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,237 INFO L225 Difference]: With dead ends: 3916 [2019-11-07 00:32:32,237 INFO L226 Difference]: Without dead ends: 2282 [2019-11-07 00:32:32,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-11-07 00:32:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-11-07 00:32:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-11-07 00:32:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-11-07 00:32:32,309 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-11-07 00:32:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,309 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-11-07 00:32:32,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-11-07 00:32:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:32:32,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,313 INFO L410 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-11-07 00:32:32,313 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-11-07 00:32:32,314 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,314 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125947689] [2019-11-07 00:32:32,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,333 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125947689] [2019-11-07 00:32:32,333 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466239467] [2019-11-07 00:32:32,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,334 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,335 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-11-07 00:32:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,386 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2019-11-07 00:32:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:32:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,398 INFO L225 Difference]: With dead ends: 3420 [2019-11-07 00:32:32,398 INFO L226 Difference]: Without dead ends: 2314 [2019-11-07 00:32:32,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-11-07 00:32:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-11-07 00:32:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-07 00:32:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-11-07 00:32:32,473 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-11-07 00:32:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,473 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-11-07 00:32:32,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-11-07 00:32:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:32:32,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,477 INFO L410 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-11-07 00:32:32,477 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-11-07 00:32:32,478 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,478 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172652307] [2019-11-07 00:32:32,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,504 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172652307] [2019-11-07 00:32:32,505 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,505 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115412279] [2019-11-07 00:32:32,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,505 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,506 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-11-07 00:32:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,578 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2019-11-07 00:32:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:32:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,603 INFO L225 Difference]: With dead ends: 4108 [2019-11-07 00:32:32,603 INFO L226 Difference]: Without dead ends: 4106 [2019-11-07 00:32:32,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-11-07 00:32:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-11-07 00:32:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-11-07 00:32:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-11-07 00:32:32,728 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-11-07 00:32:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:32,728 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-11-07 00:32:32,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-11-07 00:32:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:32:32,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:32,735 INFO L410 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-11-07 00:32:32,735 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-11-07 00:32:32,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:32,737 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842727643] [2019-11-07 00:32:32,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:32,757 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842727643] [2019-11-07 00:32:32,758 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:32,758 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:32,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568342772] [2019-11-07 00:32:32,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:32,759 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,760 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-11-07 00:32:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:32,856 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2019-11-07 00:32:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:32,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:32:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:32,882 INFO L225 Difference]: With dead ends: 7756 [2019-11-07 00:32:32,882 INFO L226 Difference]: Without dead ends: 4490 [2019-11-07 00:32:32,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-11-07 00:32:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-11-07 00:32:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-11-07 00:32:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-11-07 00:32:33,010 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-11-07 00:32:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,010 INFO L462 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-11-07 00:32:33,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-11-07 00:32:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:32:33,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,017 INFO L410 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-11-07 00:32:33,018 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-11-07 00:32:33,018 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,019 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632369767] [2019-11-07 00:32:33,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,036 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632369767] [2019-11-07 00:32:33,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854758995] [2019-11-07 00:32:33,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,037 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,037 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-11-07 00:32:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,130 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2019-11-07 00:32:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:32:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,151 INFO L225 Difference]: With dead ends: 6732 [2019-11-07 00:32:33,151 INFO L226 Difference]: Without dead ends: 4554 [2019-11-07 00:32:33,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-11-07 00:32:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-11-07 00:32:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-11-07 00:32:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-11-07 00:32:33,293 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-11-07 00:32:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,293 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-11-07 00:32:33,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-11-07 00:32:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:32:33,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,299 INFO L410 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-11-07 00:32:33,299 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-11-07 00:32:33,300 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,300 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283411680] [2019-11-07 00:32:33,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,320 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283411680] [2019-11-07 00:32:33,321 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,321 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093748312] [2019-11-07 00:32:33,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,322 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,322 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-11-07 00:32:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:33,445 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2019-11-07 00:32:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:33,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:32:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:33,467 INFO L225 Difference]: With dead ends: 13260 [2019-11-07 00:32:33,467 INFO L226 Difference]: Without dead ends: 8842 [2019-11-07 00:32:33,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-11-07 00:32:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-11-07 00:32:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-11-07 00:32:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-11-07 00:32:33,847 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-11-07 00:32:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:33,847 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-11-07 00:32:33,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-11-07 00:32:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:32:33,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:33,858 INFO L410 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-11-07 00:32:33,858 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-11-07 00:32:33,859 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:33,859 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505300833] [2019-11-07 00:32:33,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:33,877 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505300833] [2019-11-07 00:32:33,877 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:33,878 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:33,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095894082] [2019-11-07 00:32:33,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:33,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:33,879 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-11-07 00:32:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,023 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2019-11-07 00:32:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:32:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,046 INFO L225 Difference]: With dead ends: 10124 [2019-11-07 00:32:34,047 INFO L226 Difference]: Without dead ends: 10122 [2019-11-07 00:32:34,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-11-07 00:32:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-11-07 00:32:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-11-07 00:32:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-11-07 00:32:34,320 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-11-07 00:32:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:34,321 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-11-07 00:32:34,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-11-07 00:32:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:32:34,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:34,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:34,334 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-11-07 00:32:34,335 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:34,335 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380899996] [2019-11-07 00:32:34,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:34,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380899996] [2019-11-07 00:32:34,454 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:34,454 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:34,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465454146] [2019-11-07 00:32:34,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:34,455 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,456 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-11-07 00:32:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:34,649 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2019-11-07 00:32:34,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:34,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 00:32:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:34,682 INFO L225 Difference]: With dead ends: 15244 [2019-11-07 00:32:34,683 INFO L226 Difference]: Without dead ends: 15242 [2019-11-07 00:32:34,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-11-07 00:32:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-11-07 00:32:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-11-07 00:32:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-11-07 00:32:34,982 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-11-07 00:32:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:34,983 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-11-07 00:32:34,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-11-07 00:32:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:32:35,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:35,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:35,003 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-11-07 00:32:35,004 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:35,004 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330861639] [2019-11-07 00:32:35,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:35,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330861639] [2019-11-07 00:32:35,028 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:35,029 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:35,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821840405] [2019-11-07 00:32:35,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:35,031 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:35,032 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-11-07 00:32:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:35,354 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2019-11-07 00:32:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:35,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 00:32:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:35,387 INFO L225 Difference]: With dead ends: 30348 [2019-11-07 00:32:35,387 INFO L226 Difference]: Without dead ends: 17290 [2019-11-07 00:32:35,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-11-07 00:32:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-11-07 00:32:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-11-07 00:32:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-11-07 00:32:36,344 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-11-07 00:32:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:36,345 INFO L462 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-11-07 00:32:36,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-11-07 00:32:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:32:36,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:36,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:36,365 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-11-07 00:32:36,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:36,365 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418109596] [2019-11-07 00:32:36,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:36,382 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418109596] [2019-11-07 00:32:36,382 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:36,382 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:36,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788160919] [2019-11-07 00:32:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:36,384 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:36,385 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-11-07 00:32:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:36,567 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2019-11-07 00:32:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:36,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:32:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:36,599 INFO L225 Difference]: With dead ends: 26124 [2019-11-07 00:32:36,599 INFO L226 Difference]: Without dead ends: 17674 [2019-11-07 00:32:36,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-11-07 00:32:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-11-07 00:32:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-11-07 00:32:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-11-07 00:32:36,954 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-11-07 00:32:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:36,954 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-11-07 00:32:36,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-11-07 00:32:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:32:36,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:36,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:36,977 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:36,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-11-07 00:32:36,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:36,978 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939287874] [2019-11-07 00:32:36,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:36,997 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939287874] [2019-11-07 00:32:36,998 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:36,998 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:36,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369247198] [2019-11-07 00:32:36,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:36,999 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:36,999 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-11-07 00:32:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:37,337 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2019-11-07 00:32:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:37,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:32:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:37,396 INFO L225 Difference]: With dead ends: 29708 [2019-11-07 00:32:37,396 INFO L226 Difference]: Without dead ends: 29706 [2019-11-07 00:32:37,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-11-07 00:32:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-11-07 00:32:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-11-07 00:32:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-11-07 00:32:38,215 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-11-07 00:32:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:38,215 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-11-07 00:32:38,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-11-07 00:32:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:32:38,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:38,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:38,254 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-11-07 00:32:38,255 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:38,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502820458] [2019-11-07 00:32:38,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:38,274 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502820458] [2019-11-07 00:32:38,274 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:38,274 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:38,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206557108] [2019-11-07 00:32:38,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:38,274 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:38,275 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-11-07 00:32:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:38,608 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2019-11-07 00:32:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:38,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:32:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:38,678 INFO L225 Difference]: With dead ends: 60428 [2019-11-07 00:32:38,679 INFO L226 Difference]: Without dead ends: 34314 [2019-11-07 00:32:38,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-11-07 00:32:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-11-07 00:32:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-11-07 00:32:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-11-07 00:32:40,148 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-11-07 00:32:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:40,149 INFO L462 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-11-07 00:32:40,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-11-07 00:32:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 00:32:40,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:40,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:40,186 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-11-07 00:32:40,186 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:40,186 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458598399] [2019-11-07 00:32:40,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:40,203 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458598399] [2019-11-07 00:32:40,204 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:40,204 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:40,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775447320] [2019-11-07 00:32:40,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:40,205 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:40,205 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-11-07 00:32:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:40,526 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2019-11-07 00:32:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:40,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 00:32:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:40,573 INFO L225 Difference]: With dead ends: 51468 [2019-11-07 00:32:40,573 INFO L226 Difference]: Without dead ends: 34826 [2019-11-07 00:32:40,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-11-07 00:32:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-11-07 00:32:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-11-07 00:32:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-11-07 00:32:41,349 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-11-07 00:32:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:41,349 INFO L462 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-11-07 00:32:41,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-11-07 00:32:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 00:32:41,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:41,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:41,373 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-11-07 00:32:41,374 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:41,374 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577254078] [2019-11-07 00:32:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:41,395 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577254078] [2019-11-07 00:32:41,395 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:41,396 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:41,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290787987] [2019-11-07 00:32:41,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:41,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:41,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:41,397 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-11-07 00:32:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:42,054 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2019-11-07 00:32:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:42,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 00:32:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:42,112 INFO L225 Difference]: With dead ends: 57356 [2019-11-07 00:32:42,112 INFO L226 Difference]: Without dead ends: 57354 [2019-11-07 00:32:42,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-11-07 00:32:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-11-07 00:32:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-11-07 00:32:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-11-07 00:32:42,866 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-11-07 00:32:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:42,866 INFO L462 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-11-07 00:32:42,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-11-07 00:32:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 00:32:42,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:42,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:42,904 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-11-07 00:32:42,905 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:42,905 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54896723] [2019-11-07 00:32:42,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:42,921 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54896723] [2019-11-07 00:32:42,922 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:42,922 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:42,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515339702] [2019-11-07 00:32:42,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:42,923 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:42,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:42,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:42,923 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-11-07 00:32:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:43,686 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2019-11-07 00:32:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:43,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 00:32:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:43,744 INFO L225 Difference]: With dead ends: 119820 [2019-11-07 00:32:43,745 INFO L226 Difference]: Without dead ends: 67594 [2019-11-07 00:32:43,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-11-07 00:32:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-11-07 00:32:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-11-07 00:32:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-11-07 00:32:45,910 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-11-07 00:32:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,911 INFO L462 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-11-07 00:32:45,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-11-07 00:32:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:32:45,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,951 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,951 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-11-07 00:32:45,951 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,951 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810490644] [2019-11-07 00:32:45,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810490644] [2019-11-07 00:32:45,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597089725] [2019-11-07 00:32:45,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,970 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-11-07 00:32:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,435 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2019-11-07 00:32:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 00:32:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,515 INFO L225 Difference]: With dead ends: 101388 [2019-11-07 00:32:46,515 INFO L226 Difference]: Without dead ends: 68618 [2019-11-07 00:32:46,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-11-07 00:32:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-11-07 00:32:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-11-07 00:32:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-11-07 00:32:47,647 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-11-07 00:32:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,647 INFO L462 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-11-07 00:32:47,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-11-07 00:32:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:32:47,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,674 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-11-07 00:32:47,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,674 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566260293] [2019-11-07 00:32:47,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,693 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566260293] [2019-11-07 00:32:47,693 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,693 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590789300] [2019-11-07 00:32:47,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,694 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,694 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-11-07 00:32:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,720 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2019-11-07 00:32:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 00:32:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,812 INFO L225 Difference]: With dead ends: 110602 [2019-11-07 00:32:48,812 INFO L226 Difference]: Without dead ends: 110600 [2019-11-07 00:32:48,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-11-07 00:32:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-11-07 00:32:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-11-07 00:32:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-11-07 00:32:51,300 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-11-07 00:32:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:51,300 INFO L462 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-11-07 00:32:51,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-11-07 00:32:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:32:51,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:51,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:51,354 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-11-07 00:32:51,355 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:51,355 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628706171] [2019-11-07 00:32:51,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:51,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628706171] [2019-11-07 00:32:51,380 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:51,380 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:51,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404229308] [2019-11-07 00:32:51,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:51,381 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:51,382 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-11-07 00:32:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:52,772 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2019-11-07 00:32:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:52,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 00:32:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:52,773 INFO L225 Difference]: With dead ends: 237576 [2019-11-07 00:32:52,773 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:32:52,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:32:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:32:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:32:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:32:52,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-07 00:32:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:52,892 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:32:52,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:32:52,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:32:52,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:32:52,930 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:32:52,930 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:52,930 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:52,930 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:32:52,930 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:32:52,930 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:32:52,930 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,931 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,932 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-11-07 00:32:52,932 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-07 00:32:52,932 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,932 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-07 00:32:52,932 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,932 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-11-07 00:32:52,932 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-07 00:32:52,932 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-07 00:32:52,933 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,934 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-07 00:32:52,935 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-07 00:32:52,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:32:52 BoogieIcfgContainer [2019-11-07 00:32:52,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:32:52,947 INFO L168 Benchmark]: Toolchain (without parser) took 23991.49 ms. Allocated memory was 137.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 102.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 611.5 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:52,947 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:32:52,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.84 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 181.1 MB in the end (delta: -78.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:52,948 INFO L168 Benchmark]: Boogie Preprocessor took 35.62 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 178.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:52,949 INFO L168 Benchmark]: RCFGBuilder took 406.57 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 158.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:52,949 INFO L168 Benchmark]: TraceAbstraction took 23177.55 ms. Allocated memory was 201.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 157.4 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 602.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:52,952 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 366.84 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 181.1 MB in the end (delta: -78.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.62 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 178.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.57 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 158.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23177.55 ms. Allocated memory was 201.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 157.4 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 602.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. Result: SAFE, OverallTime: 23.0s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...