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.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:47,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:47,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:47,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:47,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:47,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:47,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:47,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:47,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:47,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:47,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:47,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:47,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:47,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:47,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:47,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:47,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:47,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:47,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:47,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:47,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:47,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:47,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:47,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:47,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:47,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:47,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:47,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:47,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:47,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:47,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:47,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:47,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:47,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:47,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:47,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:47,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:47,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:47,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:47,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:47,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:47,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:23:47,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:47,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:47,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:47,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:47,081 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:47,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:47,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:47,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:47,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:47,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:47,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:47,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:47,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:47,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:47,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:47,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:47,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:47,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:47,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:47,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:47,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:47,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:47,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:47,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:47,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:47,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:47,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:47,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:47,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:23:47,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:47,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:47,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:47,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:47,417 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:47,418 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.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:47,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaf422ae/f53cc722098f4e0e813e7981812d1d43/FLAGd3e39d8f7 [2019-10-13 21:23:48,169 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:48,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:48,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaf422ae/f53cc722098f4e0e813e7981812d1d43/FLAGd3e39d8f7 [2019-10-13 21:23:48,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaf422ae/f53cc722098f4e0e813e7981812d1d43 [2019-10-13 21:23:48,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:48,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:48,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:48,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:48,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:48,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:48" (1/1) ... [2019-10-13 21:23:48,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fae1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:48, skipping insertion in model container [2019-10-13 21:23:48,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:48" (1/1) ... [2019-10-13 21:23:48,479 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:48,556 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:49,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:49,201 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:49,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:49,654 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:49,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49 WrapperNode [2019-10-13 21:23:49,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:49,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:49,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:49,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:49,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:49,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:49,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:49,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:49,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:49,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:49,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:49,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:51,600 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:51,600 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:51,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:51 BoogieIcfgContainer [2019-10-13 21:23:51,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:51,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:51,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:51,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:51,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:48" (1/3) ... [2019-10-13 21:23:51,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cdff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:51, skipping insertion in model container [2019-10-13 21:23:51,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (2/3) ... [2019-10-13 21:23:51,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cdff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:51, skipping insertion in model container [2019-10-13 21:23:51,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:51" (3/3) ... [2019-10-13 21:23:51,625 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:51,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:51,646 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:23:51,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:23:51,686 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:51,687 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:51,687 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:51,687 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:51,687 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:51,687 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:51,687 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:51,687 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states. [2019-10-13 21:23:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:23:51,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:51,733 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] [2019-10-13 21:23:51,735 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash -737000611, now seen corresponding path program 1 times [2019-10-13 21:23:51,754 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:51,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620912115] [2019-10-13 21:23:51,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:52,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620912115] [2019-10-13 21:23:52,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:52,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:52,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951823850] [2019-10-13 21:23:52,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:52,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:52,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:52,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:52,555 INFO L87 Difference]: Start difference. First operand 371 states. Second operand 3 states. [2019-10-13 21:23:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:52,777 INFO L93 Difference]: Finished difference Result 667 states and 1188 transitions. [2019-10-13 21:23:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:52,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-13 21:23:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:52,799 INFO L225 Difference]: With dead ends: 667 [2019-10-13 21:23:52,800 INFO L226 Difference]: Without dead ends: 520 [2019-10-13 21:23:52,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-13 21:23:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2019-10-13 21:23:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-13 21:23:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 755 transitions. [2019-10-13 21:23:52,897 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 755 transitions. Word has length 140 [2019-10-13 21:23:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:52,898 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 755 transitions. [2019-10-13 21:23:52,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 755 transitions. [2019-10-13 21:23:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:23:52,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:52,903 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] [2019-10-13 21:23:52,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1264797844, now seen corresponding path program 1 times [2019-10-13 21:23:52,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:52,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140842857] [2019-10-13 21:23:52,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:53,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140842857] [2019-10-13 21:23:53,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:53,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47401843] [2019-10-13 21:23:53,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:53,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:53,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,090 INFO L87 Difference]: Start difference. First operand 518 states and 755 transitions. Second operand 3 states. [2019-10-13 21:23:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:53,230 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-10-13 21:23:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:53,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-13 21:23:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:53,237 INFO L225 Difference]: With dead ends: 1029 [2019-10-13 21:23:53,237 INFO L226 Difference]: Without dead ends: 824 [2019-10-13 21:23:53,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-10-13 21:23:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2019-10-13 21:23:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-10-13 21:23:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1219 transitions. [2019-10-13 21:23:53,338 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1219 transitions. Word has length 140 [2019-10-13 21:23:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,339 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1219 transitions. [2019-10-13 21:23:53,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1219 transitions. [2019-10-13 21:23:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:23:53,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,351 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] [2019-10-13 21:23:53,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1075415587, now seen corresponding path program 1 times [2019-10-13 21:23:53,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379416957] [2019-10-13 21:23:53,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:53,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379416957] [2019-10-13 21:23:53,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:53,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363448999] [2019-10-13 21:23:53,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:53,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,502 INFO L87 Difference]: Start difference. First operand 822 states and 1219 transitions. Second operand 3 states. [2019-10-13 21:23:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:53,697 INFO L93 Difference]: Finished difference Result 1781 states and 2727 transitions. [2019-10-13 21:23:53,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:53,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-13 21:23:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:53,707 INFO L225 Difference]: With dead ends: 1781 [2019-10-13 21:23:53,707 INFO L226 Difference]: Without dead ends: 1436 [2019-10-13 21:23:53,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-10-13 21:23:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1434. [2019-10-13 21:23:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-13 21:23:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2151 transitions. [2019-10-13 21:23:53,781 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2151 transitions. Word has length 140 [2019-10-13 21:23:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,782 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 2151 transitions. [2019-10-13 21:23:53,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2151 transitions. [2019-10-13 21:23:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:23:53,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,789 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] [2019-10-13 21:23:53,789 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1075754211, now seen corresponding path program 1 times [2019-10-13 21:23:53,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651171659] [2019-10-13 21:23:53,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:54,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651171659] [2019-10-13 21:23:54,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:54,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151896159] [2019-10-13 21:23:54,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:54,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:54,197 INFO L87 Difference]: Start difference. First operand 1434 states and 2151 transitions. Second operand 4 states. [2019-10-13 21:23:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:54,442 INFO L93 Difference]: Finished difference Result 4221 states and 6322 transitions. [2019-10-13 21:23:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:54,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:23:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:54,463 INFO L225 Difference]: With dead ends: 4221 [2019-10-13 21:23:54,463 INFO L226 Difference]: Without dead ends: 2800 [2019-10-13 21:23:54,468 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-13 21:23:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-10-13 21:23:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2760. [2019-10-13 21:23:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-10-13 21:23:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4117 transitions. [2019-10-13 21:23:54,652 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4117 transitions. Word has length 140 [2019-10-13 21:23:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:54,652 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 4117 transitions. [2019-10-13 21:23:54,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4117 transitions. [2019-10-13 21:23:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:23:54,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:54,658 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] [2019-10-13 21:23:54,658 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash -127121487, now seen corresponding path program 1 times [2019-10-13 21:23:54,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:54,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447890812] [2019-10-13 21:23:54,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:54,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447890812] [2019-10-13 21:23:54,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:54,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861510030] [2019-10-13 21:23:54,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:54,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:54,797 INFO L87 Difference]: Start difference. First operand 2760 states and 4117 transitions. Second operand 3 states. [2019-10-13 21:23:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,166 INFO L93 Difference]: Finished difference Result 8234 states and 12281 transitions. [2019-10-13 21:23:55,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:55,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-13 21:23:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:55,198 INFO L225 Difference]: With dead ends: 8234 [2019-10-13 21:23:55,198 INFO L226 Difference]: Without dead ends: 5506 [2019-10-13 21:23:55,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2019-10-13 21:23:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 2762. [2019-10-13 21:23:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-10-13 21:23:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4119 transitions. [2019-10-13 21:23:55,408 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4119 transitions. Word has length 141 [2019-10-13 21:23:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,408 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 4119 transitions. [2019-10-13 21:23:55,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4119 transitions. [2019-10-13 21:23:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:23:55,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,413 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] [2019-10-13 21:23:55,414 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1322555170, now seen corresponding path program 1 times [2019-10-13 21:23:55,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208233681] [2019-10-13 21:23:55,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:55,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208233681] [2019-10-13 21:23:55,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:55,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806248641] [2019-10-13 21:23:55,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:55,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:55,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:55,659 INFO L87 Difference]: Start difference. First operand 2762 states and 4119 transitions. Second operand 4 states. [2019-10-13 21:23:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,914 INFO L93 Difference]: Finished difference Result 5510 states and 8220 transitions. [2019-10-13 21:23:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:55,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:23:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:55,936 INFO L225 Difference]: With dead ends: 5510 [2019-10-13 21:23:55,937 INFO L226 Difference]: Without dead ends: 2760 [2019-10-13 21:23:55,945 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-13 21:23:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2019-10-13 21:23:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2019-10-13 21:23:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-10-13 21:23:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4115 transitions. [2019-10-13 21:23:56,125 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4115 transitions. Word has length 142 [2019-10-13 21:23:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,126 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 4115 transitions. [2019-10-13 21:23:56,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4115 transitions. [2019-10-13 21:23:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:23:56,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,130 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] [2019-10-13 21:23:56,131 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -82288669, now seen corresponding path program 1 times [2019-10-13 21:23:56,132 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430388480] [2019-10-13 21:23:56,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:56,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430388480] [2019-10-13 21:23:56,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:56,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111538730] [2019-10-13 21:23:56,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:56,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,254 INFO L87 Difference]: Start difference. First operand 2760 states and 4115 transitions. Second operand 3 states. [2019-10-13 21:23:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,514 INFO L93 Difference]: Finished difference Result 6674 states and 9953 transitions. [2019-10-13 21:23:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:56,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-13 21:23:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,540 INFO L225 Difference]: With dead ends: 6674 [2019-10-13 21:23:56,541 INFO L226 Difference]: Without dead ends: 4094 [2019-10-13 21:23:56,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2019-10-13 21:23:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 4054. [2019-10-13 21:23:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4054 states. [2019-10-13 21:23:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5963 transitions. [2019-10-13 21:23:56,862 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5963 transitions. Word has length 142 [2019-10-13 21:23:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,863 INFO L462 AbstractCegarLoop]: Abstraction has 4054 states and 5963 transitions. [2019-10-13 21:23:56,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5963 transitions. [2019-10-13 21:23:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:56,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,871 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-13 21:23:56,872 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1177772960, now seen corresponding path program 1 times [2019-10-13 21:23:56,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012008612] [2019-10-13 21:23:56,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:57,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012008612] [2019-10-13 21:23:57,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:23:57,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947611958] [2019-10-13 21:23:57,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:57,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:57,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:57,099 INFO L87 Difference]: Start difference. First operand 4054 states and 5963 transitions. Second operand 8 states. [2019-10-13 21:23:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:58,603 INFO L93 Difference]: Finished difference Result 13639 states and 20990 transitions. [2019-10-13 21:23:58,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:23:58,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-10-13 21:23:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:58,659 INFO L225 Difference]: With dead ends: 13639 [2019-10-13 21:23:58,660 INFO L226 Difference]: Without dead ends: 9790 [2019-10-13 21:23:58,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:23:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2019-10-13 21:23:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 5376. [2019-10-13 21:23:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-10-13 21:23:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 7951 transitions. [2019-10-13 21:23:59,194 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 7951 transitions. Word has length 145 [2019-10-13 21:23:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:59,195 INFO L462 AbstractCegarLoop]: Abstraction has 5376 states and 7951 transitions. [2019-10-13 21:23:59,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 7951 transitions. [2019-10-13 21:23:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:59,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:59,202 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-13 21:23:59,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash -142350002, now seen corresponding path program 1 times [2019-10-13 21:23:59,203 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:59,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029876151] [2019-10-13 21:23:59,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:59,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029876151] [2019-10-13 21:23:59,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:59,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930191063] [2019-10-13 21:23:59,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:59,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:59,416 INFO L87 Difference]: Start difference. First operand 5376 states and 7951 transitions. Second operand 4 states. [2019-10-13 21:24:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,025 INFO L93 Difference]: Finished difference Result 14463 states and 21402 transitions. [2019-10-13 21:24:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:00,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-13 21:24:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,056 INFO L225 Difference]: With dead ends: 14463 [2019-10-13 21:24:00,056 INFO L226 Difference]: Without dead ends: 9110 [2019-10-13 21:24:00,068 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-13 21:24:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9110 states. [2019-10-13 21:24:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9110 to 9080. [2019-10-13 21:24:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9080 states. [2019-10-13 21:24:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 13336 transitions. [2019-10-13 21:24:00,657 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 13336 transitions. Word has length 145 [2019-10-13 21:24:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,657 INFO L462 AbstractCegarLoop]: Abstraction has 9080 states and 13336 transitions. [2019-10-13 21:24:00,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 13336 transitions. [2019-10-13 21:24:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:24:00,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,668 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-13 21:24:00,668 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -140462378, now seen corresponding path program 1 times [2019-10-13 21:24:00,669 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634750376] [2019-10-13 21:24:00,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:00,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634750376] [2019-10-13 21:24:00,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:00,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:00,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451048181] [2019-10-13 21:24:00,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:00,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:00,845 INFO L87 Difference]: Start difference. First operand 9080 states and 13336 transitions. Second operand 3 states. [2019-10-13 21:24:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:01,918 INFO L93 Difference]: Finished difference Result 24470 states and 36012 transitions. [2019-10-13 21:24:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:01,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-13 21:24:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:01,957 INFO L225 Difference]: With dead ends: 24470 [2019-10-13 21:24:01,957 INFO L226 Difference]: Without dead ends: 15751 [2019-10-13 21:24:01,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15751 states. [2019-10-13 21:24:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15751 to 15725. [2019-10-13 21:24:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-10-13 21:24:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 22868 transitions. [2019-10-13 21:24:02,960 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 22868 transitions. Word has length 147 [2019-10-13 21:24:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,961 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 22868 transitions. [2019-10-13 21:24:02,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 22868 transitions. [2019-10-13 21:24:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:24:02,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,975 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-13 21:24:02,976 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash -35990567, now seen corresponding path program 1 times [2019-10-13 21:24:02,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443827111] [2019-10-13 21:24:02,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:03,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443827111] [2019-10-13 21:24:03,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:03,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215524964] [2019-10-13 21:24:03,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:03,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:03,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:03,126 INFO L87 Difference]: Start difference. First operand 15725 states and 22868 transitions. Second operand 4 states. [2019-10-13 21:24:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:03,726 INFO L93 Difference]: Finished difference Result 26933 states and 39252 transitions. [2019-10-13 21:24:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:03,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 21:24:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:03,754 INFO L225 Difference]: With dead ends: 26933 [2019-10-13 21:24:03,755 INFO L226 Difference]: Without dead ends: 13923 [2019-10-13 21:24:03,877 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-13 21:24:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states. [2019-10-13 21:24:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13923. [2019-10-13 21:24:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-10-13 21:24:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 20193 transitions. [2019-10-13 21:24:04,499 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 20193 transitions. Word has length 147 [2019-10-13 21:24:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:04,499 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 20193 transitions. [2019-10-13 21:24:04,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 20193 transitions. [2019-10-13 21:24:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:24:04,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:04,511 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] [2019-10-13 21:24:04,511 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash 274548163, now seen corresponding path program 1 times [2019-10-13 21:24:04,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:04,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666155858] [2019-10-13 21:24:04,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:04,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:04,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666155858] [2019-10-13 21:24:04,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:04,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:04,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885805079] [2019-10-13 21:24:04,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:04,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:04,697 INFO L87 Difference]: Start difference. First operand 13923 states and 20193 transitions. Second operand 4 states. [2019-10-13 21:24:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:06,175 INFO L93 Difference]: Finished difference Result 40726 states and 59115 transitions. [2019-10-13 21:24:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:06,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:24:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:06,331 INFO L225 Difference]: With dead ends: 40726 [2019-10-13 21:24:06,331 INFO L226 Difference]: Without dead ends: 26846 [2019-10-13 21:24:06,356 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-13 21:24:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-10-13 21:24:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26786. [2019-10-13 21:24:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26786 states. [2019-10-13 21:24:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26786 states to 26786 states and 38548 transitions. [2019-10-13 21:24:08,357 INFO L78 Accepts]: Start accepts. Automaton has 26786 states and 38548 transitions. Word has length 150 [2019-10-13 21:24:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:08,358 INFO L462 AbstractCegarLoop]: Abstraction has 26786 states and 38548 transitions. [2019-10-13 21:24:08,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26786 states and 38548 transitions. [2019-10-13 21:24:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:24:08,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:08,376 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] [2019-10-13 21:24:08,376 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1258286695, now seen corresponding path program 1 times [2019-10-13 21:24:08,377 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:08,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473102511] [2019-10-13 21:24:08,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:08,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473102511] [2019-10-13 21:24:08,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:08,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:08,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791133781] [2019-10-13 21:24:08,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:08,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:08,445 INFO L87 Difference]: Start difference. First operand 26786 states and 38548 transitions. Second operand 3 states. [2019-10-13 21:24:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:10,341 INFO L93 Difference]: Finished difference Result 80164 states and 115393 transitions. [2019-10-13 21:24:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:10,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-13 21:24:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:10,432 INFO L225 Difference]: With dead ends: 80164 [2019-10-13 21:24:10,432 INFO L226 Difference]: Without dead ends: 53484 [2019-10-13 21:24:10,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53484 states. [2019-10-13 21:24:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53484 to 26792. [2019-10-13 21:24:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26792 states. [2019-10-13 21:24:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26792 states to 26792 states and 38554 transitions. [2019-10-13 21:24:12,098 INFO L78 Accepts]: Start accepts. Automaton has 26792 states and 38554 transitions. Word has length 151 [2019-10-13 21:24:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:12,099 INFO L462 AbstractCegarLoop]: Abstraction has 26792 states and 38554 transitions. [2019-10-13 21:24:12,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 26792 states and 38554 transitions. [2019-10-13 21:24:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:24:12,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:12,113 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] [2019-10-13 21:24:12,113 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:12,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1962958739, now seen corresponding path program 1 times [2019-10-13 21:24:12,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:12,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492789676] [2019-10-13 21:24:12,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:12,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:12,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:12,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492789676] [2019-10-13 21:24:12,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:12,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:12,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769540142] [2019-10-13 21:24:12,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:12,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:12,227 INFO L87 Difference]: Start difference. First operand 26792 states and 38554 transitions. Second operand 3 states. [2019-10-13 21:24:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:15,254 INFO L93 Difference]: Finished difference Result 71898 states and 103214 transitions. [2019-10-13 21:24:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:15,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-13 21:24:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:15,305 INFO L225 Difference]: With dead ends: 71898 [2019-10-13 21:24:15,305 INFO L226 Difference]: Without dead ends: 45796 [2019-10-13 21:24:15,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45796 states. [2019-10-13 21:24:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45796 to 45736. [2019-10-13 21:24:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45736 states. [2019-10-13 21:24:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45736 states to 45736 states and 64696 transitions. [2019-10-13 21:24:17,539 INFO L78 Accepts]: Start accepts. Automaton has 45736 states and 64696 transitions. Word has length 152 [2019-10-13 21:24:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:17,539 INFO L462 AbstractCegarLoop]: Abstraction has 45736 states and 64696 transitions. [2019-10-13 21:24:17,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 45736 states and 64696 transitions. [2019-10-13 21:24:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:24:17,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:17,561 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] [2019-10-13 21:24:17,561 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 800440458, now seen corresponding path program 1 times [2019-10-13 21:24:17,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:17,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113594334] [2019-10-13 21:24:17,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:17,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113594334] [2019-10-13 21:24:17,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:17,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:17,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254319186] [2019-10-13 21:24:17,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:17,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:17,711 INFO L87 Difference]: Start difference. First operand 45736 states and 64696 transitions. Second operand 4 states. [2019-10-13 21:24:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:19,747 INFO L93 Difference]: Finished difference Result 84797 states and 119985 transitions. [2019-10-13 21:24:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:19,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 21:24:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:19,791 INFO L225 Difference]: With dead ends: 84797 [2019-10-13 21:24:19,791 INFO L226 Difference]: Without dead ends: 39689 [2019-10-13 21:24:19,819 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-13 21:24:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39689 states.