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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:46,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:46,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:46,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:46,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:46,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:46,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:46,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:46,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:46,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:46,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:46,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:46,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:46,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:46,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:46,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:46,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:46,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:46,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:46,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:46,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:46,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:46,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:46,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:46,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:46,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:46,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:46,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:46,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:46,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:46,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:46,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:46,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:46,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:46,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:46,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:46,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:46,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:46,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:46,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:46,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:46,280 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:46,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:46,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:46,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:46,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:46,305 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:46,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:46,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:46,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:46,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:46,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:46,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:46,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:46,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:46,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:46,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:46,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:46,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:46,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:46,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:46,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:46,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:46,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:46,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:46,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:46,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:46,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:46,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:46,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:46,312 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:46,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:46,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:46,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:46,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:46,632 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:46,633 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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:46,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ac5bb8b/b15d6a8ae61348b9adab767491385f0c/FLAG60d323638 [2019-10-13 21:24:47,192 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:47,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:47,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ac5bb8b/b15d6a8ae61348b9adab767491385f0c/FLAG60d323638 [2019-10-13 21:24:47,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ac5bb8b/b15d6a8ae61348b9adab767491385f0c [2019-10-13 21:24:47,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:47,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:47,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:47,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:47,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:47,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:47" (1/1) ... [2019-10-13 21:24:47,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ce7a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47, skipping insertion in model container [2019-10-13 21:24:47,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:47" (1/1) ... [2019-10-13 21:24:47,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:47,598 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:48,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:48,198 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:48,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:48,392 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:48,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:48 WrapperNode [2019-10-13 21:24:48,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:48,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:48,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:48,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:48,410 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:48" (1/1) ... [2019-10-13 21:24:48,410 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:48" (1/1) ... [2019-10-13 21:24:48,435 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:48" (1/1) ... [2019-10-13 21:24:48,436 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:48" (1/1) ... [2019-10-13 21:24:48,474 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:48" (1/1) ... [2019-10-13 21:24:48,497 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:48" (1/1) ... [2019-10-13 21:24:48,502 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:48" (1/1) ... [2019-10-13 21:24:48,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:48,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:48,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:48,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:48,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:48" (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:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:50,124 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:50,125 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:50,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:50 BoogieIcfgContainer [2019-10-13 21:24:50,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:50,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:50,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:50,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:50,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:47" (1/3) ... [2019-10-13 21:24:50,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5bbef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:50, skipping insertion in model container [2019-10-13 21:24:50,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:48" (2/3) ... [2019-10-13 21:24:50,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5bbef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:50, skipping insertion in model container [2019-10-13 21:24:50,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:50" (3/3) ... [2019-10-13 21:24:50,143 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:50,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:50,174 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:50,187 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:50,221 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:50,221 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:50,221 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:50,222 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:50,222 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:50,222 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:50,222 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:50,222 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states. [2019-10-13 21:24:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:50,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,266 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:50,269 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash 415390772, now seen corresponding path program 1 times [2019-10-13 21:24:50,282 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493756988] [2019-10-13 21:24:50,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,026 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,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493756988] [2019-10-13 21:24:51,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657973230] [2019-10-13 21:24:51,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,052 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 3 states. [2019-10-13 21:24:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,344 INFO L93 Difference]: Finished difference Result 629 states and 1092 transitions. [2019-10-13 21:24:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-13 21:24:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,377 INFO L225 Difference]: With dead ends: 629 [2019-10-13 21:24:51,378 INFO L226 Difference]: Without dead ends: 514 [2019-10-13 21:24:51,382 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:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-13 21:24:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-10-13 21:24:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-13 21:24:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-10-13 21:24:51,487 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 154 [2019-10-13 21:24:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,489 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-10-13 21:24:51,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-10-13 21:24:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:51,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,494 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:51,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1479062648, now seen corresponding path program 1 times [2019-10-13 21:24:51,495 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75840876] [2019-10-13 21:24:51,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,055 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,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75840876] [2019-10-13 21:24:52,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:52,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658153687] [2019-10-13 21:24:52,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:52,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:52,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:52,061 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 4 states. [2019-10-13 21:24:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:52,214 INFO L93 Difference]: Finished difference Result 1493 states and 2216 transitions. [2019-10-13 21:24:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:52,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 21:24:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:52,224 INFO L225 Difference]: With dead ends: 1493 [2019-10-13 21:24:52,225 INFO L226 Difference]: Without dead ends: 994 [2019-10-13 21:24:52,233 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,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-10-13 21:24:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2019-10-13 21:24:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-10-13 21:24:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1463 transitions. [2019-10-13 21:24:52,364 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1463 transitions. Word has length 154 [2019-10-13 21:24:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:52,367 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1463 transitions. [2019-10-13 21:24:52,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1463 transitions. [2019-10-13 21:24:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:24:52,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:52,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash 203763094, now seen corresponding path program 1 times [2019-10-13 21:24:52,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815702819] [2019-10-13 21:24:52,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,487 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,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815702819] [2019-10-13 21:24:52,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:52,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396994107] [2019-10-13 21:24:52,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:52,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:52,496 INFO L87 Difference]: Start difference. First operand 992 states and 1463 transitions. Second operand 3 states. [2019-10-13 21:24:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:52,586 INFO L93 Difference]: Finished difference Result 2930 states and 4319 transitions. [2019-10-13 21:24:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:52,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-13 21:24:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:52,601 INFO L225 Difference]: With dead ends: 2930 [2019-10-13 21:24:52,601 INFO L226 Difference]: Without dead ends: 1970 [2019-10-13 21:24:52,605 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:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-10-13 21:24:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 994. [2019-10-13 21:24:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-10-13 21:24:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1465 transitions. [2019-10-13 21:24:52,674 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1465 transitions. Word has length 155 [2019-10-13 21:24:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:52,674 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1465 transitions. [2019-10-13 21:24:52,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1465 transitions. [2019-10-13 21:24:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:52,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,678 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:52,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash -691639607, now seen corresponding path program 1 times [2019-10-13 21:24:52,679 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886599937] [2019-10-13 21:24:52,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,928 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,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886599937] [2019-10-13 21:24:52,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:52,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769709792] [2019-10-13 21:24:52,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:52,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:52,932 INFO L87 Difference]: Start difference. First operand 994 states and 1465 transitions. Second operand 4 states. [2019-10-13 21:24:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:52,997 INFO L93 Difference]: Finished difference Result 1970 states and 2905 transitions. [2019-10-13 21:24:52,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:52,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-13 21:24:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,003 INFO L225 Difference]: With dead ends: 1970 [2019-10-13 21:24:53,003 INFO L226 Difference]: Without dead ends: 994 [2019-10-13 21:24:53,006 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:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-10-13 21:24:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 993. [2019-10-13 21:24:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-10-13 21:24:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1462 transitions. [2019-10-13 21:24:53,053 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1462 transitions. Word has length 156 [2019-10-13 21:24:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:53,053 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1462 transitions. [2019-10-13 21:24:53,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1462 transitions. [2019-10-13 21:24:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:53,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,056 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:53,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2145460590, now seen corresponding path program 1 times [2019-10-13 21:24:53,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620301660] [2019-10-13 21:24:53,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,274 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,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620301660] [2019-10-13 21:24:53,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:53,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793001320] [2019-10-13 21:24:53,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:53,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:53,277 INFO L87 Difference]: Start difference. First operand 993 states and 1462 transitions. Second operand 4 states. [2019-10-13 21:24:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:53,350 INFO L93 Difference]: Finished difference Result 1973 states and 2907 transitions. [2019-10-13 21:24:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:53,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-13 21:24:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,357 INFO L225 Difference]: With dead ends: 1973 [2019-10-13 21:24:53,357 INFO L226 Difference]: Without dead ends: 991 [2019-10-13 21:24:53,360 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:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-10-13 21:24:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-10-13 21:24:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-10-13 21:24:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1458 transitions. [2019-10-13 21:24:53,411 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1458 transitions. Word has length 156 [2019-10-13 21:24:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:53,411 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1458 transitions. [2019-10-13 21:24:53,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1458 transitions. [2019-10-13 21:24:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:53,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,415 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:53,415 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1752535471, now seen corresponding path program 1 times [2019-10-13 21:24:53,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235581980] [2019-10-13 21:24:53,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,619 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,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235581980] [2019-10-13 21:24:53,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:53,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645422513] [2019-10-13 21:24:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:53,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:53,623 INFO L87 Difference]: Start difference. First operand 991 states and 1458 transitions. Second operand 3 states. [2019-10-13 21:24:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:53,739 INFO L93 Difference]: Finished difference Result 2257 states and 3335 transitions. [2019-10-13 21:24:53,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:53,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 21:24:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,754 INFO L225 Difference]: With dead ends: 2257 [2019-10-13 21:24:53,755 INFO L226 Difference]: Without dead ends: 1462 [2019-10-13 21:24:53,757 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,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-10-13 21:24:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2019-10-13 21:24:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-10-13 21:24:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2122 transitions. [2019-10-13 21:24:53,841 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2122 transitions. Word has length 156 [2019-10-13 21:24:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:53,842 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2122 transitions. [2019-10-13 21:24:53,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2122 transitions. [2019-10-13 21:24:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:53,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,847 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] [2019-10-13 21:24:53,847 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1902063682, now seen corresponding path program 1 times [2019-10-13 21:24:53,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248293293] [2019-10-13 21:24:53,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,932 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,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248293293] [2019-10-13 21:24:53,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:53,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479249849] [2019-10-13 21:24:53,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:53,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:53,935 INFO L87 Difference]: Start difference. First operand 1460 states and 2122 transitions. Second operand 3 states. [2019-10-13 21:24:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,047 INFO L93 Difference]: Finished difference Result 3179 states and 4753 transitions. [2019-10-13 21:24:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-13 21:24:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,057 INFO L225 Difference]: With dead ends: 3179 [2019-10-13 21:24:54,057 INFO L226 Difference]: Without dead ends: 1908 [2019-10-13 21:24:54,060 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,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-13 21:24:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1876. [2019-10-13 21:24:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-10-13 21:24:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2798 transitions. [2019-10-13 21:24:54,251 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2798 transitions. Word has length 157 [2019-10-13 21:24:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,251 INFO L462 AbstractCegarLoop]: Abstraction has 1876 states and 2798 transitions. [2019-10-13 21:24:54,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2798 transitions. [2019-10-13 21:24:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:24:54,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:54,258 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1819575298, now seen corresponding path program 1 times [2019-10-13 21:24:54,259 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901900456] [2019-10-13 21:24:54,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:54,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901900456] [2019-10-13 21:24:54,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:54,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:54,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093257277] [2019-10-13 21:24:54,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:54,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:54,566 INFO L87 Difference]: Start difference. First operand 1876 states and 2798 transitions. Second operand 4 states. [2019-10-13 21:24:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,810 INFO L93 Difference]: Finished difference Result 4810 states and 7177 transitions. [2019-10-13 21:24:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:54,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-13 21:24:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,825 INFO L225 Difference]: With dead ends: 4810 [2019-10-13 21:24:54,826 INFO L226 Difference]: Without dead ends: 2965 [2019-10-13 21:24:54,831 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:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-10-13 21:24:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2019-10-13 21:24:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-10-13 21:24:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4385 transitions. [2019-10-13 21:24:55,034 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4385 transitions. Word has length 160 [2019-10-13 21:24:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,034 INFO L462 AbstractCegarLoop]: Abstraction has 2963 states and 4385 transitions. [2019-10-13 21:24:55,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4385 transitions. [2019-10-13 21:24:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:24:55,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:55,041 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash -489223043, now seen corresponding path program 1 times [2019-10-13 21:24:55,042 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261770484] [2019-10-13 21:24:55,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,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:55,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261770484] [2019-10-13 21:24:55,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:55,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388141261] [2019-10-13 21:24:55,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:55,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:55,260 INFO L87 Difference]: Start difference. First operand 2963 states and 4385 transitions. Second operand 3 states. [2019-10-13 21:24:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,533 INFO L93 Difference]: Finished difference Result 7148 states and 10640 transitions. [2019-10-13 21:24:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:55,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-13 21:24:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,557 INFO L225 Difference]: With dead ends: 7148 [2019-10-13 21:24:55,557 INFO L226 Difference]: Without dead ends: 4544 [2019-10-13 21:24:55,564 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:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-10-13 21:24:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4542. [2019-10-13 21:24:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4542 states. [2019-10-13 21:24:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 6645 transitions. [2019-10-13 21:24:55,874 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 6645 transitions. Word has length 162 [2019-10-13 21:24:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,875 INFO L462 AbstractCegarLoop]: Abstraction has 4542 states and 6645 transitions. [2019-10-13 21:24:55,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 6645 transitions. [2019-10-13 21:24:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:55,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,889 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,889 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash -598358062, now seen corresponding path program 1 times [2019-10-13 21:24:55,891 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089817083] [2019-10-13 21:24:55,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,084 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:56,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089817083] [2019-10-13 21:24:56,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:56,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:56,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036357352] [2019-10-13 21:24:56,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:56,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:56,088 INFO L87 Difference]: Start difference. First operand 4542 states and 6645 transitions. Second operand 3 states. [2019-10-13 21:24:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,755 INFO L93 Difference]: Finished difference Result 12098 states and 17966 transitions. [2019-10-13 21:24:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:56,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-13 21:24:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,820 INFO L225 Difference]: With dead ends: 12098 [2019-10-13 21:24:56,820 INFO L226 Difference]: Without dead ends: 8790 [2019-10-13 21:24:56,834 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:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2019-10-13 21:24:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8788. [2019-10-13 21:24:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8788 states. [2019-10-13 21:24:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8788 states to 8788 states and 12891 transitions. [2019-10-13 21:24:57,399 INFO L78 Accepts]: Start accepts. Automaton has 8788 states and 12891 transitions. Word has length 166 [2019-10-13 21:24:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:57,399 INFO L462 AbstractCegarLoop]: Abstraction has 8788 states and 12891 transitions. [2019-10-13 21:24:57,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8788 states and 12891 transitions. [2019-10-13 21:24:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:57,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:57,411 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:57,411 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash 875092589, now seen corresponding path program 1 times [2019-10-13 21:24:57,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:57,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143945363] [2019-10-13 21:24:57,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,639 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:57,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143945363] [2019-10-13 21:24:57,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:57,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176828952] [2019-10-13 21:24:57,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:57,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:57,642 INFO L87 Difference]: Start difference. First operand 8788 states and 12891 transitions. Second operand 8 states. [2019-10-13 21:24:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:59,732 INFO L93 Difference]: Finished difference Result 29662 states and 44875 transitions. [2019-10-13 21:24:59,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:24:59,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-13 21:24:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:59,788 INFO L225 Difference]: With dead ends: 29662 [2019-10-13 21:24:59,788 INFO L226 Difference]: Without dead ends: 21434 [2019-10-13 21:24:59,808 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:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-10-13 21:25:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 12552. [2019-10-13 21:25:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12552 states. [2019-10-13 21:25:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12552 states to 12552 states and 18471 transitions. [2019-10-13 21:25:00,605 INFO L78 Accepts]: Start accepts. Automaton has 12552 states and 18471 transitions. Word has length 166 [2019-10-13 21:25:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:00,606 INFO L462 AbstractCegarLoop]: Abstraction has 12552 states and 18471 transitions. [2019-10-13 21:25:00,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:25:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 12552 states and 18471 transitions. [2019-10-13 21:25:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:25:00,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:00,617 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,617 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2101346563, now seen corresponding path program 1 times [2019-10-13 21:25:00,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:00,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604994141] [2019-10-13 21:25:00,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:00,851 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,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604994141] [2019-10-13 21:25:00,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:00,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:00,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713444552] [2019-10-13 21:25:00,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:00,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:00,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:00,853 INFO L87 Difference]: Start difference. First operand 12552 states and 18471 transitions. Second operand 4 states. [2019-10-13 21:25:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:02,070 INFO L93 Difference]: Finished difference Result 36416 states and 53423 transitions. [2019-10-13 21:25:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:02,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-13 21:25:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:02,133 INFO L225 Difference]: With dead ends: 36416 [2019-10-13 21:25:02,133 INFO L226 Difference]: Without dead ends: 23907 [2019-10-13 21:25:02,166 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:25:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23907 states. [2019-10-13 21:25:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23907 to 23905. [2019-10-13 21:25:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23905 states. [2019-10-13 21:25:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23905 states to 23905 states and 34702 transitions. [2019-10-13 21:25:03,992 INFO L78 Accepts]: Start accepts. Automaton has 23905 states and 34702 transitions. Word has length 166 [2019-10-13 21:25:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:03,993 INFO L462 AbstractCegarLoop]: Abstraction has 23905 states and 34702 transitions. [2019-10-13 21:25:03,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23905 states and 34702 transitions. [2019-10-13 21:25:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:25:04,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,012 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,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 222110291, now seen corresponding path program 1 times [2019-10-13 21:25:04,013 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907614747] [2019-10-13 21:25:04,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,082 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,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907614747] [2019-10-13 21:25:04,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:04,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831053005] [2019-10-13 21:25:04,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:04,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:04,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:04,084 INFO L87 Difference]: Start difference. First operand 23905 states and 34702 transitions. Second operand 3 states. [2019-10-13 21:25:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,855 INFO L93 Difference]: Finished difference Result 71507 states and 103841 transitions. [2019-10-13 21:25:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:05,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-13 21:25:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,965 INFO L225 Difference]: With dead ends: 71507 [2019-10-13 21:25:05,966 INFO L226 Difference]: Without dead ends: 47715 [2019-10-13 21:25:06,025 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:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47715 states. [2019-10-13 21:25:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47715 to 23911. [2019-10-13 21:25:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23911 states. [2019-10-13 21:25:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23911 states to 23911 states and 34708 transitions. [2019-10-13 21:25:08,259 INFO L78 Accepts]: Start accepts. Automaton has 23911 states and 34708 transitions. Word has length 167 [2019-10-13 21:25:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:08,260 INFO L462 AbstractCegarLoop]: Abstraction has 23911 states and 34708 transitions. [2019-10-13 21:25:08,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 23911 states and 34708 transitions. [2019-10-13 21:25:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:08,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:08,276 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:08,277 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1523045680, now seen corresponding path program 1 times [2019-10-13 21:25:08,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:08,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005360048] [2019-10-13 21:25:08,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:08,395 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:08,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005360048] [2019-10-13 21:25:08,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:08,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:08,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611328690] [2019-10-13 21:25:08,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:08,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:08,398 INFO L87 Difference]: Start difference. First operand 23911 states and 34708 transitions. Second operand 3 states. [2019-10-13 21:25:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:10,346 INFO L93 Difference]: Finished difference Result 69094 states and 100453 transitions. [2019-10-13 21:25:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:10,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-13 21:25:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:10,422 INFO L225 Difference]: With dead ends: 69094 [2019-10-13 21:25:10,422 INFO L226 Difference]: Without dead ends: 46232 [2019-10-13 21:25:10,456 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:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2019-10-13 21:25:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 46230. [2019-10-13 21:25:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46230 states. [2019-10-13 21:25:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46230 states to 46230 states and 66591 transitions. [2019-10-13 21:25:12,746 INFO L78 Accepts]: Start accepts. Automaton has 46230 states and 66591 transitions. Word has length 168 [2019-10-13 21:25:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:12,747 INFO L462 AbstractCegarLoop]: Abstraction has 46230 states and 66591 transitions. [2019-10-13 21:25:12,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 46230 states and 66591 transitions. [2019-10-13 21:25:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:12,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:12,779 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:12,779 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 846994253, now seen corresponding path program 1 times [2019-10-13 21:25:12,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:12,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859291365] [2019-10-13 21:25:12,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,848 WARN L191 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-10-13 21:25:13,872 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:13,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859291365] [2019-10-13 21:25:13,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:13,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974726957] [2019-10-13 21:25:13,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:13,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:13,875 INFO L87 Difference]: Start difference. First operand 46230 states and 66591 transitions. Second operand 4 states. [2019-10-13 21:25:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,481 INFO L93 Difference]: Finished difference Result 80972 states and 116685 transitions. [2019-10-13 21:25:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:15,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-13 21:25:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,517 INFO L225 Difference]: With dead ends: 80972 [2019-10-13 21:25:15,517 INFO L226 Difference]: Without dead ends: 35645 [2019-10-13 21:25:15,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35645 states. [2019-10-13 21:25:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35645 to 35645. [2019-10-13 21:25:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35645 states. [2019-10-13 21:25:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35645 states to 35645 states and 51181 transitions. [2019-10-13 21:25:17,061 INFO L78 Accepts]: Start accepts. Automaton has 35645 states and 51181 transitions. Word has length 168 [2019-10-13 21:25:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,061 INFO L462 AbstractCegarLoop]: Abstraction has 35645 states and 51181 transitions. [2019-10-13 21:25:17,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35645 states and 51181 transitions. [2019-10-13 21:25:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:25:17,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,083 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, 1, 1] [2019-10-13 21:25:17,083 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 349543820, now seen corresponding path program 1 times [2019-10-13 21:25:17,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58776155] [2019-10-13 21:25:17,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,197 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:17,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58776155] [2019-10-13 21:25:17,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:17,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655605413] [2019-10-13 21:25:17,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:17,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,204 INFO L87 Difference]: Start difference. First operand 35645 states and 51181 transitions. Second operand 3 states. [2019-10-13 21:25:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,853 INFO L93 Difference]: Finished difference Result 86509 states and 125245 transitions. [2019-10-13 21:25:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-13 21:25:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,922 INFO L225 Difference]: With dead ends: 86509 [2019-10-13 21:25:19,922 INFO L226 Difference]: Without dead ends: 56291 [2019-10-13 21:25:19,945 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:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56291 states.