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/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:34,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:34,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:34,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:34,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:34,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:34,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:34,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:34,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:34,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:34,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:34,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:34,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:34,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:34,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:34,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:34,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:34,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:34,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:34,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:34,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:34,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:34,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:34,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:34,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:34,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:34,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:34,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:34,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:34,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:34,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:34,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:34,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:34,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:34,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:34,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:34,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:34,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:34,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:34,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:34,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:34,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:22:34,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:34,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:34,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:34,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:34,813 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:34,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:34,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:34,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:34,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:34,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:34,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:34,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:34,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:34,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:34,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:34,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:34,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:34,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:34,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:34,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:34,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:34,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:34,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:34,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:34,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:34,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:34,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:34,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:34,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:35,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:35,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:35,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:35,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:35,106 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:35,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:35,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b93c04ab/376757df9f4a42b684cf25883c3df928/FLAGb3116a0a3 [2019-10-15 01:22:35,650 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:35,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:35,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b93c04ab/376757df9f4a42b684cf25883c3df928/FLAGb3116a0a3 [2019-10-15 01:22:35,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b93c04ab/376757df9f4a42b684cf25883c3df928 [2019-10-15 01:22:36,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:36,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:36,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:36,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:36,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:36,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:35" (1/1) ... [2019-10-15 01:22:36,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421c3edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36, skipping insertion in model container [2019-10-15 01:22:36,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:35" (1/1) ... [2019-10-15 01:22:36,019 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:36,065 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:36,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:36,587 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:36,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:36,736 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:36,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36 WrapperNode [2019-10-15 01:22:36,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:36,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:36,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:36,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:36,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... [2019-10-15 01:22:36,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:36,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:36,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:36,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:36,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:36,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:36,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:36,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:36,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:36,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:36,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:36,895 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:36,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:36,895 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:36,896 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:36,896 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:36,896 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:36,897 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:38,182 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:38,183 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:38,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:38 BoogieIcfgContainer [2019-10-15 01:22:38,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:38,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:38,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:38,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:38,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:35" (1/3) ... [2019-10-15 01:22:38,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0a99fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:38, skipping insertion in model container [2019-10-15 01:22:38,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:36" (2/3) ... [2019-10-15 01:22:38,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0a99fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:38, skipping insertion in model container [2019-10-15 01:22:38,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:38" (3/3) ... [2019-10-15 01:22:38,200 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:38,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:38,234 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:38,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:38,279 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:38,279 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:38,280 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:38,280 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:38,280 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:38,280 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:38,280 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:38,280 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states. [2019-10-15 01:22:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:22:38,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:38,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:38,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 343036633, now seen corresponding path program 1 times [2019-10-15 01:22:38,331 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:38,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663625349] [2019-10-15 01:22:38,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:38,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:38,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:39,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663625349] [2019-10-15 01:22:39,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:39,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:39,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682189721] [2019-10-15 01:22:39,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:39,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:39,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:39,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:39,080 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 4 states. [2019-10-15 01:22:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:39,357 INFO L93 Difference]: Finished difference Result 636 states and 1118 transitions. [2019-10-15 01:22:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:39,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-15 01:22:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:39,397 INFO L225 Difference]: With dead ends: 636 [2019-10-15 01:22:39,398 INFO L226 Difference]: Without dead ends: 418 [2019-10-15 01:22:39,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-15 01:22:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2019-10-15 01:22:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-15 01:22:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 609 transitions. [2019-10-15 01:22:39,547 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 609 transitions. Word has length 98 [2019-10-15 01:22:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:39,548 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 609 transitions. [2019-10-15 01:22:39,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 609 transitions. [2019-10-15 01:22:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:22:39,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:39,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:39,557 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -936762471, now seen corresponding path program 1 times [2019-10-15 01:22:39,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:39,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209586419] [2019-10-15 01:22:39,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:39,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:39,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:39,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209586419] [2019-10-15 01:22:39,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:39,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:39,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366948772] [2019-10-15 01:22:39,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:39,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:39,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:39,733 INFO L87 Difference]: Start difference. First operand 416 states and 609 transitions. Second operand 3 states. [2019-10-15 01:22:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:39,803 INFO L93 Difference]: Finished difference Result 1202 states and 1757 transitions. [2019-10-15 01:22:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:39,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-15 01:22:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:39,810 INFO L225 Difference]: With dead ends: 1202 [2019-10-15 01:22:39,810 INFO L226 Difference]: Without dead ends: 818 [2019-10-15 01:22:39,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-15 01:22:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 418. [2019-10-15 01:22:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-15 01:22:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-10-15 01:22:39,882 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 99 [2019-10-15 01:22:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:39,882 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-10-15 01:22:39,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-10-15 01:22:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:22:39,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:39,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:39,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1773874167, now seen corresponding path program 1 times [2019-10-15 01:22:39,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:39,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161420938] [2019-10-15 01:22:39,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:39,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:39,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:40,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161420938] [2019-10-15 01:22:40,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:40,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:40,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573406706] [2019-10-15 01:22:40,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:40,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:40,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:40,009 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 3 states. [2019-10-15 01:22:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:40,095 INFO L93 Difference]: Finished difference Result 1038 states and 1538 transitions. [2019-10-15 01:22:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:40,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-15 01:22:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:40,103 INFO L225 Difference]: With dead ends: 1038 [2019-10-15 01:22:40,103 INFO L226 Difference]: Without dead ends: 802 [2019-10-15 01:22:40,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-15 01:22:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2019-10-15 01:22:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-10-15 01:22:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1163 transitions. [2019-10-15 01:22:40,155 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1163 transitions. Word has length 100 [2019-10-15 01:22:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:40,158 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1163 transitions. [2019-10-15 01:22:40,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1163 transitions. [2019-10-15 01:22:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:22:40,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:40,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:40,168 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1816624602, now seen corresponding path program 1 times [2019-10-15 01:22:40,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:40,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428439318] [2019-10-15 01:22:40,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:40,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:40,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:40,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428439318] [2019-10-15 01:22:40,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:40,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:40,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849001433] [2019-10-15 01:22:40,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:40,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:40,380 INFO L87 Difference]: Start difference. First operand 800 states and 1163 transitions. Second operand 4 states. [2019-10-15 01:22:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:40,465 INFO L93 Difference]: Finished difference Result 1239 states and 1819 transitions. [2019-10-15 01:22:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:40,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-15 01:22:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:40,471 INFO L225 Difference]: With dead ends: 1239 [2019-10-15 01:22:40,472 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:22:40,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:22:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:22:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:22:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 883 transitions. [2019-10-15 01:22:40,523 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 883 transitions. Word has length 100 [2019-10-15 01:22:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:40,524 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 883 transitions. [2019-10-15 01:22:40,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 883 transitions. [2019-10-15 01:22:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:22:40,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:40,571 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:40,571 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1713248280, now seen corresponding path program 1 times [2019-10-15 01:22:40,572 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:40,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896783344] [2019-10-15 01:22:40,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:40,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:40,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:40,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896783344] [2019-10-15 01:22:40,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:40,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:40,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272859708] [2019-10-15 01:22:40,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:40,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:40,806 INFO L87 Difference]: Start difference. First operand 611 states and 883 transitions. Second operand 4 states. [2019-10-15 01:22:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:40,929 INFO L93 Difference]: Finished difference Result 1485 states and 2148 transitions. [2019-10-15 01:22:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:40,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-15 01:22:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:40,935 INFO L225 Difference]: With dead ends: 1485 [2019-10-15 01:22:40,935 INFO L226 Difference]: Without dead ends: 897 [2019-10-15 01:22:40,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-15 01:22:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2019-10-15 01:22:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-15 01:22:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1282 transitions. [2019-10-15 01:22:40,998 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1282 transitions. Word has length 102 [2019-10-15 01:22:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:40,999 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1282 transitions. [2019-10-15 01:22:40,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1282 transitions. [2019-10-15 01:22:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:22:41,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:41,002 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:41,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1610605002, now seen corresponding path program 1 times [2019-10-15 01:22:41,003 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:41,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243880898] [2019-10-15 01:22:41,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:41,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243880898] [2019-10-15 01:22:41,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:41,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:41,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697475556] [2019-10-15 01:22:41,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:41,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:41,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:41,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:41,098 INFO L87 Difference]: Start difference. First operand 895 states and 1282 transitions. Second operand 3 states. [2019-10-15 01:22:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:41,247 INFO L93 Difference]: Finished difference Result 2174 states and 3182 transitions. [2019-10-15 01:22:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:41,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-15 01:22:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:41,262 INFO L225 Difference]: With dead ends: 2174 [2019-10-15 01:22:41,263 INFO L226 Difference]: Without dead ends: 1607 [2019-10-15 01:22:41,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-10-15 01:22:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2019-10-15 01:22:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-10-15 01:22:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2301 transitions. [2019-10-15 01:22:41,381 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2301 transitions. Word has length 104 [2019-10-15 01:22:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:41,382 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 2301 transitions. [2019-10-15 01:22:41,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2301 transitions. [2019-10-15 01:22:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:22:41,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:41,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:41,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash -817857369, now seen corresponding path program 1 times [2019-10-15 01:22:41,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:41,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392406573] [2019-10-15 01:22:41,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:41,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392406573] [2019-10-15 01:22:41,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:41,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:41,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105903239] [2019-10-15 01:22:41,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:41,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:41,532 INFO L87 Difference]: Start difference. First operand 1605 states and 2301 transitions. Second operand 4 states. [2019-10-15 01:22:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:41,635 INFO L93 Difference]: Finished difference Result 2391 states and 3456 transitions. [2019-10-15 01:22:41,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:41,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-15 01:22:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:41,644 INFO L225 Difference]: With dead ends: 2391 [2019-10-15 01:22:41,644 INFO L226 Difference]: Without dead ends: 1319 [2019-10-15 01:22:41,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-10-15 01:22:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2019-10-15 01:22:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-10-15 01:22:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1881 transitions. [2019-10-15 01:22:41,743 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1881 transitions. Word has length 104 [2019-10-15 01:22:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:41,743 INFO L462 AbstractCegarLoop]: Abstraction has 1319 states and 1881 transitions. [2019-10-15 01:22:41,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1881 transitions. [2019-10-15 01:22:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:22:41,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:41,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:41,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash 669169858, now seen corresponding path program 1 times [2019-10-15 01:22:41,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:41,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871324628] [2019-10-15 01:22:41,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:41,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871324628] [2019-10-15 01:22:41,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:41,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:41,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848083199] [2019-10-15 01:22:41,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:41,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:41,894 INFO L87 Difference]: Start difference. First operand 1319 states and 1881 transitions. Second operand 3 states. [2019-10-15 01:22:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:42,239 INFO L93 Difference]: Finished difference Result 3197 states and 4694 transitions. [2019-10-15 01:22:42,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:42,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:22:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:42,252 INFO L225 Difference]: With dead ends: 3197 [2019-10-15 01:22:42,252 INFO L226 Difference]: Without dead ends: 2376 [2019-10-15 01:22:42,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-10-15 01:22:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2374. [2019-10-15 01:22:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-10-15 01:22:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3419 transitions. [2019-10-15 01:22:42,394 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3419 transitions. Word has length 106 [2019-10-15 01:22:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:42,395 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 3419 transitions. [2019-10-15 01:22:42,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3419 transitions. [2019-10-15 01:22:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:22:42,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:42,402 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -53512537, now seen corresponding path program 1 times [2019-10-15 01:22:42,403 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493555946] [2019-10-15 01:22:42,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:42,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493555946] [2019-10-15 01:22:42,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:42,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:42,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700317471] [2019-10-15 01:22:42,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:42,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:42,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:42,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:42,586 INFO L87 Difference]: Start difference. First operand 2374 states and 3419 transitions. Second operand 4 states. [2019-10-15 01:22:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:42,920 INFO L93 Difference]: Finished difference Result 6864 states and 9875 transitions. [2019-10-15 01:22:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:42,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 01:22:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:42,951 INFO L225 Difference]: With dead ends: 6864 [2019-10-15 01:22:42,951 INFO L226 Difference]: Without dead ends: 4533 [2019-10-15 01:22:42,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-10-15 01:22:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4531. [2019-10-15 01:22:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-10-15 01:22:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6454 transitions. [2019-10-15 01:22:43,344 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6454 transitions. Word has length 106 [2019-10-15 01:22:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,345 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6454 transitions. [2019-10-15 01:22:43,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6454 transitions. [2019-10-15 01:22:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:22:43,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:43,356 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2125527721, now seen corresponding path program 1 times [2019-10-15 01:22:43,358 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065859506] [2019-10-15 01:22:43,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:43,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065859506] [2019-10-15 01:22:43,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:43,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803225650] [2019-10-15 01:22:43,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:43,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:43,433 INFO L87 Difference]: Start difference. First operand 4531 states and 6454 transitions. Second operand 3 states. [2019-10-15 01:22:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,911 INFO L93 Difference]: Finished difference Result 13393 states and 19105 transitions. [2019-10-15 01:22:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:43,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-15 01:22:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,963 INFO L225 Difference]: With dead ends: 13393 [2019-10-15 01:22:43,963 INFO L226 Difference]: Without dead ends: 8971 [2019-10-15 01:22:43,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2019-10-15 01:22:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 4537. [2019-10-15 01:22:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-10-15 01:22:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6460 transitions. [2019-10-15 01:22:44,376 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6460 transitions. Word has length 107 [2019-10-15 01:22:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,376 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 6460 transitions. [2019-10-15 01:22:44,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6460 transitions. [2019-10-15 01:22:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:22:44,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:44,383 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -871367960, now seen corresponding path program 1 times [2019-10-15 01:22:44,384 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502003223] [2019-10-15 01:22:44,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:44,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502003223] [2019-10-15 01:22:44,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:44,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491820486] [2019-10-15 01:22:44,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:44,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:44,498 INFO L87 Difference]: Start difference. First operand 4537 states and 6460 transitions. Second operand 4 states. [2019-10-15 01:22:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,733 INFO L93 Difference]: Finished difference Result 9032 states and 12864 transitions. [2019-10-15 01:22:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:44,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-15 01:22:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,758 INFO L225 Difference]: With dead ends: 9032 [2019-10-15 01:22:44,758 INFO L226 Difference]: Without dead ends: 4531 [2019-10-15 01:22:44,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2019-10-15 01:22:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2019-10-15 01:22:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-10-15 01:22:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6448 transitions. [2019-10-15 01:22:45,225 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6448 transitions. Word has length 108 [2019-10-15 01:22:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:45,226 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6448 transitions. [2019-10-15 01:22:45,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6448 transitions. [2019-10-15 01:22:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:22:45,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:45,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:45,234 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:45,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:45,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1746692037, now seen corresponding path program 1 times [2019-10-15 01:22:45,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:45,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148120954] [2019-10-15 01:22:45,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:45,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148120954] [2019-10-15 01:22:45,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:45,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291446434] [2019-10-15 01:22:45,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:45,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:45,334 INFO L87 Difference]: Start difference. First operand 4531 states and 6448 transitions. Second operand 3 states. [2019-10-15 01:22:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:45,698 INFO L93 Difference]: Finished difference Result 10307 states and 14773 transitions. [2019-10-15 01:22:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:45,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-15 01:22:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:45,716 INFO L225 Difference]: With dead ends: 10307 [2019-10-15 01:22:45,716 INFO L226 Difference]: Without dead ends: 6717 [2019-10-15 01:22:45,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2019-10-15 01:22:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6715. [2019-10-15 01:22:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6715 states. [2019-10-15 01:22:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 9383 transitions. [2019-10-15 01:22:46,175 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 9383 transitions. Word has length 108 [2019-10-15 01:22:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:46,175 INFO L462 AbstractCegarLoop]: Abstraction has 6715 states and 9383 transitions. [2019-10-15 01:22:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 9383 transitions. [2019-10-15 01:22:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:22:46,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:46,185 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:46,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -848505304, now seen corresponding path program 1 times [2019-10-15 01:22:46,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:46,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620656499] [2019-10-15 01:22:46,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:46,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620656499] [2019-10-15 01:22:46,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:46,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:46,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789639507] [2019-10-15 01:22:46,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:46,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:46,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:46,352 INFO L87 Difference]: Start difference. First operand 6715 states and 9383 transitions. Second operand 4 states. [2019-10-15 01:22:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:46,825 INFO L93 Difference]: Finished difference Result 12456 states and 17427 transitions. [2019-10-15 01:22:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:46,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-15 01:22:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:46,841 INFO L225 Difference]: With dead ends: 12456 [2019-10-15 01:22:46,841 INFO L226 Difference]: Without dead ends: 6092 [2019-10-15 01:22:46,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2019-10-15 01:22:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 6023. [2019-10-15 01:22:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6023 states. [2019-10-15 01:22:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 8366 transitions. [2019-10-15 01:22:47,394 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 8366 transitions. Word has length 110 [2019-10-15 01:22:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:47,394 INFO L462 AbstractCegarLoop]: Abstraction has 6023 states and 8366 transitions. [2019-10-15 01:22:47,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 8366 transitions. [2019-10-15 01:22:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:22:47,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:47,405 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:47,405 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1621946400, now seen corresponding path program 1 times [2019-10-15 01:22:47,406 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:47,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833284186] [2019-10-15 01:22:47,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:47,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833284186] [2019-10-15 01:22:47,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:47,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:47,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186378139] [2019-10-15 01:22:47,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:47,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:47,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:47,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:47,500 INFO L87 Difference]: Start difference. First operand 6023 states and 8366 transitions. Second operand 3 states. [2019-10-15 01:22:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:48,388 INFO L93 Difference]: Finished difference Result 14841 states and 21156 transitions. [2019-10-15 01:22:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:48,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-15 01:22:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:48,411 INFO L225 Difference]: With dead ends: 14841 [2019-10-15 01:22:48,411 INFO L226 Difference]: Without dead ends: 10994 [2019-10-15 01:22:48,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10994 states. [2019-10-15 01:22:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10994 to 10992. [2019-10-15 01:22:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10992 states. [2019-10-15 01:22:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10992 states to 10992 states and 15347 transitions. [2019-10-15 01:22:49,033 INFO L78 Accepts]: Start accepts. Automaton has 10992 states and 15347 transitions. Word has length 112 [2019-10-15 01:22:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:49,034 INFO L462 AbstractCegarLoop]: Abstraction has 10992 states and 15347 transitions. [2019-10-15 01:22:49,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10992 states and 15347 transitions. [2019-10-15 01:22:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:22:49,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:49,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:49,050 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash 900773541, now seen corresponding path program 1 times [2019-10-15 01:22:49,051 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:49,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288926881] [2019-10-15 01:22:49,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:49,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288926881] [2019-10-15 01:22:49,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:49,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:49,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370938627] [2019-10-15 01:22:49,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:49,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:49,246 INFO L87 Difference]: Start difference. First operand 10992 states and 15347 transitions. Second operand 4 states. [2019-10-15 01:22:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:50,329 INFO L93 Difference]: Finished difference Result 22202 states and 30971 transitions. [2019-10-15 01:22:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:50,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:22:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:50,358 INFO L225 Difference]: With dead ends: 22202 [2019-10-15 01:22:50,359 INFO L226 Difference]: Without dead ends: 11365 [2019-10-15 01:22:50,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2019-10-15 01:22:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 11179. [2019-10-15 01:22:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11179 states. [2019-10-15 01:22:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11179 states to 11179 states and 15555 transitions. [2019-10-15 01:22:50,971 INFO L78 Accepts]: Start accepts. Automaton has 11179 states and 15555 transitions. Word has length 112 [2019-10-15 01:22:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:50,971 INFO L462 AbstractCegarLoop]: Abstraction has 11179 states and 15555 transitions. [2019-10-15 01:22:50,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 11179 states and 15555 transitions. [2019-10-15 01:22:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:22:50,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:50,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:50,983 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash 288500069, now seen corresponding path program 1 times [2019-10-15 01:22:50,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:50,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440182758] [2019-10-15 01:22:50,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:51,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440182758] [2019-10-15 01:22:51,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:51,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:51,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507782279] [2019-10-15 01:22:51,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:51,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:51,054 INFO L87 Difference]: Start difference. First operand 11179 states and 15555 transitions. Second operand 3 states. [2019-10-15 01:22:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:52,322 INFO L93 Difference]: Finished difference Result 29974 states and 41914 transitions. [2019-10-15 01:22:52,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:52,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-15 01:22:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:52,368 INFO L225 Difference]: With dead ends: 29974 [2019-10-15 01:22:52,369 INFO L226 Difference]: Without dead ends: 22153 [2019-10-15 01:22:52,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22153 states. [2019-10-15 01:22:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22153 to 11189. [2019-10-15 01:22:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11189 states. [2019-10-15 01:22:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 15565 transitions. [2019-10-15 01:22:53,025 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 15565 transitions. Word has length 113 [2019-10-15 01:22:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:53,026 INFO L462 AbstractCegarLoop]: Abstraction has 11189 states and 15565 transitions. [2019-10-15 01:22:53,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 15565 transitions. [2019-10-15 01:22:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:22:53,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:53,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:53,037 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash -431095923, now seen corresponding path program 1 times [2019-10-15 01:22:53,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:53,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307558865] [2019-10-15 01:22:53,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:53,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307558865] [2019-10-15 01:22:53,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:53,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:22:53,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400544512] [2019-10-15 01:22:53,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:22:53,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:22:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:22:53,303 INFO L87 Difference]: Start difference. First operand 11189 states and 15565 transitions. Second operand 12 states. [2019-10-15 01:22:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,292 INFO L93 Difference]: Finished difference Result 37443 states and 55319 transitions. [2019-10-15 01:22:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:22:56,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-10-15 01:22:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,350 INFO L225 Difference]: With dead ends: 37443 [2019-10-15 01:22:56,351 INFO L226 Difference]: Without dead ends: 30501 [2019-10-15 01:22:56,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:22:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30501 states. [2019-10-15 01:22:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30501 to 25435. [2019-10-15 01:22:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25435 states. [2019-10-15 01:22:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25435 states to 25435 states and 36699 transitions. [2019-10-15 01:22:58,346 INFO L78 Accepts]: Start accepts. Automaton has 25435 states and 36699 transitions. Word has length 114 [2019-10-15 01:22:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,346 INFO L462 AbstractCegarLoop]: Abstraction has 25435 states and 36699 transitions. [2019-10-15 01:22:58,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:22:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25435 states and 36699 transitions. [2019-10-15 01:22:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:22:58,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,363 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:58,363 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1784609226, now seen corresponding path program 1 times [2019-10-15 01:22:58,364 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043377874] [2019-10-15 01:22:58,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:58,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043377874] [2019-10-15 01:22:58,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860736144] [2019-10-15 01:22:58,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,441 INFO L87 Difference]: Start difference. First operand 25435 states and 36699 transitions. Second operand 3 states. [2019-10-15 01:23:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,317 INFO L93 Difference]: Finished difference Result 58469 states and 88539 transitions. [2019-10-15 01:23:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:01,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-15 01:23:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,396 INFO L225 Difference]: With dead ends: 58469 [2019-10-15 01:23:01,397 INFO L226 Difference]: Without dead ends: 41921 [2019-10-15 01:23:01,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41921 states. [2019-10-15 01:23:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41921 to 41919. [2019-10-15 01:23:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41919 states. [2019-10-15 01:23:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41919 states to 41919 states and 61685 transitions. [2019-10-15 01:23:04,130 INFO L78 Accepts]: Start accepts. Automaton has 41919 states and 61685 transitions. Word has length 114 [2019-10-15 01:23:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:04,131 INFO L462 AbstractCegarLoop]: Abstraction has 41919 states and 61685 transitions. [2019-10-15 01:23:04,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 41919 states and 61685 transitions. [2019-10-15 01:23:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:04,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:04,146 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:04,147 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1465323800, now seen corresponding path program 1 times [2019-10-15 01:23:04,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:04,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997071427] [2019-10-15 01:23:04,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:04,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997071427] [2019-10-15 01:23:04,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:04,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:04,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304670942] [2019-10-15 01:23:04,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:04,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:04,315 INFO L87 Difference]: Start difference. First operand 41919 states and 61685 transitions. Second operand 8 states. [2019-10-15 01:23:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:09,367 INFO L93 Difference]: Finished difference Result 97743 states and 147918 transitions. [2019-10-15 01:23:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:09,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-10-15 01:23:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:09,469 INFO L225 Difference]: With dead ends: 97743 [2019-10-15 01:23:09,469 INFO L226 Difference]: Without dead ends: 64072 [2019-10-15 01:23:09,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64072 states.