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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:37,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:37,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:37,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:37,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:37,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:37,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:37,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:37,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:37,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:37,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:37,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:37,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:37,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:37,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:37,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:37,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:37,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:37,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:37,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:37,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:37,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:37,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:37,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:37,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:37,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:37,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:37,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:37,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:37,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:37,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:37,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:37,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:37,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:37,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:37,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:37,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:37,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:37,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:37,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:37,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:37,832 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:37,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:37,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:37,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:37,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:37,858 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:37,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:37,858 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:37,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:37,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:37,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:37,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:37,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:37,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:37,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:37,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:37,861 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:37,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:37,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:37,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:37,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:37,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:37,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:37,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:37,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:37,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:37,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:37,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:37,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:37,864 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:38,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:38,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:38,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:38,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:38,179 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:38,180 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:22:38,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126fcdc5e/4d364b9e15494476b57d6254834faafa/FLAG11c8fe9da [2019-10-15 01:22:38,870 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:38,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:22:38,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126fcdc5e/4d364b9e15494476b57d6254834faafa/FLAG11c8fe9da [2019-10-15 01:22:39,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126fcdc5e/4d364b9e15494476b57d6254834faafa [2019-10-15 01:22:39,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:39,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:39,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:39,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:39,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:39,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39, skipping insertion in model container [2019-10-15 01:22:39,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:39,206 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:39,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,942 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:40,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:40,169 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:40,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:40 WrapperNode [2019-10-15 01:22:40,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:40,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:40,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:40,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:40,185 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:40" (1/1) ... [2019-10-15 01:22:40,185 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:40" (1/1) ... [2019-10-15 01:22:40,205 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:40" (1/1) ... [2019-10-15 01:22:40,206 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:40" (1/1) ... [2019-10-15 01:22:40,265 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:40" (1/1) ... [2019-10-15 01:22:40,289 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:40" (1/1) ... [2019-10-15 01:22:40,296 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:40" (1/1) ... [2019-10-15 01:22:40,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:40,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:40,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:40,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:40,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:40" (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:40,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:40,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:40,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:22:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:42,219 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:42,219 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:42,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:42 BoogieIcfgContainer [2019-10-15 01:22:42,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:42,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:42,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:42,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:42,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:39" (1/3) ... [2019-10-15 01:22:42,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f03156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:42, skipping insertion in model container [2019-10-15 01:22:42,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:40" (2/3) ... [2019-10-15 01:22:42,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f03156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:42, skipping insertion in model container [2019-10-15 01:22:42,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:42" (3/3) ... [2019-10-15 01:22:42,240 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:22:42,253 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:42,283 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:22:42,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:22:42,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:42,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:42,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:42,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:42,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:42,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:42,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:42,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states. [2019-10-15 01:22:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:22:42,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,419 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, 1, 1, 1, 1, 1, 1, 1, 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,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -378109419, now seen corresponding path program 1 times [2019-10-15 01:22:42,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059852406] [2019-10-15 01:22:42,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,322 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,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059852406] [2019-10-15 01:22:43,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:43,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014440456] [2019-10-15 01:22:43,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:43,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:43,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:43,352 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 4 states. [2019-10-15 01:22:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,654 INFO L93 Difference]: Finished difference Result 1140 states and 2047 transitions. [2019-10-15 01:22:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:43,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-15 01:22:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,689 INFO L225 Difference]: With dead ends: 1140 [2019-10-15 01:22:43,689 INFO L226 Difference]: Without dead ends: 752 [2019-10-15 01:22:43,703 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:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-15 01:22:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 726. [2019-10-15 01:22:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-15 01:22:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1035 transitions. [2019-10-15 01:22:43,823 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1035 transitions. Word has length 145 [2019-10-15 01:22:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,824 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1035 transitions. [2019-10-15 01:22:43,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1035 transitions. [2019-10-15 01:22:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:22:43,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 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,828 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 785847517, now seen corresponding path program 1 times [2019-10-15 01:22:43,829 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747342188] [2019-10-15 01:22:43,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,942 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,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747342188] [2019-10-15 01:22:43,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:43,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843459433] [2019-10-15 01:22:43,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:43,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:43,946 INFO L87 Difference]: Start difference. First operand 726 states and 1035 transitions. Second operand 3 states. [2019-10-15 01:22:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,038 INFO L93 Difference]: Finished difference Result 2132 states and 3035 transitions. [2019-10-15 01:22:44,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:44,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-15 01:22:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,046 INFO L225 Difference]: With dead ends: 2132 [2019-10-15 01:22:44,047 INFO L226 Difference]: Without dead ends: 1438 [2019-10-15 01:22:44,049 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:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2019-10-15 01:22:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 728. [2019-10-15 01:22:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-15 01:22:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1037 transitions. [2019-10-15 01:22:44,102 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1037 transitions. Word has length 146 [2019-10-15 01:22:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,103 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 1037 transitions. [2019-10-15 01:22:44,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1037 transitions. [2019-10-15 01:22:44,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:44,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,106 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 615628916, now seen corresponding path program 1 times [2019-10-15 01:22:44,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342141200] [2019-10-15 01:22:44,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,418 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,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342141200] [2019-10-15 01:22:44,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:44,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849909739] [2019-10-15 01:22:44,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:44,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:44,430 INFO L87 Difference]: Start difference. First operand 728 states and 1037 transitions. Second operand 4 states. [2019-10-15 01:22:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,525 INFO L93 Difference]: Finished difference Result 1438 states and 2049 transitions. [2019-10-15 01:22:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:44,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:22:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,533 INFO L225 Difference]: With dead ends: 1438 [2019-10-15 01:22:44,533 INFO L226 Difference]: Without dead ends: 728 [2019-10-15 01:22:44,537 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,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-15 01:22:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 727. [2019-10-15 01:22:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-15 01:22:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1034 transitions. [2019-10-15 01:22:44,589 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1034 transitions. Word has length 147 [2019-10-15 01:22:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,590 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1034 transitions. [2019-10-15 01:22:44,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1034 transitions. [2019-10-15 01:22:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:44,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,600 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1544797217, now seen corresponding path program 1 times [2019-10-15 01:22:44,602 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342748432] [2019-10-15 01:22:44,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,834 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,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342748432] [2019-10-15 01:22:44,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:44,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562779983] [2019-10-15 01:22:44,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:44,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:44,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:44,837 INFO L87 Difference]: Start difference. First operand 727 states and 1034 transitions. Second operand 3 states. [2019-10-15 01:22:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,954 INFO L93 Difference]: Finished difference Result 1957 states and 2793 transitions. [2019-10-15 01:22:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:44,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:22:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,964 INFO L225 Difference]: With dead ends: 1957 [2019-10-15 01:22:44,965 INFO L226 Difference]: Without dead ends: 1409 [2019-10-15 01:22:44,968 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:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-10-15 01:22:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1383. [2019-10-15 01:22:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-10-15 01:22:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1959 transitions. [2019-10-15 01:22:45,049 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1959 transitions. Word has length 147 [2019-10-15 01:22:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:45,052 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 1959 transitions. [2019-10-15 01:22:45,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1959 transitions. [2019-10-15 01:22:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:45,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:45,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,056 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1137007516, now seen corresponding path program 1 times [2019-10-15 01:22:45,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:45,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998906561] [2019-10-15 01:22:45,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,272 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,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998906561] [2019-10-15 01:22:45,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:45,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728381431] [2019-10-15 01:22:45,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:45,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:45,276 INFO L87 Difference]: Start difference. First operand 1383 states and 1959 transitions. Second operand 4 states. [2019-10-15 01:22:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:45,357 INFO L93 Difference]: Finished difference Result 2275 states and 3231 transitions. [2019-10-15 01:22:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:45,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:22:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:45,364 INFO L225 Difference]: With dead ends: 2275 [2019-10-15 01:22:45,365 INFO L226 Difference]: Without dead ends: 1061 [2019-10-15 01:22:45,368 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:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-10-15 01:22:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2019-10-15 01:22:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-10-15 01:22:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1494 transitions. [2019-10-15 01:22:45,426 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1494 transitions. Word has length 147 [2019-10-15 01:22:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:45,426 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1494 transitions. [2019-10-15 01:22:45,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1494 transitions. [2019-10-15 01:22:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:22:45,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:45,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,431 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:45,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1811444338, now seen corresponding path program 1 times [2019-10-15 01:22:45,432 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:45,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298543443] [2019-10-15 01:22:45,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,620 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,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298543443] [2019-10-15 01:22:45,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:45,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726767329] [2019-10-15 01:22:45,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:45,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:45,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:45,625 INFO L87 Difference]: Start difference. First operand 1061 states and 1494 transitions. Second operand 3 states. [2019-10-15 01:22:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:46,009 INFO L93 Difference]: Finished difference Result 2751 states and 3920 transitions. [2019-10-15 01:22:46,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:46,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:22:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:46,020 INFO L225 Difference]: With dead ends: 2751 [2019-10-15 01:22:46,020 INFO L226 Difference]: Without dead ends: 1942 [2019-10-15 01:22:46,023 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:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-10-15 01:22:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1916. [2019-10-15 01:22:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-10-15 01:22:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2713 transitions. [2019-10-15 01:22:46,104 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2713 transitions. Word has length 153 [2019-10-15 01:22:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:46,105 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 2713 transitions. [2019-10-15 01:22:46,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2713 transitions. [2019-10-15 01:22:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:22:46,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:46,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash 404324973, now seen corresponding path program 1 times [2019-10-15 01:22:46,110 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:46,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231395657] [2019-10-15 01:22:46,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:46,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231395657] [2019-10-15 01:22:46,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:46,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:22:46,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590497074] [2019-10-15 01:22:46,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:22:46,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:22:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:22:46,634 INFO L87 Difference]: Start difference. First operand 1916 states and 2713 transitions. Second operand 13 states. [2019-10-15 01:22:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:48,912 INFO L93 Difference]: Finished difference Result 7242 states and 11196 transitions. [2019-10-15 01:22:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:22:48,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2019-10-15 01:22:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:48,940 INFO L225 Difference]: With dead ends: 7242 [2019-10-15 01:22:48,941 INFO L226 Difference]: Without dead ends: 5602 [2019-10-15 01:22:48,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:22:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2019-10-15 01:22:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 3296. [2019-10-15 01:22:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3296 states. [2019-10-15 01:22:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4983 transitions. [2019-10-15 01:22:49,226 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4983 transitions. Word has length 153 [2019-10-15 01:22:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:49,227 INFO L462 AbstractCegarLoop]: Abstraction has 3296 states and 4983 transitions. [2019-10-15 01:22:49,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:22:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4983 transitions. [2019-10-15 01:22:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:22:49,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:49,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash -685965993, now seen corresponding path program 1 times [2019-10-15 01:22:49,234 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:49,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707092238] [2019-10-15 01:22:49,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:49,556 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,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707092238] [2019-10-15 01:22:49,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:49,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:22:49,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100070317] [2019-10-15 01:22:49,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:49,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:49,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:49,559 INFO L87 Difference]: Start difference. First operand 3296 states and 4983 transitions. Second operand 8 states. [2019-10-15 01:22:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:49,971 INFO L93 Difference]: Finished difference Result 6873 states and 10638 transitions. [2019-10-15 01:22:49,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:49,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 153 [2019-10-15 01:22:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:49,998 INFO L225 Difference]: With dead ends: 6873 [2019-10-15 01:22:49,999 INFO L226 Difference]: Without dead ends: 4901 [2019-10-15 01:22:50,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-10-15 01:22:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 3984. [2019-10-15 01:22:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2019-10-15 01:22:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 5886 transitions. [2019-10-15 01:22:50,322 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 5886 transitions. Word has length 153 [2019-10-15 01:22:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:50,322 INFO L462 AbstractCegarLoop]: Abstraction has 3984 states and 5886 transitions. [2019-10-15 01:22:50,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:22:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 5886 transitions. [2019-10-15 01:22:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:22:50,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:50,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,331 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1419709992, now seen corresponding path program 1 times [2019-10-15 01:22:50,332 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:50,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420666986] [2019-10-15 01:22:50,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:50,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420666986] [2019-10-15 01:22:50,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:50,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:50,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784744689] [2019-10-15 01:22:50,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:50,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:50,569 INFO L87 Difference]: Start difference. First operand 3984 states and 5886 transitions. Second operand 4 states. [2019-10-15 01:22:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:51,132 INFO L93 Difference]: Finished difference Result 10383 states and 15339 transitions. [2019-10-15 01:22:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:51,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-15 01:22:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:51,177 INFO L225 Difference]: With dead ends: 10383 [2019-10-15 01:22:51,177 INFO L226 Difference]: Without dead ends: 6426 [2019-10-15 01:22:51,187 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:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2019-10-15 01:22:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6404. [2019-10-15 01:22:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6404 states. [2019-10-15 01:22:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6404 states to 6404 states and 9378 transitions. [2019-10-15 01:22:51,555 INFO L78 Accepts]: Start accepts. Automaton has 6404 states and 9378 transitions. Word has length 153 [2019-10-15 01:22:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:51,556 INFO L462 AbstractCegarLoop]: Abstraction has 6404 states and 9378 transitions. [2019-10-15 01:22:51,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6404 states and 9378 transitions. [2019-10-15 01:22:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:22:51,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:51,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,565 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:51,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1518674242, now seen corresponding path program 1 times [2019-10-15 01:22:51,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:51,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257391624] [2019-10-15 01:22:51,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:51,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:51,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:51,667 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,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257391624] [2019-10-15 01:22:51,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:51,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:51,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893121659] [2019-10-15 01:22:51,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:51,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:51,671 INFO L87 Difference]: Start difference. First operand 6404 states and 9378 transitions. Second operand 3 states. [2019-10-15 01:22:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:52,389 INFO L93 Difference]: Finished difference Result 16047 states and 23518 transitions. [2019-10-15 01:22:52,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:52,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-15 01:22:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:52,415 INFO L225 Difference]: With dead ends: 16047 [2019-10-15 01:22:52,416 INFO L226 Difference]: Without dead ends: 9996 [2019-10-15 01:22:52,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2019-10-15 01:22:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 9976. [2019-10-15 01:22:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9976 states. [2019-10-15 01:22:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 14410 transitions. [2019-10-15 01:22:52,966 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 14410 transitions. Word has length 155 [2019-10-15 01:22:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:52,966 INFO L462 AbstractCegarLoop]: Abstraction has 9976 states and 14410 transitions. [2019-10-15 01:22:52,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 14410 transitions. [2019-10-15 01:22:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:22:52,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:52,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1456809787, now seen corresponding path program 1 times [2019-10-15 01:22:52,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:52,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751425350] [2019-10-15 01:22:52,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:52,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:52,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:53,172 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,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751425350] [2019-10-15 01:22:53,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:53,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:53,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269635693] [2019-10-15 01:22:53,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:53,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:53,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:53,175 INFO L87 Difference]: Start difference. First operand 9976 states and 14410 transitions. Second operand 4 states. [2019-10-15 01:22:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:54,256 INFO L93 Difference]: Finished difference Result 20942 states and 30881 transitions. [2019-10-15 01:22:54,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:54,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:22:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:54,287 INFO L225 Difference]: With dead ends: 20942 [2019-10-15 01:22:54,287 INFO L226 Difference]: Without dead ends: 16040 [2019-10-15 01:22:54,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16040 states. [2019-10-15 01:22:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16040 to 16038. [2019-10-15 01:22:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16038 states. [2019-10-15 01:22:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16038 states to 16038 states and 22893 transitions. [2019-10-15 01:22:55,679 INFO L78 Accepts]: Start accepts. Automaton has 16038 states and 22893 transitions. Word has length 161 [2019-10-15 01:22:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:55,680 INFO L462 AbstractCegarLoop]: Abstraction has 16038 states and 22893 transitions. [2019-10-15 01:22:55,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16038 states and 22893 transitions. [2019-10-15 01:22:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:22:55,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:55,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash -833013491, now seen corresponding path program 1 times [2019-10-15 01:22:55,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:55,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770130026] [2019-10-15 01:22:55,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,874 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:55,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770130026] [2019-10-15 01:22:55,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:55,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952391465] [2019-10-15 01:22:55,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:55,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:55,876 INFO L87 Difference]: Start difference. First operand 16038 states and 22893 transitions. Second operand 4 states. [2019-10-15 01:22:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,084 INFO L93 Difference]: Finished difference Result 46992 states and 66908 transitions. [2019-10-15 01:22:57,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:57,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:22:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,152 INFO L225 Difference]: With dead ends: 46992 [2019-10-15 01:22:57,152 INFO L226 Difference]: Without dead ends: 30997 [2019-10-15 01:22:57,183 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:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30997 states. [2019-10-15 01:22:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30997 to 30947. [2019-10-15 01:22:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30947 states. [2019-10-15 01:22:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30947 states to 30947 states and 43619 transitions. [2019-10-15 01:22:58,827 INFO L78 Accepts]: Start accepts. Automaton has 30947 states and 43619 transitions. Word has length 161 [2019-10-15 01:22:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,827 INFO L462 AbstractCegarLoop]: Abstraction has 30947 states and 43619 transitions. [2019-10-15 01:22:58,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30947 states and 43619 transitions. [2019-10-15 01:22:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:22:58,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,884 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1467447725, now seen corresponding path program 1 times [2019-10-15 01:22:58,885 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041345148] [2019-10-15 01:22:58,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,945 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,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041345148] [2019-10-15 01:22:58,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541975220] [2019-10-15 01:22:58,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,947 INFO L87 Difference]: Start difference. First operand 30947 states and 43619 transitions. Second operand 3 states. [2019-10-15 01:23:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,822 INFO L93 Difference]: Finished difference Result 92649 states and 130610 transitions. [2019-10-15 01:23:01,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:01,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-15 01:23:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,963 INFO L225 Difference]: With dead ends: 92649 [2019-10-15 01:23:01,963 INFO L226 Difference]: Without dead ends: 61807 [2019-10-15 01:23:02,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61807 states. [2019-10-15 01:23:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61807 to 30953. [2019-10-15 01:23:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30953 states. [2019-10-15 01:23:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30953 states to 30953 states and 43625 transitions. [2019-10-15 01:23:03,797 INFO L78 Accepts]: Start accepts. Automaton has 30953 states and 43625 transitions. Word has length 162 [2019-10-15 01:23:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:03,797 INFO L462 AbstractCegarLoop]: Abstraction has 30953 states and 43625 transitions. [2019-10-15 01:23:03,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 30953 states and 43625 transitions. [2019-10-15 01:23:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:23:03,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:03,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1559304139, now seen corresponding path program 1 times [2019-10-15 01:23:03,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:03,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074904495] [2019-10-15 01:23:03,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:03,917 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:03,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074904495] [2019-10-15 01:23:03,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:03,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:03,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265754237] [2019-10-15 01:23:03,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:03,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:03,920 INFO L87 Difference]: Start difference. First operand 30953 states and 43625 transitions. Second operand 3 states. [2019-10-15 01:23:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,174 INFO L93 Difference]: Finished difference Result 80878 states and 113504 transitions. [2019-10-15 01:23:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:06,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-15 01:23:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:06,247 INFO L225 Difference]: With dead ends: 80878 [2019-10-15 01:23:06,248 INFO L226 Difference]: Without dead ends: 50606 [2019-10-15 01:23:06,287 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:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50606 states. [2019-10-15 01:23:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50606 to 50556. [2019-10-15 01:23:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50556 states. [2019-10-15 01:23:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50556 states to 50556 states and 69850 transitions. [2019-10-15 01:23:09,613 INFO L78 Accepts]: Start accepts. Automaton has 50556 states and 69850 transitions. Word has length 163 [2019-10-15 01:23:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:09,614 INFO L462 AbstractCegarLoop]: Abstraction has 50556 states and 69850 transitions. [2019-10-15 01:23:09,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50556 states and 69850 transitions. [2019-10-15 01:23:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:23:09,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:09,650 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,650 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 610567160, now seen corresponding path program 1 times [2019-10-15 01:23:09,651 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:09,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987333601] [2019-10-15 01:23:09,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:09,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:10,030 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:10,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987333601] [2019-10-15 01:23:10,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:10,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:10,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590418535] [2019-10-15 01:23:10,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:10,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:10,033 INFO L87 Difference]: Start difference. First operand 50556 states and 69850 transitions. Second operand 4 states. [2019-10-15 01:23:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:12,460 INFO L93 Difference]: Finished difference Result 95832 states and 132707 transitions. [2019-10-15 01:23:12,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:12,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-15 01:23:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:12,504 INFO L225 Difference]: With dead ends: 95832 [2019-10-15 01:23:12,504 INFO L226 Difference]: Without dead ends: 45895 [2019-10-15 01:23:12,535 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:23:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45895 states.