java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:37,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:37,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:37,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:37,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:37,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:37,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:37,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:37,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:37,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:37,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:37,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:37,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:37,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:37,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:37,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:37,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:37,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:37,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:37,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:37,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:37,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:37,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:37,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:37,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:37,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:37,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:37,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:37,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:37,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:37,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:37,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:37,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:37,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:37,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:37,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:37,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:37,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:37,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:37,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:37,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:37,497 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:22:37,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:37,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:37,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:37,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:37,512 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:37,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:37,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:37,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:37,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:37,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:37,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:37,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:37,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:37,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:37,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:37,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:37,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:37,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:37,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:37,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:37,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:37,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:37,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:37,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:37,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:37,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:37,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:37,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:37,517 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:22:37,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:37,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:37,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:37,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:37,819 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:37,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:37,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6662b29c9/3fcb77ffcfca4e8bb26fd1b1717e984b/FLAG2d637b87b [2019-10-15 01:22:38,491 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:38,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:38,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6662b29c9/3fcb77ffcfca4e8bb26fd1b1717e984b/FLAG2d637b87b [2019-10-15 01:22:38,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6662b29c9/3fcb77ffcfca4e8bb26fd1b1717e984b [2019-10-15 01:22:38,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:38,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:38,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:38,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:38,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:38,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:38" (1/1) ... [2019-10-15 01:22:38,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630a0b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:38, skipping insertion in model container [2019-10-15 01:22:38,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:38" (1/1) ... [2019-10-15 01:22:38,786 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:38,860 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:39,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,427 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:39,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,618 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:39,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39 WrapperNode [2019-10-15 01:22:39,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:39,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:39,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:39,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:39,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:39,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:39,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:39,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:39,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (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:22:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:41,370 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:41,370 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:41,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:41 BoogieIcfgContainer [2019-10-15 01:22:41,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:41,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:41,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:41,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:41,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:38" (1/3) ... [2019-10-15 01:22:41,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed432dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:41, skipping insertion in model container [2019-10-15 01:22:41,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (2/3) ... [2019-10-15 01:22:41,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed432dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:41, skipping insertion in model container [2019-10-15 01:22:41,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:41" (3/3) ... [2019-10-15 01:22:41,380 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:41,390 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:41,399 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:41,411 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:41,438 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:41,438 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:41,439 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:41,439 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:41,439 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:41,439 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:41,439 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:41,439 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-10-15 01:22:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:22:41,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:41,485 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] [2019-10-15 01:22:41,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-10-15 01:22:41,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:41,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716755547] [2019-10-15 01:22:41,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:41,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:42,209 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:22:42,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716755547] [2019-10-15 01:22:42,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:42,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:42,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581105662] [2019-10-15 01:22:42,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:42,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:42,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:42,239 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-10-15 01:22:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:42,555 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-10-15 01:22:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:42,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 01:22:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:42,577 INFO L225 Difference]: With dead ends: 605 [2019-10-15 01:22:42,578 INFO L226 Difference]: Without dead ends: 493 [2019-10-15 01:22:42,582 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:22:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-15 01:22:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-10-15 01:22:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-15 01:22:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-10-15 01:22:42,674 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-10-15 01:22:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:42,677 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-10-15 01:22:42,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-10-15 01:22:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:22:42,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,688 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] [2019-10-15 01:22:42,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,692 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-10-15 01:22:42,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908029530] [2019-10-15 01:22:42,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,139 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:22:43,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908029530] [2019-10-15 01:22:43,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:43,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220274124] [2019-10-15 01:22:43,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:43,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:43,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:43,145 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-10-15 01:22:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,297 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-10-15 01:22:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:43,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-15 01:22:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,303 INFO L225 Difference]: With dead ends: 1423 [2019-10-15 01:22:43,304 INFO L226 Difference]: Without dead ends: 945 [2019-10-15 01:22:43,311 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:22:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-15 01:22:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-10-15 01:22:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-10-15 01:22:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-10-15 01:22:43,395 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-10-15 01:22:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,396 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-10-15 01:22:43,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-10-15 01:22:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:22:43,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,400 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:43,400 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-10-15 01:22:43,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292544058] [2019-10-15 01:22:43,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,519 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:22:43,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292544058] [2019-10-15 01:22:43,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:43,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382089531] [2019-10-15 01:22:43,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:43,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:43,522 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-10-15 01:22:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,607 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-10-15 01:22:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:43,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:22:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,618 INFO L225 Difference]: With dead ends: 2783 [2019-10-15 01:22:43,618 INFO L226 Difference]: Without dead ends: 1872 [2019-10-15 01:22:43,621 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:22:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-10-15 01:22:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-10-15 01:22:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-15 01:22:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-10-15 01:22:43,686 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-10-15 01:22:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,686 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-10-15 01:22:43,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-10-15 01:22:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:43,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,689 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:43,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-10-15 01:22:43,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961163982] [2019-10-15 01:22:43,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,901 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:22:43,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961163982] [2019-10-15 01:22:43,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:43,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100859337] [2019-10-15 01:22:43,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:43,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:43,932 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-10-15 01:22:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,046 INFO L93 Difference]: Finished difference Result 1876 states and 2764 transitions. [2019-10-15 01:22:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:44,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:22:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,056 INFO L225 Difference]: With dead ends: 1876 [2019-10-15 01:22:44,057 INFO L226 Difference]: Without dead ends: 943 [2019-10-15 01:22:44,061 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:22:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-10-15 01:22:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2019-10-15 01:22:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-10-15 01:22:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1387 transitions. [2019-10-15 01:22:44,155 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1387 transitions. Word has length 150 [2019-10-15 01:22:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,156 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1387 transitions. [2019-10-15 01:22:44,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1387 transitions. [2019-10-15 01:22:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:44,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:44,160 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-10-15 01:22:44,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43292564] [2019-10-15 01:22:44,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,393 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:22:44,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43292564] [2019-10-15 01:22:44,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:44,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431864251] [2019-10-15 01:22:44,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:44,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:44,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:44,397 INFO L87 Difference]: Start difference. First operand 943 states and 1387 transitions. Second operand 3 states. [2019-10-15 01:22:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,559 INFO L93 Difference]: Finished difference Result 2159 states and 3193 transitions. [2019-10-15 01:22:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:44,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:22:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,574 INFO L225 Difference]: With dead ends: 2159 [2019-10-15 01:22:44,574 INFO L226 Difference]: Without dead ends: 1396 [2019-10-15 01:22:44,578 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:22:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-10-15 01:22:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-10-15 01:22:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-10-15 01:22:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2025 transitions. [2019-10-15 01:22:44,683 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2025 transitions. Word has length 150 [2019-10-15 01:22:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,683 INFO L462 AbstractCegarLoop]: Abstraction has 1394 states and 2025 transitions. [2019-10-15 01:22:44,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2025 transitions. [2019-10-15 01:22:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:22:44,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,687 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:22:44,688 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-10-15 01:22:44,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347365268] [2019-10-15 01:22:44,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:44,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347365268] [2019-10-15 01:22:44,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:44,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328691182] [2019-10-15 01:22:44,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:44,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:44,880 INFO L87 Difference]: Start difference. First operand 1394 states and 2025 transitions. Second operand 3 states. [2019-10-15 01:22:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:45,319 INFO L93 Difference]: Finished difference Result 3707 states and 5443 transitions. [2019-10-15 01:22:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:45,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 01:22:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:45,333 INFO L225 Difference]: With dead ends: 3707 [2019-10-15 01:22:45,333 INFO L226 Difference]: Without dead ends: 2595 [2019-10-15 01:22:45,337 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:22:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-10-15 01:22:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-10-15 01:22:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-10-15 01:22:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3764 transitions. [2019-10-15 01:22:45,488 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3764 transitions. Word has length 156 [2019-10-15 01:22:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:45,489 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 3764 transitions. [2019-10-15 01:22:45,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3764 transitions. [2019-10-15 01:22:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:22:45,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:45,495 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:22:45,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-10-15 01:22:45,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:45,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391791782] [2019-10-15 01:22:45,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:45,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,815 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:22:45,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391791782] [2019-10-15 01:22:45,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:22:45,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179741517] [2019-10-15 01:22:45,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:22:45,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:22:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:22:45,818 INFO L87 Difference]: Start difference. First operand 2593 states and 3764 transitions. Second operand 6 states. [2019-10-15 01:22:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:46,399 INFO L93 Difference]: Finished difference Result 6395 states and 10006 transitions. [2019-10-15 01:22:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:22:46,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-10-15 01:22:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:46,431 INFO L225 Difference]: With dead ends: 6395 [2019-10-15 01:22:46,431 INFO L226 Difference]: Without dead ends: 5489 [2019-10-15 01:22:46,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:22:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-10-15 01:22:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5453. [2019-10-15 01:22:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-15 01:22:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8364 transitions. [2019-10-15 01:22:46,861 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8364 transitions. Word has length 156 [2019-10-15 01:22:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:46,862 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8364 transitions. [2019-10-15 01:22:46,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:22:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8364 transitions. [2019-10-15 01:22:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:22:46,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:46,868 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:22:46,868 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1936499521, now seen corresponding path program 1 times [2019-10-15 01:22:46,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:46,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958121428] [2019-10-15 01:22:46,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:47,134 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:22:47,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958121428] [2019-10-15 01:22:47,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:47,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:22:47,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269892514] [2019-10-15 01:22:47,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:47,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:47,137 INFO L87 Difference]: Start difference. First operand 5453 states and 8364 transitions. Second operand 8 states. [2019-10-15 01:22:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:47,632 INFO L93 Difference]: Finished difference Result 9061 states and 14264 transitions. [2019-10-15 01:22:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:47,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-15 01:22:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:47,659 INFO L225 Difference]: With dead ends: 9061 [2019-10-15 01:22:47,659 INFO L226 Difference]: Without dead ends: 5455 [2019-10-15 01:22:47,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-10-15 01:22:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2019-10-15 01:22:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-15 01:22:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8328 transitions. [2019-10-15 01:22:47,980 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8328 transitions. Word has length 156 [2019-10-15 01:22:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:47,980 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8328 transitions. [2019-10-15 01:22:47,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:22:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8328 transitions. [2019-10-15 01:22:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:22:47,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:47,987 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:22:47,987 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-10-15 01:22:47,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:47,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106296792] [2019-10-15 01:22:47,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:48,214 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:22:48,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106296792] [2019-10-15 01:22:48,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:48,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:48,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963933412] [2019-10-15 01:22:48,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:48,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:48,216 INFO L87 Difference]: Start difference. First operand 5453 states and 8328 transitions. Second operand 4 states. [2019-10-15 01:22:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:48,929 INFO L93 Difference]: Finished difference Result 14216 states and 21721 transitions. [2019-10-15 01:22:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:48,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-15 01:22:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:48,996 INFO L225 Difference]: With dead ends: 14216 [2019-10-15 01:22:48,997 INFO L226 Difference]: Without dead ends: 8786 [2019-10-15 01:22:49,011 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:22:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-10-15 01:22:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2019-10-15 01:22:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2019-10-15 01:22:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 13279 transitions. [2019-10-15 01:22:49,791 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 13279 transitions. Word has length 156 [2019-10-15 01:22:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:49,791 INFO L462 AbstractCegarLoop]: Abstraction has 8784 states and 13279 transitions. [2019-10-15 01:22:49,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 13279 transitions. [2019-10-15 01:22:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:22:49,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:49,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:49,804 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-10-15 01:22:49,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:49,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957560952] [2019-10-15 01:22:49,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:49,955 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:22:49,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957560952] [2019-10-15 01:22:49,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:49,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:49,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707092022] [2019-10-15 01:22:49,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:49,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:49,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:49,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:49,959 INFO L87 Difference]: Start difference. First operand 8784 states and 13279 transitions. Second operand 3 states. [2019-10-15 01:22:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:51,120 INFO L93 Difference]: Finished difference Result 25169 states and 38128 transitions. [2019-10-15 01:22:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:51,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:22:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:51,167 INFO L225 Difference]: With dead ends: 25169 [2019-10-15 01:22:51,168 INFO L226 Difference]: Without dead ends: 16843 [2019-10-15 01:22:51,192 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:22:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-10-15 01:22:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 16841. [2019-10-15 01:22:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-10-15 01:22:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 25210 transitions. [2019-10-15 01:22:52,331 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 25210 transitions. Word has length 158 [2019-10-15 01:22:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 16841 states and 25210 transitions. [2019-10-15 01:22:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 25210 transitions. [2019-10-15 01:22:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:22:52,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:52,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:52,348 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash 725817844, now seen corresponding path program 1 times [2019-10-15 01:22:52,348 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:52,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875267080] [2019-10-15 01:22:52,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:52,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:52,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:52,536 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:22:52,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875267080] [2019-10-15 01:22:52,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:52,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:52,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123537462] [2019-10-15 01:22:52,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:52,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:52,538 INFO L87 Difference]: Start difference. First operand 16841 states and 25210 transitions. Second operand 4 states. [2019-10-15 01:22:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:53,842 INFO L93 Difference]: Finished difference Result 26903 states and 40236 transitions. [2019-10-15 01:22:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:53,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-15 01:22:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:53,875 INFO L225 Difference]: With dead ends: 26903 [2019-10-15 01:22:53,875 INFO L226 Difference]: Without dead ends: 13712 [2019-10-15 01:22:53,900 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:22:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-10-15 01:22:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 13712. [2019-10-15 01:22:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2019-10-15 01:22:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 20437 transitions. [2019-10-15 01:22:54,632 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 20437 transitions. Word has length 158 [2019-10-15 01:22:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 13712 states and 20437 transitions. [2019-10-15 01:22:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 20437 transitions. [2019-10-15 01:22:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:22:54,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:54,645 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] [2019-10-15 01:22:54,646 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:54,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:54,646 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-10-15 01:22:54,646 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:54,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138487382] [2019-10-15 01:22:54,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:54,855 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:22:54,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138487382] [2019-10-15 01:22:54,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:54,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:54,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127503246] [2019-10-15 01:22:54,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:54,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:54,857 INFO L87 Difference]: Start difference. First operand 13712 states and 20437 transitions. Second operand 4 states. [2019-10-15 01:22:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,193 INFO L93 Difference]: Finished difference Result 40158 states and 59777 transitions. [2019-10-15 01:22:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:56,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-15 01:22:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,275 INFO L225 Difference]: With dead ends: 40158 [2019-10-15 01:22:56,276 INFO L226 Difference]: Without dead ends: 26489 [2019-10-15 01:22:56,315 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:22:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26489 states. [2019-10-15 01:22:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26489 to 26487. [2019-10-15 01:22:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-10-15 01:22:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 39050 transitions. [2019-10-15 01:22:58,278 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 39050 transitions. Word has length 164 [2019-10-15 01:22:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,278 INFO L462 AbstractCegarLoop]: Abstraction has 26487 states and 39050 transitions. [2019-10-15 01:22:58,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 39050 transitions. [2019-10-15 01:22:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 01:22:58,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:58,300 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-10-15 01:22:58,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897209077] [2019-10-15 01:22:58,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,373 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:22:58,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897209077] [2019-10-15 01:22:58,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546521516] [2019-10-15 01:22:58,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,376 INFO L87 Difference]: Start difference. First operand 26487 states and 39050 transitions. Second operand 3 states. [2019-10-15 01:23:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,535 INFO L93 Difference]: Finished difference Result 79261 states and 116893 transitions. [2019-10-15 01:23:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:00,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-15 01:23:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:00,673 INFO L225 Difference]: With dead ends: 79261 [2019-10-15 01:23:00,673 INFO L226 Difference]: Without dead ends: 52883 [2019-10-15 01:23:00,721 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:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52883 states. [2019-10-15 01:23:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52883 to 26493. [2019-10-15 01:23:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26493 states. [2019-10-15 01:23:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 39056 transitions. [2019-10-15 01:23:02,316 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 39056 transitions. Word has length 165 [2019-10-15 01:23:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:02,316 INFO L462 AbstractCegarLoop]: Abstraction has 26493 states and 39056 transitions. [2019-10-15 01:23:02,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 39056 transitions. [2019-10-15 01:23:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:02,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:02,332 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:23:02,332 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-10-15 01:23:02,333 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:02,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001152231] [2019-10-15 01:23:02,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:02,431 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:02,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001152231] [2019-10-15 01:23:02,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:02,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:02,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831371877] [2019-10-15 01:23:02,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:02,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:02,434 INFO L87 Difference]: Start difference. First operand 26493 states and 39056 transitions. Second operand 3 states. [2019-10-15 01:23:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:05,641 INFO L93 Difference]: Finished difference Result 76746 states and 113125 transitions. [2019-10-15 01:23:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:05,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-15 01:23:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:05,797 INFO L225 Difference]: With dead ends: 76746 [2019-10-15 01:23:05,797 INFO L226 Difference]: Without dead ends: 51200 [2019-10-15 01:23:05,833 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:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51200 states. [2019-10-15 01:23:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51200 to 51198. [2019-10-15 01:23:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51198 states. [2019-10-15 01:23:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51198 states to 51198 states and 74563 transitions. [2019-10-15 01:23:08,278 INFO L78 Accepts]: Start accepts. Automaton has 51198 states and 74563 transitions. Word has length 166 [2019-10-15 01:23:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:08,278 INFO L462 AbstractCegarLoop]: Abstraction has 51198 states and 74563 transitions. [2019-10-15 01:23:08,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51198 states and 74563 transitions. [2019-10-15 01:23:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:08,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:08,299 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:23:08,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-10-15 01:23:08,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:08,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065915852] [2019-10-15 01:23:08,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:08,454 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:08,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065915852] [2019-10-15 01:23:08,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:08,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:08,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093179842] [2019-10-15 01:23:08,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:08,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:08,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:08,457 INFO L87 Difference]: Start difference. First operand 51198 states and 74563 transitions. Second operand 4 states. [2019-10-15 01:23:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:10,349 INFO L93 Difference]: Finished difference Result 89658 states and 130557 transitions. [2019-10-15 01:23:10,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:10,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-15 01:23:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:10,444 INFO L225 Difference]: With dead ends: 89658 [2019-10-15 01:23:10,444 INFO L226 Difference]: Without dead ends: 39289 [2019-10-15 01:23:10,484 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:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39289 states.