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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:42,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:42,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:42,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:42,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:42,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:42,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:42,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:42,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:42,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:42,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:42,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:42,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:42,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:42,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:42,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:42,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:42,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:42,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:42,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:42,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:42,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:42,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:42,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:42,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:42,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:42,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:42,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:42,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:42,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:42,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:42,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:42,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:42,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:42,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:42,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:42,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:42,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:42,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:42,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:42,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:42,529 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:24:42,549 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:42,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:42,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:42,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:42,553 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:42,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:42,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:42,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:42,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:42,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:42,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:42,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:42,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:42,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:42,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:42,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:42,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:42,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:42,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:42,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:42,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:42,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:42,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:42,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:42,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:42,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:42,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:42,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:42,558 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:24:42,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:42,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:42,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:42,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:42,886 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:42,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:24:42,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853a19a88/fef74a5f87c04960a9088e984c1dec45/FLAG20bdc41e6 [2019-10-13 21:24:43,598 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:43,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:24:43,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853a19a88/fef74a5f87c04960a9088e984c1dec45/FLAG20bdc41e6 [2019-10-13 21:24:43,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853a19a88/fef74a5f87c04960a9088e984c1dec45 [2019-10-13 21:24:43,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:43,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:43,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:43,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:43,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:43,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46892c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43, skipping insertion in model container [2019-10-13 21:24:43,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:43,922 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:44,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:44,632 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:45,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:45,075 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:45,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45 WrapperNode [2019-10-13 21:24:45,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:45,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:45,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:45,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:45,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:45,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:45,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:45,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:45,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (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:24:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:47,095 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:47,096 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:47,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:47 BoogieIcfgContainer [2019-10-13 21:24:47,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:47,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:47,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:47,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:47,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:43" (1/3) ... [2019-10-13 21:24:47,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cb4086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:47, skipping insertion in model container [2019-10-13 21:24:47,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (2/3) ... [2019-10-13 21:24:47,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cb4086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:47, skipping insertion in model container [2019-10-13 21:24:47,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:47" (3/3) ... [2019-10-13 21:24:47,107 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:24:47,116 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:47,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:24:47,136 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:24:47,166 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:47,167 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:47,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:47,167 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:47,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:47,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:47,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:47,168 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-10-13 21:24:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:24:47,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:47,219 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:47,220 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash 42890573, now seen corresponding path program 1 times [2019-10-13 21:24:47,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:47,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772533098] [2019-10-13 21:24:47,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,252 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:48,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772533098] [2019-10-13 21:24:48,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:48,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227082259] [2019-10-13 21:24:48,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:48,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:48,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:48,279 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 4 states. [2019-10-13 21:24:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,553 INFO L93 Difference]: Finished difference Result 1212 states and 2155 transitions. [2019-10-13 21:24:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:48,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 21:24:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:48,577 INFO L225 Difference]: With dead ends: 1212 [2019-10-13 21:24:48,577 INFO L226 Difference]: Without dead ends: 799 [2019-10-13 21:24:48,584 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:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-13 21:24:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2019-10-13 21:24:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-13 21:24:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1109 transitions. [2019-10-13 21:24:48,704 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1109 transitions. Word has length 152 [2019-10-13 21:24:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:48,705 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1109 transitions. [2019-10-13 21:24:48,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1109 transitions. [2019-10-13 21:24:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:24:48,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,712 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:48,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash -832663523, now seen corresponding path program 1 times [2019-10-13 21:24:48,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145741659] [2019-10-13 21:24:48,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:48,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145741659] [2019-10-13 21:24:48,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:48,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249986225] [2019-10-13 21:24:48,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:48,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:48,880 INFO L87 Difference]: Start difference. First operand 773 states and 1109 transitions. Second operand 3 states. [2019-10-13 21:24:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,991 INFO L93 Difference]: Finished difference Result 2273 states and 3257 transitions. [2019-10-13 21:24:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:48,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:24:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,005 INFO L225 Difference]: With dead ends: 2273 [2019-10-13 21:24:49,005 INFO L226 Difference]: Without dead ends: 1532 [2019-10-13 21:24:49,011 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:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-10-13 21:24:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 775. [2019-10-13 21:24:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-10-13 21:24:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1111 transitions. [2019-10-13 21:24:49,091 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1111 transitions. Word has length 153 [2019-10-13 21:24:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,094 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1111 transitions. [2019-10-13 21:24:49,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1111 transitions. [2019-10-13 21:24:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:49,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,110 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:49,112 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1878298894, now seen corresponding path program 1 times [2019-10-13 21:24:49,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413985612] [2019-10-13 21:24:49,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,473 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:49,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413985612] [2019-10-13 21:24:49,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:49,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917945402] [2019-10-13 21:24:49,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:49,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:49,479 INFO L87 Difference]: Start difference. First operand 775 states and 1111 transitions. Second operand 4 states. [2019-10-13 21:24:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,546 INFO L93 Difference]: Finished difference Result 1532 states and 2197 transitions. [2019-10-13 21:24:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:49,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 21:24:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,553 INFO L225 Difference]: With dead ends: 1532 [2019-10-13 21:24:49,553 INFO L226 Difference]: Without dead ends: 775 [2019-10-13 21:24:49,556 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:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-13 21:24:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-10-13 21:24:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-13 21:24:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1108 transitions. [2019-10-13 21:24:49,590 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1108 transitions. Word has length 154 [2019-10-13 21:24:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,590 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1108 transitions. [2019-10-13 21:24:49,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1108 transitions. [2019-10-13 21:24:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:49,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,593 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:49,593 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1636071890, now seen corresponding path program 1 times [2019-10-13 21:24:49,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354493213] [2019-10-13 21:24:49,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,744 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:49,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354493213] [2019-10-13 21:24:49,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:49,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989285214] [2019-10-13 21:24:49,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:49,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:49,746 INFO L87 Difference]: Start difference. First operand 774 states and 1108 transitions. Second operand 4 states. [2019-10-13 21:24:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,820 INFO L93 Difference]: Finished difference Result 1535 states and 2199 transitions. [2019-10-13 21:24:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:49,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 21:24:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,827 INFO L225 Difference]: With dead ends: 1535 [2019-10-13 21:24:49,827 INFO L226 Difference]: Without dead ends: 772 [2019-10-13 21:24:49,830 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:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-10-13 21:24:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2019-10-13 21:24:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-13 21:24:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1104 transitions. [2019-10-13 21:24:49,875 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1104 transitions. Word has length 154 [2019-10-13 21:24:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,875 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1104 transitions. [2019-10-13 21:24:49,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1104 transitions. [2019-10-13 21:24:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:49,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,879 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:49,879 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash -674126987, now seen corresponding path program 1 times [2019-10-13 21:24:49,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173697318] [2019-10-13 21:24:49,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,052 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:50,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173697318] [2019-10-13 21:24:50,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627608462] [2019-10-13 21:24:50,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,094 INFO L87 Difference]: Start difference. First operand 772 states and 1104 transitions. Second operand 3 states. [2019-10-13 21:24:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,197 INFO L93 Difference]: Finished difference Result 1732 states and 2480 transitions. [2019-10-13 21:24:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-13 21:24:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,206 INFO L225 Difference]: With dead ends: 1732 [2019-10-13 21:24:50,206 INFO L226 Difference]: Without dead ends: 1156 [2019-10-13 21:24:50,208 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:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-13 21:24:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1130. [2019-10-13 21:24:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-13 21:24:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1602 transitions. [2019-10-13 21:24:50,272 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1602 transitions. Word has length 154 [2019-10-13 21:24:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,273 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1602 transitions. [2019-10-13 21:24:50,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1602 transitions. [2019-10-13 21:24:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:50,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,278 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] [2019-10-13 21:24:50,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1140766677, now seen corresponding path program 1 times [2019-10-13 21:24:50,279 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432814544] [2019-10-13 21:24:50,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,366 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:50,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432814544] [2019-10-13 21:24:50,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61000728] [2019-10-13 21:24:50,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,369 INFO L87 Difference]: Start difference. First operand 1130 states and 1602 transitions. Second operand 3 states. [2019-10-13 21:24:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,484 INFO L93 Difference]: Finished difference Result 2442 states and 3547 transitions. [2019-10-13 21:24:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 21:24:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,497 INFO L225 Difference]: With dead ends: 2442 [2019-10-13 21:24:50,497 INFO L226 Difference]: Without dead ends: 1501 [2019-10-13 21:24:50,500 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:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-10-13 21:24:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1342. [2019-10-13 21:24:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-13 21:24:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1945 transitions. [2019-10-13 21:24:50,577 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1945 transitions. Word has length 156 [2019-10-13 21:24:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,578 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1945 transitions. [2019-10-13 21:24:50,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1945 transitions. [2019-10-13 21:24:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:50,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,581 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] [2019-10-13 21:24:50,582 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1542236816, now seen corresponding path program 1 times [2019-10-13 21:24:50,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901400069] [2019-10-13 21:24:50,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,727 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:50,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901400069] [2019-10-13 21:24:50,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963019872] [2019-10-13 21:24:50,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,730 INFO L87 Difference]: Start difference. First operand 1342 states and 1945 transitions. Second operand 3 states. [2019-10-13 21:24:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,889 INFO L93 Difference]: Finished difference Result 2987 states and 4450 transitions. [2019-10-13 21:24:50,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:24:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,901 INFO L225 Difference]: With dead ends: 2987 [2019-10-13 21:24:50,901 INFO L226 Difference]: Without dead ends: 1918 [2019-10-13 21:24:50,905 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:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-10-13 21:24:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1719. [2019-10-13 21:24:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-10-13 21:24:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2553 transitions. [2019-10-13 21:24:51,009 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2553 transitions. Word has length 158 [2019-10-13 21:24:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,009 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2553 transitions. [2019-10-13 21:24:51,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2553 transitions. [2019-10-13 21:24:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:51,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,013 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] [2019-10-13 21:24:51,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1399172685, now seen corresponding path program 1 times [2019-10-13 21:24:51,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62459073] [2019-10-13 21:24:51,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,202 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:51,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62459073] [2019-10-13 21:24:51,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:51,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537452569] [2019-10-13 21:24:51,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:51,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:51,205 INFO L87 Difference]: Start difference. First operand 1719 states and 2553 transitions. Second operand 5 states. [2019-10-13 21:24:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,804 INFO L93 Difference]: Finished difference Result 4371 states and 6633 transitions. [2019-10-13 21:24:51,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:51,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-13 21:24:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,819 INFO L225 Difference]: With dead ends: 4371 [2019-10-13 21:24:51,819 INFO L226 Difference]: Without dead ends: 2835 [2019-10-13 21:24:51,824 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:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-10-13 21:24:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2833. [2019-10-13 21:24:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-10-13 21:24:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4278 transitions. [2019-10-13 21:24:51,998 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4278 transitions. Word has length 159 [2019-10-13 21:24:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,999 INFO L462 AbstractCegarLoop]: Abstraction has 2833 states and 4278 transitions. [2019-10-13 21:24:51,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4278 transitions. [2019-10-13 21:24:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:52,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,003 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] [2019-10-13 21:24:52,004 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1519156504, now seen corresponding path program 1 times [2019-10-13 21:24:52,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162936800] [2019-10-13 21:24:52,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,240 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:52,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162936800] [2019-10-13 21:24:52,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:52,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708896680] [2019-10-13 21:24:52,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:52,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:52,245 INFO L87 Difference]: Start difference. First operand 2833 states and 4278 transitions. Second operand 4 states. [2019-10-13 21:24:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:52,623 INFO L93 Difference]: Finished difference Result 7338 states and 11090 transitions. [2019-10-13 21:24:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:52,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-13 21:24:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:52,647 INFO L225 Difference]: With dead ends: 7338 [2019-10-13 21:24:52,648 INFO L226 Difference]: Without dead ends: 4536 [2019-10-13 21:24:52,654 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:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-13 21:24:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4513. [2019-10-13 21:24:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2019-10-13 21:24:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6769 transitions. [2019-10-13 21:24:52,925 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6769 transitions. Word has length 159 [2019-10-13 21:24:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:52,925 INFO L462 AbstractCegarLoop]: Abstraction has 4513 states and 6769 transitions. [2019-10-13 21:24:52,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6769 transitions. [2019-10-13 21:24:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:24:52,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:52,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,933 INFO L82 PathProgramCache]: Analyzing trace with hash 779025742, now seen corresponding path program 1 times [2019-10-13 21:24:52,934 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474630524] [2019-10-13 21:24:52,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,044 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:53,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474630524] [2019-10-13 21:24:53,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:53,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212333276] [2019-10-13 21:24:53,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:53,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:53,048 INFO L87 Difference]: Start difference. First operand 4513 states and 6769 transitions. Second operand 3 states. [2019-10-13 21:24:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:53,502 INFO L93 Difference]: Finished difference Result 11128 states and 16749 transitions. [2019-10-13 21:24:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:53,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:24:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,538 INFO L225 Difference]: With dead ends: 11128 [2019-10-13 21:24:53,538 INFO L226 Difference]: Without dead ends: 6987 [2019-10-13 21:24:53,548 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:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2019-10-13 21:24:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6966. [2019-10-13 21:24:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-10-13 21:24:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 10335 transitions. [2019-10-13 21:24:54,026 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 10335 transitions. Word has length 161 [2019-10-13 21:24:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,027 INFO L462 AbstractCegarLoop]: Abstraction has 6966 states and 10335 transitions. [2019-10-13 21:24:54,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 10335 transitions. [2019-10-13 21:24:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:24:54,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,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, 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:54,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,037 INFO L82 PathProgramCache]: Analyzing trace with hash -169339511, now seen corresponding path program 1 times [2019-10-13 21:24:54,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762391953] [2019-10-13 21:24:54,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:54,136 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:54,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762391953] [2019-10-13 21:24:54,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:54,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:54,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576851193] [2019-10-13 21:24:54,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:54,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:54,139 INFO L87 Difference]: Start difference. First operand 6966 states and 10335 transitions. Second operand 3 states. [2019-10-13 21:24:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,769 INFO L93 Difference]: Finished difference Result 17929 states and 27059 transitions. [2019-10-13 21:24:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-13 21:24:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,829 INFO L225 Difference]: With dead ends: 17929 [2019-10-13 21:24:54,830 INFO L226 Difference]: Without dead ends: 11304 [2019-10-13 21:24:54,846 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:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2019-10-13 21:24:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 10364. [2019-10-13 21:24:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10364 states. [2019-10-13 21:24:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10364 states to 10364 states and 15734 transitions. [2019-10-13 21:24:55,483 INFO L78 Accepts]: Start accepts. Automaton has 10364 states and 15734 transitions. Word has length 165 [2019-10-13 21:24:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,483 INFO L462 AbstractCegarLoop]: Abstraction has 10364 states and 15734 transitions. [2019-10-13 21:24:55,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 10364 states and 15734 transitions. [2019-10-13 21:24:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:55,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,490 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:55,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash 628802590, now seen corresponding path program 1 times [2019-10-13 21:24:55,492 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593529168] [2019-10-13 21:24:55,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,699 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:55,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593529168] [2019-10-13 21:24:55,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:55,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220442688] [2019-10-13 21:24:55,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:55,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:55,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:55,701 INFO L87 Difference]: Start difference. First operand 10364 states and 15734 transitions. Second operand 8 states. [2019-10-13 21:24:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:58,636 INFO L93 Difference]: Finished difference Result 41170 states and 63107 transitions. [2019-10-13 21:24:58,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:24:58,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-13 21:24:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:58,720 INFO L225 Difference]: With dead ends: 41170 [2019-10-13 21:24:58,720 INFO L226 Difference]: Without dead ends: 31221 [2019-10-13 21:24:58,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:24:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31221 states. [2019-10-13 21:25:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31221 to 16912. [2019-10-13 21:25:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16912 states. [2019-10-13 21:25:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16912 states to 16912 states and 25456 transitions. [2019-10-13 21:25:00,532 INFO L78 Accepts]: Start accepts. Automaton has 16912 states and 25456 transitions. Word has length 166 [2019-10-13 21:25:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:00,532 INFO L462 AbstractCegarLoop]: Abstraction has 16912 states and 25456 transitions. [2019-10-13 21:25:00,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:25:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 16912 states and 25456 transitions. [2019-10-13 21:25:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:25:00,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:00,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:00,542 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -961444745, now seen corresponding path program 1 times [2019-10-13 21:25:00,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:00,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356203123] [2019-10-13 21:25:00,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:00,743 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:25:00,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356203123] [2019-10-13 21:25:00,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:00,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:00,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099666885] [2019-10-13 21:25:00,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:00,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:00,746 INFO L87 Difference]: Start difference. First operand 16912 states and 25456 transitions. Second operand 4 states. [2019-10-13 21:25:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:02,295 INFO L93 Difference]: Finished difference Result 47014 states and 70541 transitions. [2019-10-13 21:25:02,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:02,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-13 21:25:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:02,358 INFO L225 Difference]: With dead ends: 47014 [2019-10-13 21:25:02,358 INFO L226 Difference]: Without dead ends: 30145 [2019-10-13 21:25:02,398 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:25:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30145 states. [2019-10-13 21:25:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30145 to 30107. [2019-10-13 21:25:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30107 states. [2019-10-13 21:25:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30107 states to 30107 states and 44602 transitions. [2019-10-13 21:25:04,107 INFO L78 Accepts]: Start accepts. Automaton has 30107 states and 44602 transitions. Word has length 166 [2019-10-13 21:25:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,107 INFO L462 AbstractCegarLoop]: Abstraction has 30107 states and 44602 transitions. [2019-10-13 21:25:04,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 30107 states and 44602 transitions. [2019-10-13 21:25:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:25:04,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,119 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:04,120 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash 155010953, now seen corresponding path program 1 times [2019-10-13 21:25:04,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376157575] [2019-10-13 21:25:04,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,183 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:25:04,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376157575] [2019-10-13 21:25:04,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:04,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383005271] [2019-10-13 21:25:04,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:04,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:04,186 INFO L87 Difference]: Start difference. First operand 30107 states and 44602 transitions. Second operand 3 states. [2019-10-13 21:25:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:07,379 INFO L93 Difference]: Finished difference Result 90119 states and 133549 transitions. [2019-10-13 21:25:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:07,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-13 21:25:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:07,491 INFO L225 Difference]: With dead ends: 90119 [2019-10-13 21:25:07,491 INFO L226 Difference]: Without dead ends: 60122 [2019-10-13 21:25:07,538 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:25:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60122 states. [2019-10-13 21:25:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60122 to 30113. [2019-10-13 21:25:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30113 states. [2019-10-13 21:25:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30113 states to 30113 states and 44608 transitions. [2019-10-13 21:25:09,497 INFO L78 Accepts]: Start accepts. Automaton has 30113 states and 44608 transitions. Word has length 167 [2019-10-13 21:25:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,497 INFO L462 AbstractCegarLoop]: Abstraction has 30113 states and 44608 transitions. [2019-10-13 21:25:09,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30113 states and 44608 transitions. [2019-10-13 21:25:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:09,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,508 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:09,508 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash -899511549, now seen corresponding path program 1 times [2019-10-13 21:25:09,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561016750] [2019-10-13 21:25:09,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,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:25:09,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561016750] [2019-10-13 21:25:09,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:09,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088276478] [2019-10-13 21:25:09,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:09,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:09,609 INFO L87 Difference]: Start difference. First operand 30113 states and 44608 transitions. Second operand 3 states. [2019-10-13 21:25:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:11,941 INFO L93 Difference]: Finished difference Result 79104 states and 117010 transitions. [2019-10-13 21:25:11,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:11,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-13 21:25:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:12,026 INFO L225 Difference]: With dead ends: 79104 [2019-10-13 21:25:12,026 INFO L226 Difference]: Without dead ends: 49750 [2019-10-13 21:25:12,071 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:25:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49750 states. [2019-10-13 21:25:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49750 to 49712. [2019-10-13 21:25:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49712 states. [2019-10-13 21:25:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49712 states to 49712 states and 72594 transitions. [2019-10-13 21:25:15,782 INFO L78 Accepts]: Start accepts. Automaton has 49712 states and 72594 transitions. Word has length 168 [2019-10-13 21:25:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:15,782 INFO L462 AbstractCegarLoop]: Abstraction has 49712 states and 72594 transitions. [2019-10-13 21:25:15,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 49712 states and 72594 transitions. [2019-10-13 21:25:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:15,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:15,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:15,796 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1575562976, now seen corresponding path program 1 times [2019-10-13 21:25:15,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:15,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128545078] [2019-10-13 21:25:15,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:15,975 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:25:15,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128545078] [2019-10-13 21:25:15,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:15,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:15,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518390684] [2019-10-13 21:25:15,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:15,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:15,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:15,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:15,984 INFO L87 Difference]: Start difference. First operand 49712 states and 72594 transitions. Second operand 4 states.