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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:49,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:49,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:49,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:49,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:49,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:49,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:49,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:49,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:49,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:49,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:49,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:49,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:49,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:49,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:49,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:49,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:49,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:49,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:49,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:49,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:49,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:49,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:49,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:49,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:49,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:49,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:49,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:49,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:49,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:49,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:49,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:49,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:49,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:49,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:49,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:49,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:49,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:49,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:49,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:49,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:49,216 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:49,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:49,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:49,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:49,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:49,232 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:49,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:49,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:49,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:49,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:49,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:49,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:49,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:49,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:49,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:49,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:49,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:49,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:49,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:49,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:49,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:49,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:49,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:49,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:49,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:49,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:49,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:49,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:49,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:49,237 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:49,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:49,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:49,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:49,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:49,554 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:49,555 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:23:49,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ddefc34/2f8313fbaa2c44c0acf0a8e7bbded4f2/FLAGb55b5f0d1 [2019-10-13 21:23:50,195 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:50,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:23:50,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ddefc34/2f8313fbaa2c44c0acf0a8e7bbded4f2/FLAGb55b5f0d1 [2019-10-13 21:23:50,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ddefc34/2f8313fbaa2c44c0acf0a8e7bbded4f2 [2019-10-13 21:23:50,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:50,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:50,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:50,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:50,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:50,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:50" (1/1) ... [2019-10-13 21:23:50,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392121d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:50, skipping insertion in model container [2019-10-13 21:23:50,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:50" (1/1) ... [2019-10-13 21:23:50,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:50,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:51,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:51,262 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:51,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:51,747 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:51,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:51 WrapperNode [2019-10-13 21:23:51,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:51,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:51,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:51,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:51,759 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:51" (1/1) ... [2019-10-13 21:23:51,760 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:51" (1/1) ... [2019-10-13 21:23:51,778 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:51" (1/1) ... [2019-10-13 21:23:51,779 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:51" (1/1) ... [2019-10-13 21:23:51,808 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:51" (1/1) ... [2019-10-13 21:23:51,832 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:51" (1/1) ... [2019-10-13 21:23:51,842 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:51" (1/1) ... [2019-10-13 21:23:51,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:51,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:51,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:51,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:51,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:51" (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:51,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:51,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:51,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:23:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:53,669 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:53,669 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:53,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:53 BoogieIcfgContainer [2019-10-13 21:23:53,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:53,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:53,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:53,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:53,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:50" (1/3) ... [2019-10-13 21:23:53,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3780a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:53, skipping insertion in model container [2019-10-13 21:23:53,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:51" (2/3) ... [2019-10-13 21:23:53,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3780a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:53, skipping insertion in model container [2019-10-13 21:23:53,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:53" (3/3) ... [2019-10-13 21:23:53,681 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:23:53,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:53,712 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:23:53,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:23:53,769 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:53,769 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:53,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:53,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:53,770 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:53,770 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:53,770 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:53,770 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-10-13 21:23:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:23:53,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -242885028, now seen corresponding path program 1 times [2019-10-13 21:23:53,868 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427851923] [2019-10-13 21:23:53,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,607 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,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427851923] [2019-10-13 21:23:54,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:54,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353045219] [2019-10-13 21:23:54,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:54,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:54,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:54,634 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 3 states. [2019-10-13 21:23:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:54,842 INFO L93 Difference]: Finished difference Result 692 states and 1229 transitions. [2019-10-13 21:23:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:54,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-13 21:23:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:54,881 INFO L225 Difference]: With dead ends: 692 [2019-10-13 21:23:54,882 INFO L226 Difference]: Without dead ends: 537 [2019-10-13 21:23:54,889 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:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-13 21:23:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-10-13 21:23:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-13 21:23:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2019-10-13 21:23:55,024 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 142 [2019-10-13 21:23:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,027 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2019-10-13 21:23:55,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2019-10-13 21:23:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:23:55,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1296834716, now seen corresponding path program 1 times [2019-10-13 21:23:55,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700356724] [2019-10-13 21:23:55,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,255 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,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700356724] [2019-10-13 21:23:55,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:55,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528902866] [2019-10-13 21:23:55,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:55,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:55,261 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand 3 states. [2019-10-13 21:23:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,402 INFO L93 Difference]: Finished difference Result 1070 states and 1613 transitions. [2019-10-13 21:23:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:55,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-13 21:23:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:55,412 INFO L225 Difference]: With dead ends: 1070 [2019-10-13 21:23:55,412 INFO L226 Difference]: Without dead ends: 853 [2019-10-13 21:23:55,418 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,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-13 21:23:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851. [2019-10-13 21:23:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-10-13 21:23:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1260 transitions. [2019-10-13 21:23:55,491 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1260 transitions. Word has length 142 [2019-10-13 21:23:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,492 INFO L462 AbstractCegarLoop]: Abstraction has 851 states and 1260 transitions. [2019-10-13 21:23:55,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1260 transitions. [2019-10-13 21:23:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:23:55,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,497 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,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash 156483868, now seen corresponding path program 1 times [2019-10-13 21:23:55,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617548691] [2019-10-13 21:23:55,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,863 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,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617548691] [2019-10-13 21:23:55,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:55,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699028311] [2019-10-13 21:23:55,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:55,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:55,872 INFO L87 Difference]: Start difference. First operand 851 states and 1260 transitions. Second operand 4 states. [2019-10-13 21:23:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,040 INFO L93 Difference]: Finished difference Result 2496 states and 3689 transitions. [2019-10-13 21:23:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:56,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:23:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,049 INFO L225 Difference]: With dead ends: 2496 [2019-10-13 21:23:56,050 INFO L226 Difference]: Without dead ends: 1658 [2019-10-13 21:23:56,054 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:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-10-13 21:23:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1630. [2019-10-13 21:23:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-10-13 21:23:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2403 transitions. [2019-10-13 21:23:56,158 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2403 transitions. Word has length 142 [2019-10-13 21:23:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,158 INFO L462 AbstractCegarLoop]: Abstraction has 1630 states and 2403 transitions. [2019-10-13 21:23:56,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2403 transitions. [2019-10-13 21:23:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:23:56,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,162 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] [2019-10-13 21:23:56,162 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1506911746, now seen corresponding path program 1 times [2019-10-13 21:23:56,163 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381728219] [2019-10-13 21:23:56,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:56,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381728219] [2019-10-13 21:23:56,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:56,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975446611] [2019-10-13 21:23:56,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:56,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,275 INFO L87 Difference]: Start difference. First operand 1630 states and 2403 transitions. Second operand 3 states. [2019-10-13 21:23:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,423 INFO L93 Difference]: Finished difference Result 4844 states and 7139 transitions. [2019-10-13 21:23:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:56,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-13 21:23:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,442 INFO L225 Difference]: With dead ends: 4844 [2019-10-13 21:23:56,442 INFO L226 Difference]: Without dead ends: 3246 [2019-10-13 21:23:56,447 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,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2019-10-13 21:23:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 1632. [2019-10-13 21:23:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2019-10-13 21:23:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2405 transitions. [2019-10-13 21:23:56,591 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2405 transitions. Word has length 143 [2019-10-13 21:23:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,592 INFO L462 AbstractCegarLoop]: Abstraction has 1632 states and 2405 transitions. [2019-10-13 21:23:56,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2405 transitions. [2019-10-13 21:23:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:23:56,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,598 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] [2019-10-13 21:23:56,599 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash -705286279, now seen corresponding path program 1 times [2019-10-13 21:23:56,600 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441070694] [2019-10-13 21:23:56,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,792 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,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441070694] [2019-10-13 21:23:56,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:56,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900083552] [2019-10-13 21:23:56,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:56,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,796 INFO L87 Difference]: Start difference. First operand 1632 states and 2405 transitions. Second operand 3 states. [2019-10-13 21:23:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,088 INFO L93 Difference]: Finished difference Result 4281 states and 6311 transitions. [2019-10-13 21:23:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:57,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-13 21:23:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,106 INFO L225 Difference]: With dead ends: 4281 [2019-10-13 21:23:57,106 INFO L226 Difference]: Without dead ends: 2829 [2019-10-13 21:23:57,110 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:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-10-13 21:23:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2801. [2019-10-13 21:23:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2019-10-13 21:23:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4081 transitions. [2019-10-13 21:23:57,271 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4081 transitions. Word has length 144 [2019-10-13 21:23:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,273 INFO L462 AbstractCegarLoop]: Abstraction has 2801 states and 4081 transitions. [2019-10-13 21:23:57,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4081 transitions. [2019-10-13 21:23:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:23:57,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,279 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] [2019-10-13 21:23:57,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2069030422, now seen corresponding path program 1 times [2019-10-13 21:23:57,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471359229] [2019-10-13 21:23:57,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,497 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,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471359229] [2019-10-13 21:23:57,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:57,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040139613] [2019-10-13 21:23:57,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:57,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:57,500 INFO L87 Difference]: Start difference. First operand 2801 states and 4081 transitions. Second operand 4 states. [2019-10-13 21:23:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,647 INFO L93 Difference]: Finished difference Result 5024 states and 7338 transitions. [2019-10-13 21:23:57,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:57,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-10-13 21:23:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,659 INFO L225 Difference]: With dead ends: 5024 [2019-10-13 21:23:57,659 INFO L226 Difference]: Without dead ends: 2393 [2019-10-13 21:23:57,665 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:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2019-10-13 21:23:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2019-10-13 21:23:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-10-13 21:23:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3482 transitions. [2019-10-13 21:23:57,827 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3482 transitions. Word has length 144 [2019-10-13 21:23:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,828 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3482 transitions. [2019-10-13 21:23:57,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3482 transitions. [2019-10-13 21:23:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:57,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,832 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:23:57,833 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash -839538967, now seen corresponding path program 1 times [2019-10-13 21:23:57,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419560335] [2019-10-13 21:23:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,158 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:58,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419560335] [2019-10-13 21:23:58,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 21:23:58,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84098189] [2019-10-13 21:23:58,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:23:58,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:23:58,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:23:58,162 INFO L87 Difference]: Start difference. First operand 2393 states and 3482 transitions. Second operand 13 states. [2019-10-13 21:24:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,282 INFO L93 Difference]: Finished difference Result 10628 states and 16267 transitions. [2019-10-13 21:24:02,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:24:02,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-10-13 21:24:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,323 INFO L225 Difference]: With dead ends: 10628 [2019-10-13 21:24:02,323 INFO L226 Difference]: Without dead ends: 8437 [2019-10-13 21:24:02,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:24:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2019-10-13 21:24:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 5241. [2019-10-13 21:24:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5241 states. [2019-10-13 21:24:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 7870 transitions. [2019-10-13 21:24:02,766 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 7870 transitions. Word has length 147 [2019-10-13 21:24:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,767 INFO L462 AbstractCegarLoop]: Abstraction has 5241 states and 7870 transitions. [2019-10-13 21:24:02,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:24:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 7870 transitions. [2019-10-13 21:24:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:24:02,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,775 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,776 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1983851261, now seen corresponding path program 1 times [2019-10-13 21:24:02,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95244408] [2019-10-13 21:24:02,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,972 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:02,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95244408] [2019-10-13 21:24:02,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:02,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756983315] [2019-10-13 21:24:02,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:02,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:02,975 INFO L87 Difference]: Start difference. First operand 5241 states and 7870 transitions. Second operand 5 states. [2019-10-13 21:24:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:03,375 INFO L93 Difference]: Finished difference Result 7383 states and 11193 transitions. [2019-10-13 21:24:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:03,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:24:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:03,389 INFO L225 Difference]: With dead ends: 7383 [2019-10-13 21:24:03,389 INFO L226 Difference]: Without dead ends: 2962 [2019-10-13 21:24:03,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-10-13 21:24:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2393. [2019-10-13 21:24:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-10-13 21:24:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3467 transitions. [2019-10-13 21:24:03,520 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3467 transitions. Word has length 147 [2019-10-13 21:24:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:03,520 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3467 transitions. [2019-10-13 21:24:03,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3467 transitions. [2019-10-13 21:24:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:24:03,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:03,524 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:03,525 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1902905006, now seen corresponding path program 1 times [2019-10-13 21:24:03,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:03,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028353433] [2019-10-13 21:24:03,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:03,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028353433] [2019-10-13 21:24:03,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:03,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623719385] [2019-10-13 21:24:03,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:03,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:03,849 INFO L87 Difference]: Start difference. First operand 2393 states and 3467 transitions. Second operand 9 states. [2019-10-13 21:24:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:05,240 INFO L93 Difference]: Finished difference Result 8933 states and 13661 transitions. [2019-10-13 21:24:05,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:24:05,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-13 21:24:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:05,268 INFO L225 Difference]: With dead ends: 8933 [2019-10-13 21:24:05,268 INFO L226 Difference]: Without dead ends: 6742 [2019-10-13 21:24:05,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:24:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2019-10-13 21:24:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 4124. [2019-10-13 21:24:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-10-13 21:24:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 6152 transitions. [2019-10-13 21:24:05,545 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 6152 transitions. Word has length 147 [2019-10-13 21:24:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:05,545 INFO L462 AbstractCegarLoop]: Abstraction has 4124 states and 6152 transitions. [2019-10-13 21:24:05,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 6152 transitions. [2019-10-13 21:24:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:24:05,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:05,550 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:05,550 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:05,553 INFO L82 PathProgramCache]: Analyzing trace with hash 431327938, now seen corresponding path program 1 times [2019-10-13 21:24:05,553 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:05,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014175548] [2019-10-13 21:24:05,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:05,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014175548] [2019-10-13 21:24:05,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:05,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:05,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319386695] [2019-10-13 21:24:05,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:05,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:05,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:05,765 INFO L87 Difference]: Start difference. First operand 4124 states and 6152 transitions. Second operand 4 states. [2019-10-13 21:24:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:06,435 INFO L93 Difference]: Finished difference Result 10839 states and 16152 transitions. [2019-10-13 21:24:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:06,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 21:24:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:06,452 INFO L225 Difference]: With dead ends: 10839 [2019-10-13 21:24:06,452 INFO L226 Difference]: Without dead ends: 6738 [2019-10-13 21:24:06,460 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,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2019-10-13 21:24:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6716. [2019-10-13 21:24:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6716 states. [2019-10-13 21:24:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 9913 transitions. [2019-10-13 21:24:06,832 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 9913 transitions. Word has length 147 [2019-10-13 21:24:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:06,833 INFO L462 AbstractCegarLoop]: Abstraction has 6716 states and 9913 transitions. [2019-10-13 21:24:06,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 9913 transitions. [2019-10-13 21:24:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:24:06,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:06,839 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] [2019-10-13 21:24:06,839 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 569231315, now seen corresponding path program 1 times [2019-10-13 21:24:06,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:06,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372857256] [2019-10-13 21:24:06,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:07,017 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:07,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372857256] [2019-10-13 21:24:07,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:07,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:07,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810033486] [2019-10-13 21:24:07,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:07,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:07,020 INFO L87 Difference]: Start difference. First operand 6716 states and 9913 transitions. Second operand 3 states. [2019-10-13 21:24:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:07,857 INFO L93 Difference]: Finished difference Result 19274 states and 28571 transitions. [2019-10-13 21:24:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:07,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:24:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:07,888 INFO L225 Difference]: With dead ends: 19274 [2019-10-13 21:24:07,889 INFO L226 Difference]: Without dead ends: 12911 [2019-10-13 21:24:07,904 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:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12911 states. [2019-10-13 21:24:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12911 to 12891. [2019-10-13 21:24:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2019-10-13 21:24:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 18910 transitions. [2019-10-13 21:24:08,758 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 18910 transitions. Word has length 149 [2019-10-13 21:24:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:08,758 INFO L462 AbstractCegarLoop]: Abstraction has 12891 states and 18910 transitions. [2019-10-13 21:24:08,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 18910 transitions. [2019-10-13 21:24:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:24:08,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:08,767 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] [2019-10-13 21:24:08,768 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2112573418, now seen corresponding path program 1 times [2019-10-13 21:24:08,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:08,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795263984] [2019-10-13 21:24:08,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:08,897 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,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795263984] [2019-10-13 21:24:08,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:08,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:08,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273039220] [2019-10-13 21:24:08,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:08,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:08,902 INFO L87 Difference]: Start difference. First operand 12891 states and 18910 transitions. Second operand 4 states. [2019-10-13 21:24:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:09,429 INFO L93 Difference]: Finished difference Result 20704 states and 30338 transitions. [2019-10-13 21:24:09,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:09,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-13 21:24:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:09,451 INFO L225 Difference]: With dead ends: 20704 [2019-10-13 21:24:09,451 INFO L226 Difference]: Without dead ends: 10439 [2019-10-13 21:24:09,468 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:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10439 states. [2019-10-13 21:24:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10439 to 10439. [2019-10-13 21:24:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10439 states. [2019-10-13 21:24:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10439 states to 10439 states and 15246 transitions. [2019-10-13 21:24:10,259 INFO L78 Accepts]: Start accepts. Automaton has 10439 states and 15246 transitions. Word has length 149 [2019-10-13 21:24:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:10,260 INFO L462 AbstractCegarLoop]: Abstraction has 10439 states and 15246 transitions. [2019-10-13 21:24:10,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 10439 states and 15246 transitions. [2019-10-13 21:24:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:24:10,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:10,272 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:10,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash 424881092, now seen corresponding path program 1 times [2019-10-13 21:24:10,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:10,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564875466] [2019-10-13 21:24:10,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:10,450 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:10,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564875466] [2019-10-13 21:24:10,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:10,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:10,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674813385] [2019-10-13 21:24:10,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:10,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:10,453 INFO L87 Difference]: Start difference. First operand 10439 states and 15246 transitions. Second operand 4 states. [2019-10-13 21:24:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:11,906 INFO L93 Difference]: Finished difference Result 30627 states and 44764 transitions. [2019-10-13 21:24:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:11,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 21:24:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:11,933 INFO L225 Difference]: With dead ends: 30627 [2019-10-13 21:24:11,933 INFO L226 Difference]: Without dead ends: 20231 [2019-10-13 21:24:11,952 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:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-10-13 21:24:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 20191. [2019-10-13 21:24:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20191 states. [2019-10-13 21:24:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 29305 transitions. [2019-10-13 21:24:13,142 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 29305 transitions. Word has length 152 [2019-10-13 21:24:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:13,142 INFO L462 AbstractCegarLoop]: Abstraction has 20191 states and 29305 transitions. [2019-10-13 21:24:13,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 29305 transitions. [2019-10-13 21:24:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:24:13,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:13,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:13,154 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash 598575340, now seen corresponding path program 1 times [2019-10-13 21:24:13,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:13,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488868450] [2019-10-13 21:24:13,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:13,221 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:13,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488868450] [2019-10-13 21:24:13,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:13,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:13,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573920987] [2019-10-13 21:24:13,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:13,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:13,224 INFO L87 Difference]: Start difference. First operand 20191 states and 29305 transitions. Second operand 3 states. [2019-10-13 21:24:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:15,548 INFO L93 Difference]: Finished difference Result 60381 states and 87668 transitions. [2019-10-13 21:24:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:15,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:24:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:15,600 INFO L225 Difference]: With dead ends: 60381 [2019-10-13 21:24:15,600 INFO L226 Difference]: Without dead ends: 40295 [2019-10-13 21:24:15,637 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,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40295 states. [2019-10-13 21:24:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40295 to 20197. [2019-10-13 21:24:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20197 states. [2019-10-13 21:24:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20197 states to 20197 states and 29311 transitions. [2019-10-13 21:24:17,652 INFO L78 Accepts]: Start accepts. Automaton has 20197 states and 29311 transitions. Word has length 153 [2019-10-13 21:24:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:17,653 INFO L462 AbstractCegarLoop]: Abstraction has 20197 states and 29311 transitions. [2019-10-13 21:24:17,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20197 states and 29311 transitions. [2019-10-13 21:24:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:17,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:17,665 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:17,665 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1058530053, now seen corresponding path program 1 times [2019-10-13 21:24:17,665 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:17,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774359616] [2019-10-13 21:24:17,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:17,794 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,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774359616] [2019-10-13 21:24:17,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:17,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:17,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529191859] [2019-10-13 21:24:17,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:17,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:17,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:17,796 INFO L87 Difference]: Start difference. First operand 20197 states and 29311 transitions. Second operand 4 states. [2019-10-13 21:24:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:19,041 INFO L93 Difference]: Finished difference Result 40352 states and 58566 transitions. [2019-10-13 21:24:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:19,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 21:24:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:19,066 INFO L225 Difference]: With dead ends: 40352 [2019-10-13 21:24:19,066 INFO L226 Difference]: Without dead ends: 20191 [2019-10-13 21:24:19,083 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,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-10-13 21:24:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 20191. [2019-10-13 21:24:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20191 states. [2019-10-13 21:24:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 29299 transitions. [2019-10-13 21:24:20,200 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 29299 transitions. Word has length 154 [2019-10-13 21:24:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:20,201 INFO L462 AbstractCegarLoop]: Abstraction has 20191 states and 29299 transitions. [2019-10-13 21:24:20,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 29299 transitions. [2019-10-13 21:24:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:20,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:20,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:20,213 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1392175557, now seen corresponding path program 1 times [2019-10-13 21:24:20,214 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:20,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623912861] [2019-10-13 21:24:20,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:20,308 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:20,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623912861] [2019-10-13 21:24:20,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:20,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:20,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630494958] [2019-10-13 21:24:20,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:20,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:20,317 INFO L87 Difference]: Start difference. First operand 20191 states and 29299 transitions. Second operand 3 states. [2019-10-13 21:24:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:22,148 INFO L93 Difference]: Finished difference Result 49506 states and 71780 transitions. [2019-10-13 21:24:22,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:22,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-13 21:24:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:22,186 INFO L225 Difference]: With dead ends: 49506 [2019-10-13 21:24:22,186 INFO L226 Difference]: Without dead ends: 29990 [2019-10-13 21:24:22,211 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:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29990 states. [2019-10-13 21:24:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29990 to 29950. [2019-10-13 21:24:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29950 states. [2019-10-13 21:24:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29950 states to 29950 states and 42762 transitions. [2019-10-13 21:24:24,066 INFO L78 Accepts]: Start accepts. Automaton has 29950 states and 42762 transitions. Word has length 154 [2019-10-13 21:24:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:24,066 INFO L462 AbstractCegarLoop]: Abstraction has 29950 states and 42762 transitions. [2019-10-13 21:24:24,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 29950 states and 42762 transitions. [2019-10-13 21:24:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:24:24,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:24,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:24,079 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 734640385, now seen corresponding path program 1 times [2019-10-13 21:24:24,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:24,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899069361] [2019-10-13 21:24:24,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:24,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899069361] [2019-10-13 21:24:24,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:24,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 21:24:24,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215339344] [2019-10-13 21:24:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:24:24,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:24:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:24:24,315 INFO L87 Difference]: Start difference. First operand 29950 states and 42762 transitions. Second operand 11 states.