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-13a467a-m [2019-10-15 01:23:50,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:50,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:50,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:50,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:50,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:50,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:50,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:50,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:50,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:50,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:50,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:50,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:50,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:50,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:50,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:50,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:50,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:50,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:50,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:50,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:50,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:50,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:50,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:50,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:50,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:50,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:50,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:50,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:50,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:50,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:50,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:50,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:50,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:50,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:50,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:50,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:50,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:50,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:50,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:50,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:50,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:50,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:50,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:50,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:50,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:50,332 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:50,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:50,333 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:50,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:50,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:50,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:50,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:50,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:50,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:50,334 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:50,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:50,334 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:50,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:50,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:50,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:50,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:50,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:50,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:50,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:50,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:50,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:50,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:50,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:50,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:50,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:50,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:50,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:50,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:50,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:50,633 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:50,634 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-15 01:23:50,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad818807b/05b86098889f45b582b83890862b3dc9/FLAGa847a6e96 [2019-10-15 01:23:51,231 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:51,232 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-15 01:23:51,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad818807b/05b86098889f45b582b83890862b3dc9/FLAGa847a6e96 [2019-10-15 01:23:51,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad818807b/05b86098889f45b582b83890862b3dc9 [2019-10-15 01:23:51,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:51,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:51,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:51,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:51,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:51,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:51" (1/1) ... [2019-10-15 01:23:51,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:51, skipping insertion in model container [2019-10-15 01:23:51,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:51" (1/1) ... [2019-10-15 01:23:51,577 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:51,648 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:52,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:52,229 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:52,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:52,410 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:52,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52 WrapperNode [2019-10-15 01:23:52,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:52,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:52,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:52,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:52,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:52,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:52,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:52,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:52,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:53,975 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:53,975 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:53,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:53 BoogieIcfgContainer [2019-10-15 01:23:53,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:53,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:53,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:53,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:53,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:51" (1/3) ... [2019-10-15 01:23:53,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135d1745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:53, skipping insertion in model container [2019-10-15 01:23:53,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52" (2/3) ... [2019-10-15 01:23:53,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135d1745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:53, skipping insertion in model container [2019-10-15 01:23:53,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:53" (3/3) ... [2019-10-15 01:23:53,985 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:53,996 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:54,004 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:54,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:54,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:54,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:54,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:54,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:54,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:54,045 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:54,045 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:54,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states. [2019-10-15 01:23:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:54,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:54,093 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-15 01:23:54,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash 415390772, now seen corresponding path program 1 times [2019-10-15 01:23:54,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:54,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409455831] [2019-10-15 01:23:54,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:54,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409455831] [2019-10-15 01:23:54,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:54,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080572539] [2019-10-15 01:23:54,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:54,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:54,877 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 3 states. [2019-10-15 01:23:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,107 INFO L93 Difference]: Finished difference Result 629 states and 1092 transitions. [2019-10-15 01:23:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:55,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-15 01:23:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,129 INFO L225 Difference]: With dead ends: 629 [2019-10-15 01:23:55,129 INFO L226 Difference]: Without dead ends: 514 [2019-10-15 01:23:55,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-15 01:23:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-10-15 01:23:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-15 01:23:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-10-15 01:23:55,302 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 154 [2019-10-15 01:23:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,303 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-10-15 01:23:55,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-10-15 01:23:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:55,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,315 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-15 01:23:55,315 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1479062648, now seen corresponding path program 1 times [2019-10-15 01:23:55,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084331415] [2019-10-15 01:23:55,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:55,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084331415] [2019-10-15 01:23:55,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:55,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444346864] [2019-10-15 01:23:55,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:55,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:55,957 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 4 states. [2019-10-15 01:23:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,161 INFO L93 Difference]: Finished difference Result 1493 states and 2216 transitions. [2019-10-15 01:23:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:56,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:23:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,168 INFO L225 Difference]: With dead ends: 1493 [2019-10-15 01:23:56,168 INFO L226 Difference]: Without dead ends: 994 [2019-10-15 01:23:56,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-10-15 01:23:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2019-10-15 01:23:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-10-15 01:23:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1463 transitions. [2019-10-15 01:23:56,248 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1463 transitions. Word has length 154 [2019-10-15 01:23:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,248 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1463 transitions. [2019-10-15 01:23:56,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1463 transitions. [2019-10-15 01:23:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:23:56,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,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] [2019-10-15 01:23:56,259 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash 203763094, now seen corresponding path program 1 times [2019-10-15 01:23:56,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195395325] [2019-10-15 01:23:56,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:56,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195395325] [2019-10-15 01:23:56,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:56,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148979792] [2019-10-15 01:23:56,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:56,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:56,363 INFO L87 Difference]: Start difference. First operand 992 states and 1463 transitions. Second operand 3 states. [2019-10-15 01:23:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,477 INFO L93 Difference]: Finished difference Result 2930 states and 4319 transitions. [2019-10-15 01:23:56,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:56,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-15 01:23:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,492 INFO L225 Difference]: With dead ends: 2930 [2019-10-15 01:23:56,493 INFO L226 Difference]: Without dead ends: 1970 [2019-10-15 01:23:56,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-10-15 01:23:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 994. [2019-10-15 01:23:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-10-15 01:23:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1465 transitions. [2019-10-15 01:23:56,577 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1465 transitions. Word has length 155 [2019-10-15 01:23:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,577 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1465 transitions. [2019-10-15 01:23:56,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1465 transitions. [2019-10-15 01:23:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:56,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,582 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-15 01:23:56,582 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -691639607, now seen corresponding path program 1 times [2019-10-15 01:23:56,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305304897] [2019-10-15 01:23:56,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:56,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305304897] [2019-10-15 01:23:56,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:56,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279957386] [2019-10-15 01:23:56,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:56,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:56,836 INFO L87 Difference]: Start difference. First operand 994 states and 1465 transitions. Second operand 4 states. [2019-10-15 01:23:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,918 INFO L93 Difference]: Finished difference Result 1970 states and 2905 transitions. [2019-10-15 01:23:56,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:56,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-15 01:23:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,927 INFO L225 Difference]: With dead ends: 1970 [2019-10-15 01:23:56,928 INFO L226 Difference]: Without dead ends: 994 [2019-10-15 01:23:56,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-10-15 01:23:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 993. [2019-10-15 01:23:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-10-15 01:23:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1462 transitions. [2019-10-15 01:23:56,996 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1462 transitions. Word has length 156 [2019-10-15 01:23:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,996 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1462 transitions. [2019-10-15 01:23:56,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1462 transitions. [2019-10-15 01:23:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:57,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,001 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-15 01:23:57,001 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2145460590, now seen corresponding path program 1 times [2019-10-15 01:23:57,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848173688] [2019-10-15 01:23:57,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:57,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848173688] [2019-10-15 01:23:57,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:57,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99566156] [2019-10-15 01:23:57,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:57,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:57,259 INFO L87 Difference]: Start difference. First operand 993 states and 1462 transitions. Second operand 4 states. [2019-10-15 01:23:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,375 INFO L93 Difference]: Finished difference Result 1973 states and 2907 transitions. [2019-10-15 01:23:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:57,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-15 01:23:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,384 INFO L225 Difference]: With dead ends: 1973 [2019-10-15 01:23:57,384 INFO L226 Difference]: Without dead ends: 991 [2019-10-15 01:23:57,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-10-15 01:23:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-10-15 01:23:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-10-15 01:23:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1458 transitions. [2019-10-15 01:23:57,442 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1458 transitions. Word has length 156 [2019-10-15 01:23:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,444 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1458 transitions. [2019-10-15 01:23:57,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1458 transitions. [2019-10-15 01:23:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:57,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,447 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-15 01:23:57,448 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1752535471, now seen corresponding path program 1 times [2019-10-15 01:23:57,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101999996] [2019-10-15 01:23:57,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:57,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101999996] [2019-10-15 01:23:57,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356858106] [2019-10-15 01:23:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,581 INFO L87 Difference]: Start difference. First operand 991 states and 1458 transitions. Second operand 3 states. [2019-10-15 01:23:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,743 INFO L93 Difference]: Finished difference Result 2257 states and 3335 transitions. [2019-10-15 01:23:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:57,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 01:23:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,762 INFO L225 Difference]: With dead ends: 2257 [2019-10-15 01:23:57,762 INFO L226 Difference]: Without dead ends: 1462 [2019-10-15 01:23:57,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-10-15 01:23:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2019-10-15 01:23:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-10-15 01:23:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2122 transitions. [2019-10-15 01:23:57,894 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2122 transitions. Word has length 156 [2019-10-15 01:23:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,896 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2122 transitions. [2019-10-15 01:23:57,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2122 transitions. [2019-10-15 01:23:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:57,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,903 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:57,903 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1902063682, now seen corresponding path program 1 times [2019-10-15 01:23:57,905 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110833933] [2019-10-15 01:23:57,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:58,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110833933] [2019-10-15 01:23:58,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:58,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697138227] [2019-10-15 01:23:58,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:58,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:58,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:58,100 INFO L87 Difference]: Start difference. First operand 1460 states and 2122 transitions. Second operand 3 states. [2019-10-15 01:23:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,239 INFO L93 Difference]: Finished difference Result 3179 states and 4753 transitions. [2019-10-15 01:23:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:58,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-15 01:23:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,250 INFO L225 Difference]: With dead ends: 3179 [2019-10-15 01:23:58,251 INFO L226 Difference]: Without dead ends: 1908 [2019-10-15 01:23:58,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-15 01:23:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1876. [2019-10-15 01:23:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-10-15 01:23:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2798 transitions. [2019-10-15 01:23:58,375 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2798 transitions. Word has length 157 [2019-10-15 01:23:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:58,375 INFO L462 AbstractCegarLoop]: Abstraction has 1876 states and 2798 transitions. [2019-10-15 01:23:58,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2798 transitions. [2019-10-15 01:23:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:23:58,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:58,379 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-15 01:23:58,380 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1819575298, now seen corresponding path program 1 times [2019-10-15 01:23:58,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:58,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42683569] [2019-10-15 01:23:58,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:58,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42683569] [2019-10-15 01:23:58,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:58,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125959448] [2019-10-15 01:23:58,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:58,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:58,595 INFO L87 Difference]: Start difference. First operand 1876 states and 2798 transitions. Second operand 4 states. [2019-10-15 01:23:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,970 INFO L93 Difference]: Finished difference Result 4810 states and 7177 transitions. [2019-10-15 01:23:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:58,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-15 01:23:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,989 INFO L225 Difference]: With dead ends: 4810 [2019-10-15 01:23:58,990 INFO L226 Difference]: Without dead ends: 2965 [2019-10-15 01:23:58,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-10-15 01:23:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2019-10-15 01:23:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-10-15 01:23:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4385 transitions. [2019-10-15 01:23:59,195 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4385 transitions. Word has length 160 [2019-10-15 01:23:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:59,195 INFO L462 AbstractCegarLoop]: Abstraction has 2963 states and 4385 transitions. [2019-10-15 01:23:59,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4385 transitions. [2019-10-15 01:23:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:23:59,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:59,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:59,201 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash -489223043, now seen corresponding path program 1 times [2019-10-15 01:23:59,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:59,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102630399] [2019-10-15 01:23:59,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:59,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102630399] [2019-10-15 01:23:59,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:59,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:59,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31572732] [2019-10-15 01:23:59,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:59,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:59,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:59,331 INFO L87 Difference]: Start difference. First operand 2963 states and 4385 transitions. Second operand 3 states. [2019-10-15 01:23:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:59,705 INFO L93 Difference]: Finished difference Result 7148 states and 10640 transitions. [2019-10-15 01:23:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:59,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-15 01:23:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:59,728 INFO L225 Difference]: With dead ends: 7148 [2019-10-15 01:23:59,729 INFO L226 Difference]: Without dead ends: 4544 [2019-10-15 01:23:59,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-10-15 01:24:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4542. [2019-10-15 01:24:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4542 states. [2019-10-15 01:24:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 6645 transitions. [2019-10-15 01:24:00,084 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 6645 transitions. Word has length 162 [2019-10-15 01:24:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:00,084 INFO L462 AbstractCegarLoop]: Abstraction has 4542 states and 6645 transitions. [2019-10-15 01:24:00,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 6645 transitions. [2019-10-15 01:24:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:24:00,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:00,098 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-15 01:24:00,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -598358062, now seen corresponding path program 1 times [2019-10-15 01:24:00,100 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:00,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467570435] [2019-10-15 01:24:00,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:00,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:00,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:00,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467570435] [2019-10-15 01:24:00,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:00,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:00,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819423676] [2019-10-15 01:24:00,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:00,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:00,237 INFO L87 Difference]: Start difference. First operand 4542 states and 6645 transitions. Second operand 3 states. [2019-10-15 01:24:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:01,084 INFO L93 Difference]: Finished difference Result 12098 states and 17966 transitions. [2019-10-15 01:24:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:01,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-15 01:24:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:01,129 INFO L225 Difference]: With dead ends: 12098 [2019-10-15 01:24:01,130 INFO L226 Difference]: Without dead ends: 8790 [2019-10-15 01:24:01,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2019-10-15 01:24:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8788. [2019-10-15 01:24:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8788 states. [2019-10-15 01:24:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8788 states to 8788 states and 12891 transitions. [2019-10-15 01:24:01,715 INFO L78 Accepts]: Start accepts. Automaton has 8788 states and 12891 transitions. Word has length 166 [2019-10-15 01:24:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:01,715 INFO L462 AbstractCegarLoop]: Abstraction has 8788 states and 12891 transitions. [2019-10-15 01:24:01,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8788 states and 12891 transitions. [2019-10-15 01:24:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:24:01,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:01,727 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-15 01:24:01,728 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 875092589, now seen corresponding path program 1 times [2019-10-15 01:24:01,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:01,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856274718] [2019-10-15 01:24:01,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:01,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856274718] [2019-10-15 01:24:01,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:01,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:24:01,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983392312] [2019-10-15 01:24:01,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:24:01,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:24:01,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:24:01,988 INFO L87 Difference]: Start difference. First operand 8788 states and 12891 transitions. Second operand 8 states. [2019-10-15 01:24:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:04,034 INFO L93 Difference]: Finished difference Result 29662 states and 44875 transitions. [2019-10-15 01:24:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:24:04,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-15 01:24:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:04,096 INFO L225 Difference]: With dead ends: 29662 [2019-10-15 01:24:04,096 INFO L226 Difference]: Without dead ends: 21434 [2019-10-15 01:24:04,115 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-15 01:24:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-10-15 01:24:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 12552. [2019-10-15 01:24:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12552 states. [2019-10-15 01:24:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12552 states to 12552 states and 18471 transitions. [2019-10-15 01:24:05,164 INFO L78 Accepts]: Start accepts. Automaton has 12552 states and 18471 transitions. Word has length 166 [2019-10-15 01:24:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,165 INFO L462 AbstractCegarLoop]: Abstraction has 12552 states and 18471 transitions. [2019-10-15 01:24:05,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:24:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 12552 states and 18471 transitions. [2019-10-15 01:24:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:24:05,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,177 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-15 01:24:05,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2101346563, now seen corresponding path program 1 times [2019-10-15 01:24:05,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789541193] [2019-10-15 01:24:05,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:05,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789541193] [2019-10-15 01:24:05,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:05,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285373415] [2019-10-15 01:24:05,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:05,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:05,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:05,429 INFO L87 Difference]: Start difference. First operand 12552 states and 18471 transitions. Second operand 4 states. [2019-10-15 01:24:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,292 INFO L93 Difference]: Finished difference Result 36416 states and 53423 transitions. [2019-10-15 01:24:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:07,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-15 01:24:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,354 INFO L225 Difference]: With dead ends: 36416 [2019-10-15 01:24:07,354 INFO L226 Difference]: Without dead ends: 23907 [2019-10-15 01:24:07,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23907 states. [2019-10-15 01:24:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23907 to 23905. [2019-10-15 01:24:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23905 states. [2019-10-15 01:24:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23905 states to 23905 states and 34702 transitions. [2019-10-15 01:24:09,352 INFO L78 Accepts]: Start accepts. Automaton has 23905 states and 34702 transitions. Word has length 166 [2019-10-15 01:24:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 23905 states and 34702 transitions. [2019-10-15 01:24:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 23905 states and 34702 transitions. [2019-10-15 01:24:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:24:09,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,373 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-15 01:24:09,374 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 222110291, now seen corresponding path program 1 times [2019-10-15 01:24:09,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63431665] [2019-10-15 01:24:09,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:09,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63431665] [2019-10-15 01:24:09,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:09,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970130005] [2019-10-15 01:24:09,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:09,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:09,453 INFO L87 Difference]: Start difference. First operand 23905 states and 34702 transitions. Second operand 3 states. [2019-10-15 01:24:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:11,471 INFO L93 Difference]: Finished difference Result 71507 states and 103841 transitions. [2019-10-15 01:24:11,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:11,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-15 01:24:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:11,608 INFO L225 Difference]: With dead ends: 71507 [2019-10-15 01:24:11,608 INFO L226 Difference]: Without dead ends: 47715 [2019-10-15 01:24:11,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47715 states. [2019-10-15 01:24:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47715 to 23911. [2019-10-15 01:24:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23911 states. [2019-10-15 01:24:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23911 states to 23911 states and 34708 transitions. [2019-10-15 01:24:14,047 INFO L78 Accepts]: Start accepts. Automaton has 23911 states and 34708 transitions. Word has length 167 [2019-10-15 01:24:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,047 INFO L462 AbstractCegarLoop]: Abstraction has 23911 states and 34708 transitions. [2019-10-15 01:24:14,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23911 states and 34708 transitions. [2019-10-15 01:24:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:24:14,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,063 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-15 01:24:14,063 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1523045680, now seen corresponding path program 1 times [2019-10-15 01:24:14,064 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250292060] [2019-10-15 01:24:14,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:14,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250292060] [2019-10-15 01:24:14,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:14,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087851993] [2019-10-15 01:24:14,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:14,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:14,171 INFO L87 Difference]: Start difference. First operand 23911 states and 34708 transitions. Second operand 3 states. [2019-10-15 01:24:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:16,144 INFO L93 Difference]: Finished difference Result 69094 states and 100453 transitions. [2019-10-15 01:24:16,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:16,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-15 01:24:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:16,254 INFO L225 Difference]: With dead ends: 69094 [2019-10-15 01:24:16,255 INFO L226 Difference]: Without dead ends: 46232 [2019-10-15 01:24:16,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2019-10-15 01:24:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 46230. [2019-10-15 01:24:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46230 states. [2019-10-15 01:24:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46230 states to 46230 states and 66591 transitions. [2019-10-15 01:24:18,711 INFO L78 Accepts]: Start accepts. Automaton has 46230 states and 66591 transitions. Word has length 168 [2019-10-15 01:24:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:18,711 INFO L462 AbstractCegarLoop]: Abstraction has 46230 states and 66591 transitions. [2019-10-15 01:24:18,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 46230 states and 66591 transitions. [2019-10-15 01:24:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:24:18,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:18,735 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-15 01:24:18,735 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 846994253, now seen corresponding path program 1 times [2019-10-15 01:24:18,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:18,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959537930] [2019-10-15 01:24:18,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:18,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:18,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:18,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959537930] [2019-10-15 01:24:18,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:18,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:18,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262937154] [2019-10-15 01:24:18,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:18,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:18,895 INFO L87 Difference]: Start difference. First operand 46230 states and 66591 transitions. Second operand 4 states. [2019-10-15 01:24:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:21,345 INFO L93 Difference]: Finished difference Result 80972 states and 116685 transitions. [2019-10-15 01:24:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:21,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-15 01:24:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:21,416 INFO L225 Difference]: With dead ends: 80972 [2019-10-15 01:24:21,416 INFO L226 Difference]: Without dead ends: 35645 [2019-10-15 01:24:21,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35645 states. [2019-10-15 01:24:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35645 to 35645. [2019-10-15 01:24:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35645 states. [2019-10-15 01:24:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35645 states to 35645 states and 51181 transitions. [2019-10-15 01:24:23,146 INFO L78 Accepts]: Start accepts. Automaton has 35645 states and 51181 transitions. Word has length 168 [2019-10-15 01:24:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:23,146 INFO L462 AbstractCegarLoop]: Abstraction has 35645 states and 51181 transitions. [2019-10-15 01:24:23,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35645 states and 51181 transitions. [2019-10-15 01:24:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-15 01:24:23,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:23,161 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-15 01:24:23,162 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash 349543820, now seen corresponding path program 1 times [2019-10-15 01:24:23,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:23,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339532222] [2019-10-15 01:24:23,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:23,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339532222] [2019-10-15 01:24:23,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:23,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:23,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823686219] [2019-10-15 01:24:23,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:23,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:23,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:23,266 INFO L87 Difference]: Start difference. First operand 35645 states and 51181 transitions. Second operand 3 states.