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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:22:26,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:22:26,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:22:26,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:22:26,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:22:26,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:22:26,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:22:26,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:22:26,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:22:26,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:22:26,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:22:26,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:22:26,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:22:26,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:22:26,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:22:26,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:22:26,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:22:26,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:22:26,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:22:26,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:22:26,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:22:26,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:22:26,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:22:26,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:22:26,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:22:26,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:22:26,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:22:26,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:22:26,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:22:26,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:22:26,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:22:26,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:22:26,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:22:26,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:22:26,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:22:26,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:22:26,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:22:26,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:22:26,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:22:26,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:22:26,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:22:26,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:22:26,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:22:26,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:22:26,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:22:26,791 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:22:26,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:22:26,792 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:22:26,792 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:22:26,792 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:22:26,793 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:22:26,793 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:22:26,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:22:26,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:22:26,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:22:26,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:22:26,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:22:26,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:22:26,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:22:26,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:22:26,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:22:26,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:22:26,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:22:26,798 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:22:26,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:22:26,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:22:26,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:22:26,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:22:26,798 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:22:26,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:22:26,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:22:26,799 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:22:26,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:22:26,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:22:26,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:22:26,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:22:26,847 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:22:26,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:22:26,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4fcab02/ba642fd792ba4917b4038d843755eddb/FLAG90e8c034a [2019-09-10 06:22:27,558 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:22:27,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:22:27,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4fcab02/ba642fd792ba4917b4038d843755eddb/FLAG90e8c034a [2019-09-10 06:22:27,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4fcab02/ba642fd792ba4917b4038d843755eddb [2019-09-10 06:22:27,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:22:27,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:22:27,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:22:27,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:22:27,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:22:27,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:22:27" (1/1) ... [2019-09-10 06:22:27,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300edefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:27, skipping insertion in model container [2019-09-10 06:22:27,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:22:27" (1/1) ... [2019-09-10 06:22:27,766 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:22:27,926 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:22:29,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:22:29,327 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:22:30,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:22:30,261 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:22:30,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30 WrapperNode [2019-09-10 06:22:30,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:22:30,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:22:30,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:22:30,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:22:30,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (1/1) ... [2019-09-10 06:22:30,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:22:30,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:22:30,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:22:30,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:22:30,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (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-09-10 06:22:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:22:30,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:22:30,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:22:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:22:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:22:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:22:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:22:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:22:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:22:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:22:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:22:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:22:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:22:30,632 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:22:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:22:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:22:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:22:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:22:33,937 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:22:33,937 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:22:33,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:22:33 BoogieIcfgContainer [2019-09-10 06:22:33,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:22:33,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:22:33,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:22:33,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:22:33,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:22:27" (1/3) ... [2019-09-10 06:22:33,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebb8549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:22:33, skipping insertion in model container [2019-09-10 06:22:33,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:30" (2/3) ... [2019-09-10 06:22:33,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebb8549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:22:33, skipping insertion in model container [2019-09-10 06:22:33,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:22:33" (3/3) ... [2019-09-10 06:22:33,947 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:22:33,958 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:22:33,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:22:34,014 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:22:34,041 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:22:34,042 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:22:34,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:22:34,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:22:34,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:22:34,042 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:22:34,042 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:22:34,043 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:22:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states. [2019-09-10 06:22:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:22:34,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:34,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:34,118 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash -962998080, now seen corresponding path program 1 times [2019-09-10 06:22:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:34,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:34,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:35,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:35,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:35,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:35,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:35,152 INFO L87 Difference]: Start difference. First operand 934 states. Second operand 3 states. [2019-09-10 06:22:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:35,546 INFO L93 Difference]: Finished difference Result 1343 states and 2383 transitions. [2019-09-10 06:22:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:35,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:22:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:35,586 INFO L225 Difference]: With dead ends: 1343 [2019-09-10 06:22:35,586 INFO L226 Difference]: Without dead ends: 1335 [2019-09-10 06:22:35,590 INFO L628 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-09-10 06:22:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-10 06:22:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-09-10 06:22:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-10 06:22:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2029 transitions. [2019-09-10 06:22:35,741 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2029 transitions. Word has length 308 [2019-09-10 06:22:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:35,742 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2029 transitions. [2019-09-10 06:22:35,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2029 transitions. [2019-09-10 06:22:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:22:35,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:35,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:35,752 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash -366101467, now seen corresponding path program 1 times [2019-09-10 06:22:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:36,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:36,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:36,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:36,604 INFO L87 Difference]: Start difference. First operand 1333 states and 2029 transitions. Second operand 4 states. [2019-09-10 06:22:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:36,813 INFO L93 Difference]: Finished difference Result 2617 states and 3959 transitions. [2019-09-10 06:22:36,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:36,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:22:36,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:36,829 INFO L225 Difference]: With dead ends: 2617 [2019-09-10 06:22:36,830 INFO L226 Difference]: Without dead ends: 2617 [2019-09-10 06:22:36,831 INFO L628 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-09-10 06:22:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-09-10 06:22:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2521. [2019-09-10 06:22:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-10 06:22:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3840 transitions. [2019-09-10 06:22:36,904 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3840 transitions. Word has length 308 [2019-09-10 06:22:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:36,905 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 3840 transitions. [2019-09-10 06:22:36,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3840 transitions. [2019-09-10 06:22:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:22:36,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:36,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:36,915 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash -123441129, now seen corresponding path program 1 times [2019-09-10 06:22:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:36,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:36,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:37,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:37,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:37,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:37,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:37,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:37,242 INFO L87 Difference]: Start difference. First operand 2521 states and 3840 transitions. Second operand 3 states. [2019-09-10 06:22:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:37,381 INFO L93 Difference]: Finished difference Result 4956 states and 7508 transitions. [2019-09-10 06:22:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:37,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:22:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:37,415 INFO L225 Difference]: With dead ends: 4956 [2019-09-10 06:22:37,416 INFO L226 Difference]: Without dead ends: 4956 [2019-09-10 06:22:37,416 INFO L628 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-09-10 06:22:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-10 06:22:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4860. [2019-09-10 06:22:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2019-09-10 06:22:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 7389 transitions. [2019-09-10 06:22:37,556 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 7389 transitions. Word has length 310 [2019-09-10 06:22:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:37,557 INFO L475 AbstractCegarLoop]: Abstraction has 4860 states and 7389 transitions. [2019-09-10 06:22:37,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 7389 transitions. [2019-09-10 06:22:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:22:37,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:37,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:37,572 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:37,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1576770148, now seen corresponding path program 1 times [2019-09-10 06:22:37,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:37,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:37,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:37,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:37,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:37,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:37,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:37,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:37,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:37,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:37,741 INFO L87 Difference]: Start difference. First operand 4860 states and 7389 transitions. Second operand 3 states. [2019-09-10 06:22:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:37,882 INFO L93 Difference]: Finished difference Result 9687 states and 14718 transitions. [2019-09-10 06:22:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:37,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:22:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:37,942 INFO L225 Difference]: With dead ends: 9687 [2019-09-10 06:22:37,942 INFO L226 Difference]: Without dead ends: 9687 [2019-09-10 06:22:37,943 INFO L628 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-09-10 06:22:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2019-09-10 06:22:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 4879. [2019-09-10 06:22:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-09-10 06:22:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 7417 transitions. [2019-09-10 06:22:38,200 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 7417 transitions. Word has length 310 [2019-09-10 06:22:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:38,200 INFO L475 AbstractCegarLoop]: Abstraction has 4879 states and 7417 transitions. [2019-09-10 06:22:38,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 7417 transitions. [2019-09-10 06:22:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:22:38,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:38,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:38,217 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 518020883, now seen corresponding path program 1 times [2019-09-10 06:22:38,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:38,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:38,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:38,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:38,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:38,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:38,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:38,461 INFO L87 Difference]: Start difference. First operand 4879 states and 7417 transitions. Second operand 3 states. [2019-09-10 06:22:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:38,557 INFO L93 Difference]: Finished difference Result 9705 states and 14739 transitions. [2019-09-10 06:22:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:38,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:22:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:38,643 INFO L225 Difference]: With dead ends: 9705 [2019-09-10 06:22:38,644 INFO L226 Difference]: Without dead ends: 9705 [2019-09-10 06:22:38,644 INFO L628 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-09-10 06:22:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-09-10 06:22:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 4897. [2019-09-10 06:22:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-09-10 06:22:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 7438 transitions. [2019-09-10 06:22:38,907 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 7438 transitions. Word has length 311 [2019-09-10 06:22:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:38,908 INFO L475 AbstractCegarLoop]: Abstraction has 4897 states and 7438 transitions. [2019-09-10 06:22:38,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 7438 transitions. [2019-09-10 06:22:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:22:38,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:38,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:38,928 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1496757711, now seen corresponding path program 1 times [2019-09-10 06:22:38,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:38,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:38,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:39,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:39,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:39,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:39,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:39,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:39,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:39,337 INFO L87 Difference]: Start difference. First operand 4897 states and 7438 transitions. Second operand 4 states. [2019-09-10 06:22:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:39,474 INFO L93 Difference]: Finished difference Result 9632 states and 14588 transitions. [2019-09-10 06:22:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:39,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:22:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:39,503 INFO L225 Difference]: With dead ends: 9632 [2019-09-10 06:22:39,504 INFO L226 Difference]: Without dead ends: 9632 [2019-09-10 06:22:39,504 INFO L628 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-09-10 06:22:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2019-09-10 06:22:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 5104. [2019-09-10 06:22:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-09-10 06:22:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7791 transitions. [2019-09-10 06:22:39,732 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7791 transitions. Word has length 312 [2019-09-10 06:22:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:39,733 INFO L475 AbstractCegarLoop]: Abstraction has 5104 states and 7791 transitions. [2019-09-10 06:22:39,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7791 transitions. [2019-09-10 06:22:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:22:39,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:39,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:39,748 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1658475278, now seen corresponding path program 1 times [2019-09-10 06:22:39,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:39,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:39,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:39,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:40,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:40,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:40,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:40,045 INFO L87 Difference]: Start difference. First operand 5104 states and 7791 transitions. Second operand 3 states. [2019-09-10 06:22:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:40,184 INFO L93 Difference]: Finished difference Result 9767 states and 14765 transitions. [2019-09-10 06:22:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:22:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:40,205 INFO L225 Difference]: With dead ends: 9767 [2019-09-10 06:22:40,205 INFO L226 Difference]: Without dead ends: 9767 [2019-09-10 06:22:40,205 INFO L628 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-09-10 06:22:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-09-10 06:22:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9671. [2019-09-10 06:22:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-09-10 06:22:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 14646 transitions. [2019-09-10 06:22:40,380 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 14646 transitions. Word has length 312 [2019-09-10 06:22:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:40,381 INFO L475 AbstractCegarLoop]: Abstraction has 9671 states and 14646 transitions. [2019-09-10 06:22:40,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 14646 transitions. [2019-09-10 06:22:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:22:40,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:40,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:40,404 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:40,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1390647390, now seen corresponding path program 1 times [2019-09-10 06:22:40,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:40,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:40,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:40,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:40,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:40,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:40,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:40,638 INFO L87 Difference]: Start difference. First operand 9671 states and 14646 transitions. Second operand 3 states. [2019-09-10 06:22:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:40,744 INFO L93 Difference]: Finished difference Result 18575 states and 27936 transitions. [2019-09-10 06:22:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:40,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:22:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:40,789 INFO L225 Difference]: With dead ends: 18575 [2019-09-10 06:22:40,789 INFO L226 Difference]: Without dead ends: 18575 [2019-09-10 06:22:40,789 INFO L628 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-09-10 06:22:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-09-10 06:22:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 9775. [2019-09-10 06:22:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9775 states. [2019-09-10 06:22:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14789 transitions. [2019-09-10 06:22:41,043 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14789 transitions. Word has length 314 [2019-09-10 06:22:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:41,044 INFO L475 AbstractCegarLoop]: Abstraction has 9775 states and 14789 transitions. [2019-09-10 06:22:41,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14789 transitions. [2019-09-10 06:22:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:22:41,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:41,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:41,067 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash -375836875, now seen corresponding path program 1 times [2019-09-10 06:22:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:41,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:41,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:41,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:41,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:41,224 INFO L87 Difference]: Start difference. First operand 9775 states and 14789 transitions. Second operand 3 states. [2019-09-10 06:22:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:41,323 INFO L93 Difference]: Finished difference Result 18700 states and 28082 transitions. [2019-09-10 06:22:41,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:41,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 06:22:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:41,362 INFO L225 Difference]: With dead ends: 18700 [2019-09-10 06:22:41,362 INFO L226 Difference]: Without dead ends: 18700 [2019-09-10 06:22:41,363 INFO L628 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-09-10 06:22:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18700 states. [2019-09-10 06:22:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18700 to 9900. [2019-09-10 06:22:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9900 states. [2019-09-10 06:22:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 14935 transitions. [2019-09-10 06:22:41,596 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 14935 transitions. Word has length 315 [2019-09-10 06:22:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:41,596 INFO L475 AbstractCegarLoop]: Abstraction has 9900 states and 14935 transitions. [2019-09-10 06:22:41,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 14935 transitions. [2019-09-10 06:22:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:22:41,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:41,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:41,618 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1209893973, now seen corresponding path program 1 times [2019-09-10 06:22:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:41,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:41,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:42,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:42,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:42,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:42,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:42,174 INFO L87 Difference]: Start difference. First operand 9900 states and 14935 transitions. Second operand 4 states. [2019-09-10 06:22:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:42,244 INFO L93 Difference]: Finished difference Result 9525 states and 14413 transitions. [2019-09-10 06:22:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:42,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 06:22:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:42,266 INFO L225 Difference]: With dead ends: 9525 [2019-09-10 06:22:42,267 INFO L226 Difference]: Without dead ends: 8728 [2019-09-10 06:22:42,267 INFO L628 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-09-10 06:22:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-09-10 06:22:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 8708. [2019-09-10 06:22:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8708 states. [2019-09-10 06:22:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8708 states to 8708 states and 13146 transitions. [2019-09-10 06:22:42,402 INFO L78 Accepts]: Start accepts. Automaton has 8708 states and 13146 transitions. Word has length 316 [2019-09-10 06:22:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:42,402 INFO L475 AbstractCegarLoop]: Abstraction has 8708 states and 13146 transitions. [2019-09-10 06:22:42,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8708 states and 13146 transitions. [2019-09-10 06:22:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:22:42,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:42,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:42,424 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash -85064730, now seen corresponding path program 1 times [2019-09-10 06:22:42,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:42,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:42,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06: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-09-10 06:22:43,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:43,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:43,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:43,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:43,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:43,141 INFO L87 Difference]: Start difference. First operand 8708 states and 13146 transitions. Second operand 4 states. [2019-09-10 06:22:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:43,351 INFO L93 Difference]: Finished difference Result 16846 states and 25195 transitions. [2019-09-10 06:22:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:43,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 06:22:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:43,384 INFO L225 Difference]: With dead ends: 16846 [2019-09-10 06:22:43,385 INFO L226 Difference]: Without dead ends: 16846 [2019-09-10 06:22:43,386 INFO L628 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-09-10 06:22:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16846 states. [2019-09-10 06:22:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16846 to 16754. [2019-09-10 06:22:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16754 states. [2019-09-10 06:22:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16754 states to 16754 states and 25082 transitions. [2019-09-10 06:22:43,593 INFO L78 Accepts]: Start accepts. Automaton has 16754 states and 25082 transitions. Word has length 320 [2019-09-10 06:22:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:43,593 INFO L475 AbstractCegarLoop]: Abstraction has 16754 states and 25082 transitions. [2019-09-10 06:22:43,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16754 states and 25082 transitions. [2019-09-10 06:22:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:22:43,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:43,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:43,622 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1595405675, now seen corresponding path program 1 times [2019-09-10 06:22:43,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:43,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:43,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:43,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:43,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:44,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:44,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:44,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:44,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:44,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:44,485 INFO L87 Difference]: Start difference. First operand 16754 states and 25082 transitions. Second operand 3 states. [2019-09-10 06:22:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:44,666 INFO L93 Difference]: Finished difference Result 32418 states and 48064 transitions. [2019-09-10 06:22:44,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:44,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 06:22:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:44,731 INFO L225 Difference]: With dead ends: 32418 [2019-09-10 06:22:44,734 INFO L226 Difference]: Without dead ends: 32418 [2019-09-10 06:22:44,735 INFO L628 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-09-10 06:22:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32418 states. [2019-09-10 06:22:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32418 to 32328. [2019-09-10 06:22:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32328 states. [2019-09-10 06:22:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32328 states to 32328 states and 47955 transitions. [2019-09-10 06:22:45,207 INFO L78 Accepts]: Start accepts. Automaton has 32328 states and 47955 transitions. Word has length 322 [2019-09-10 06:22:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:45,207 INFO L475 AbstractCegarLoop]: Abstraction has 32328 states and 47955 transitions. [2019-09-10 06:22:45,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32328 states and 47955 transitions. [2019-09-10 06:22:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:22:45,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:45,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:45,249 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2112695856, now seen corresponding path program 1 times [2019-09-10 06:22:45,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:45,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:45,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:45,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:45,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:45,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:45,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:45,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:45,530 INFO L87 Difference]: Start difference. First operand 32328 states and 47955 transitions. Second operand 3 states. [2019-09-10 06:22:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:45,800 INFO L93 Difference]: Finished difference Result 63217 states and 93031 transitions. [2019-09-10 06:22:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:45,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 06:22:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:45,958 INFO L225 Difference]: With dead ends: 63217 [2019-09-10 06:22:45,958 INFO L226 Difference]: Without dead ends: 63217 [2019-09-10 06:22:45,959 INFO L628 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-09-10 06:22:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63217 states. [2019-09-10 06:22:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63217 to 63129. [2019-09-10 06:22:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63129 states. [2019-09-10 06:22:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63129 states to 63129 states and 92926 transitions. [2019-09-10 06:22:47,688 INFO L78 Accepts]: Start accepts. Automaton has 63129 states and 92926 transitions. Word has length 324 [2019-09-10 06:22:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:47,688 INFO L475 AbstractCegarLoop]: Abstraction has 63129 states and 92926 transitions. [2019-09-10 06:22:47,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 63129 states and 92926 transitions. [2019-09-10 06:22:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:22:47,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:47,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:47,746 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash -943552819, now seen corresponding path program 1 times [2019-09-10 06:22:47,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:47,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:47,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:47,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:47,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:48,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:48,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:48,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:48,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:48,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:48,136 INFO L87 Difference]: Start difference. First operand 63129 states and 92926 transitions. Second operand 4 states. [2019-09-10 06:22:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:48,502 INFO L93 Difference]: Finished difference Result 104985 states and 153873 transitions. [2019-09-10 06:22:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:48,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 06:22:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:48,714 INFO L225 Difference]: With dead ends: 104985 [2019-09-10 06:22:48,715 INFO L226 Difference]: Without dead ends: 104985 [2019-09-10 06:22:48,716 INFO L628 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-09-10 06:22:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104985 states. [2019-09-10 06:22:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104985 to 61587. [2019-09-10 06:22:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61587 states. [2019-09-10 06:22:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61587 states to 61587 states and 90690 transitions. [2019-09-10 06:22:51,172 INFO L78 Accepts]: Start accepts. Automaton has 61587 states and 90690 transitions. Word has length 324 [2019-09-10 06:22:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:51,172 INFO L475 AbstractCegarLoop]: Abstraction has 61587 states and 90690 transitions. [2019-09-10 06:22:51,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 61587 states and 90690 transitions. [2019-09-10 06:22:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 06:22:51,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:51,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:51,227 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2070798285, now seen corresponding path program 1 times [2019-09-10 06:22:51,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:51,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:51,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:51,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:51,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:51,378 INFO L87 Difference]: Start difference. First operand 61587 states and 90690 transitions. Second operand 3 states. [2019-09-10 06:22:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:51,663 INFO L93 Difference]: Finished difference Result 107467 states and 157554 transitions. [2019-09-10 06:22:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:51,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 06:22:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:51,811 INFO L225 Difference]: With dead ends: 107467 [2019-09-10 06:22:51,812 INFO L226 Difference]: Without dead ends: 107467 [2019-09-10 06:22:51,816 INFO L628 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-09-10 06:22:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107467 states. [2019-09-10 06:22:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107467 to 62068. [2019-09-10 06:22:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62068 states. [2019-09-10 06:22:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62068 states to 62068 states and 91288 transitions. [2019-09-10 06:22:53,098 INFO L78 Accepts]: Start accepts. Automaton has 62068 states and 91288 transitions. Word has length 327 [2019-09-10 06:22:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:53,099 INFO L475 AbstractCegarLoop]: Abstraction has 62068 states and 91288 transitions. [2019-09-10 06:22:53,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62068 states and 91288 transitions. [2019-09-10 06:22:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:22:53,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:53,136 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:53,137 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:53,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash 231783440, now seen corresponding path program 1 times [2019-09-10 06:22:53,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:53,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:53,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:53,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:53,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:53,493 INFO L87 Difference]: Start difference. First operand 62068 states and 91288 transitions. Second operand 4 states. [2019-09-10 06:22:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:53,683 INFO L93 Difference]: Finished difference Result 59880 states and 88293 transitions. [2019-09-10 06:22:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:53,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 06:22:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:53,764 INFO L225 Difference]: With dead ends: 59880 [2019-09-10 06:22:53,764 INFO L226 Difference]: Without dead ends: 55712 [2019-09-10 06:22:53,765 INFO L628 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-09-10 06:22:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55712 states. [2019-09-10 06:22:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55712 to 55385. [2019-09-10 06:22:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55385 states. [2019-09-10 06:22:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55385 states to 55385 states and 81428 transitions. [2019-09-10 06:22:56,498 INFO L78 Accepts]: Start accepts. Automaton has 55385 states and 81428 transitions. Word has length 328 [2019-09-10 06:22:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:56,499 INFO L475 AbstractCegarLoop]: Abstraction has 55385 states and 81428 transitions. [2019-09-10 06:22:56,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 55385 states and 81428 transitions. [2019-09-10 06:22:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:22:56,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:56,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:56,532 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1702036538, now seen corresponding path program 1 times [2019-09-10 06:22:56,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:56,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:56,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:56,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:56,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:56,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:56,787 INFO L87 Difference]: Start difference. First operand 55385 states and 81428 transitions. Second operand 3 states. [2019-09-10 06:22:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:57,867 INFO L93 Difference]: Finished difference Result 98008 states and 143011 transitions. [2019-09-10 06:22:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:57,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 06:22:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:57,980 INFO L225 Difference]: With dead ends: 98008 [2019-09-10 06:22:57,980 INFO L226 Difference]: Without dead ends: 98008 [2019-09-10 06:22:57,981 INFO L628 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-09-10 06:22:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98008 states. [2019-09-10 06:22:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98008 to 97886. [2019-09-10 06:22:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97886 states. [2019-09-10 06:22:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97886 states to 97886 states and 142859 transitions. [2019-09-10 06:22:59,343 INFO L78 Accepts]: Start accepts. Automaton has 97886 states and 142859 transitions. Word has length 332 [2019-09-10 06:22:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:59,344 INFO L475 AbstractCegarLoop]: Abstraction has 97886 states and 142859 transitions. [2019-09-10 06:22:59,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 97886 states and 142859 transitions. [2019-09-10 06:22:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:22:59,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:59,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:22:59,415 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash -651767541, now seen corresponding path program 1 times [2019-09-10 06:22:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:59,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:59,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:59,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:59,975 INFO L87 Difference]: Start difference. First operand 97886 states and 142859 transitions. Second operand 4 states. [2019-09-10 06:23:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:00,637 INFO L93 Difference]: Finished difference Result 166846 states and 243466 transitions. [2019-09-10 06:23:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:00,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 06:23:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:00,806 INFO L225 Difference]: With dead ends: 166846 [2019-09-10 06:23:00,806 INFO L226 Difference]: Without dead ends: 166846 [2019-09-10 06:23:00,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166846 states. [2019-09-10 06:23:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166846 to 166844. [2019-09-10 06:23:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166844 states. [2019-09-10 06:23:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166844 states to 166844 states and 243465 transitions. [2019-09-10 06:23:02,877 INFO L78 Accepts]: Start accepts. Automaton has 166844 states and 243465 transitions. Word has length 332 [2019-09-10 06:23:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:02,878 INFO L475 AbstractCegarLoop]: Abstraction has 166844 states and 243465 transitions. [2019-09-10 06:23:02,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 166844 states and 243465 transitions. [2019-09-10 06:23:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:23:02,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:02,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:23:02,996 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1277621020, now seen corresponding path program 1 times [2019-09-10 06:23:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:02,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:02,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:03,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:03,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:03,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:03,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:03,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:03,602 INFO L87 Difference]: Start difference. First operand 166844 states and 243465 transitions. Second operand 4 states. [2019-09-10 06:23:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:05,273 INFO L93 Difference]: Finished difference Result 307710 states and 445654 transitions. [2019-09-10 06:23:05,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:05,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 06:23:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:05,621 INFO L225 Difference]: With dead ends: 307710 [2019-09-10 06:23:05,621 INFO L226 Difference]: Without dead ends: 307710 [2019-09-10 06:23:05,622 INFO L628 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-09-10 06:23:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307710 states. [2019-09-10 06:23:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307710 to 307640. [2019-09-10 06:23:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307640 states. [2019-09-10 06:23:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307640 states to 307640 states and 445576 transitions. [2019-09-10 06:23:13,309 INFO L78 Accepts]: Start accepts. Automaton has 307640 states and 445576 transitions. Word has length 332 [2019-09-10 06:23:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:13,310 INFO L475 AbstractCegarLoop]: Abstraction has 307640 states and 445576 transitions. [2019-09-10 06:23:13,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 307640 states and 445576 transitions. [2019-09-10 06:23:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 06:23:13,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:13,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:23:13,480 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:13,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash 66956752, now seen corresponding path program 1 times [2019-09-10 06:23:13,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:13,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:13,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:13,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:13,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:13,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:13,706 INFO L87 Difference]: Start difference. First operand 307640 states and 445576 transitions. Second operand 3 states. [2019-09-10 06:23:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:15,082 INFO L93 Difference]: Finished difference Result 601993 states and 864292 transitions. [2019-09-10 06:23:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:15,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 06:23:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:15,878 INFO L225 Difference]: With dead ends: 601993 [2019-09-10 06:23:15,878 INFO L226 Difference]: Without dead ends: 601993 [2019-09-10 06:23:15,878 INFO L628 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-09-10 06:23:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601993 states. [2019-09-10 06:23:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601993 to 601679. [2019-09-10 06:23:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601679 states. [2019-09-10 06:23:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601679 states to 601679 states and 863915 transitions. [2019-09-10 06:23:39,007 INFO L78 Accepts]: Start accepts. Automaton has 601679 states and 863915 transitions. Word has length 334 [2019-09-10 06:23:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:39,007 INFO L475 AbstractCegarLoop]: Abstraction has 601679 states and 863915 transitions. [2019-09-10 06:23:39,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 601679 states and 863915 transitions. [2019-09-10 06:23:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 06:23:39,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:39,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:23:39,516 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1767446664, now seen corresponding path program 1 times [2019-09-10 06:23:39,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:39,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:39,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:39,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:39,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:39,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:39,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:39,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:39,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:39,846 INFO L87 Difference]: Start difference. First operand 601679 states and 863915 transitions. Second operand 4 states. [2019-09-10 06:23:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:51,244 INFO L93 Difference]: Finished difference Result 979432 states and 1403459 transitions. [2019-09-10 06:23:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:51,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-10 06:23:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:52,474 INFO L225 Difference]: With dead ends: 979432 [2019-09-10 06:23:52,474 INFO L226 Difference]: Without dead ends: 978238 [2019-09-10 06:23:52,475 INFO L628 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-09-10 06:23:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978238 states. [2019-09-10 06:24:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978238 to 581140. [2019-09-10 06:24:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581140 states. [2019-09-10 06:24:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581140 states to 581140 states and 834309 transitions. [2019-09-10 06:24:04,139 INFO L78 Accepts]: Start accepts. Automaton has 581140 states and 834309 transitions. Word has length 336 [2019-09-10 06:24:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:04,139 INFO L475 AbstractCegarLoop]: Abstraction has 581140 states and 834309 transitions. [2019-09-10 06:24:04,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 581140 states and 834309 transitions. [2019-09-10 06:24:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 06:24:14,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:14,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:24:14,275 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1206902741, now seen corresponding path program 1 times [2019-09-10 06:24:14,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:14,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:14,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:14,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:14,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:14,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:14,553 INFO L87 Difference]: Start difference. First operand 581140 states and 834309 transitions. Second operand 3 states. [2019-09-10 06:24:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:17,970 INFO L93 Difference]: Finished difference Result 1109897 states and 1578462 transitions. [2019-09-10 06:24:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:17,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 06:24:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:28,564 INFO L225 Difference]: With dead ends: 1109897 [2019-09-10 06:24:28,564 INFO L226 Difference]: Without dead ends: 1109897 [2019-09-10 06:24:28,567 INFO L628 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-09-10 06:24:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109897 states. [2019-09-10 06:24:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109897 to 1109843. [2019-09-10 06:24:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109843 states. [2019-09-10 06:24:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109843 states to 1109843 states and 1578416 transitions. [2019-09-10 06:24:55,693 INFO L78 Accepts]: Start accepts. Automaton has 1109843 states and 1578416 transitions. Word has length 336 [2019-09-10 06:24:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:55,694 INFO L475 AbstractCegarLoop]: Abstraction has 1109843 states and 1578416 transitions. [2019-09-10 06:24:55,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1109843 states and 1578416 transitions. [2019-09-10 06:25:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 06:25:08,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:08,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:25:08,368 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 585987644, now seen corresponding path program 1 times [2019-09-10 06:25:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:08,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:08,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:08,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:08,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:08,547 INFO L87 Difference]: Start difference. First operand 1109843 states and 1578416 transitions. Second operand 3 states. [2019-09-10 06:25:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:24,324 INFO L93 Difference]: Finished difference Result 1913741 states and 2715636 transitions. [2019-09-10 06:25:24,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:24,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-09-10 06:25:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:26,798 INFO L225 Difference]: With dead ends: 1913741 [2019-09-10 06:25:26,799 INFO L226 Difference]: Without dead ends: 1913741 [2019-09-10 06:25:26,799 INFO L628 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-09-10 06:25:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913741 states. [2019-09-10 06:26:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913741 to 1109303. [2019-09-10 06:26:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109303 states. [2019-09-10 06:26:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109303 states to 1109303 states and 1576818 transitions. [2019-09-10 06:26:11,092 INFO L78 Accepts]: Start accepts. Automaton has 1109303 states and 1576818 transitions. Word has length 339 [2019-09-10 06:26:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:11,093 INFO L475 AbstractCegarLoop]: Abstraction has 1109303 states and 1576818 transitions. [2019-09-10 06:26:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1109303 states and 1576818 transitions. [2019-09-10 06:26:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 06:26:24,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:24,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:26:24,537 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1800850424, now seen corresponding path program 1 times [2019-09-10 06:26:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:24,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:24,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:24,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:24,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:24,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:24,840 INFO L87 Difference]: Start difference. First operand 1109303 states and 1576818 transitions. Second operand 4 states. [2019-09-10 06:26:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:27,858 INFO L93 Difference]: Finished difference Result 1034165 states and 1470182 transitions. [2019-09-10 06:26:27,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:27,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2019-09-10 06:26:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:30,459 INFO L225 Difference]: With dead ends: 1034165 [2019-09-10 06:26:30,459 INFO L226 Difference]: Without dead ends: 1012367 [2019-09-10 06:26:30,460 INFO L628 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-09-10 06:26:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012367 states. [2019-09-10 06:26:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012367 to 1009089. [2019-09-10 06:26:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009089 states. [2019-09-10 06:27:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009089 states to 1009089 states and 1432887 transitions. [2019-09-10 06:27:07,032 INFO L78 Accepts]: Start accepts. Automaton has 1009089 states and 1432887 transitions. Word has length 340 [2019-09-10 06:27:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:07,032 INFO L475 AbstractCegarLoop]: Abstraction has 1009089 states and 1432887 transitions. [2019-09-10 06:27:07,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1009089 states and 1432887 transitions. [2019-09-10 06:27:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-10 06:27:07,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:07,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:27:07,676 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash 328896234, now seen corresponding path program 1 times [2019-09-10 06:27:07,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:07,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:09,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:09,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:27:09,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:09,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:27:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:27:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:27:09,810 INFO L87 Difference]: Start difference. First operand 1009089 states and 1432887 transitions. Second operand 8 states. [2019-09-10 06:27:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:16,682 INFO L93 Difference]: Finished difference Result 1711293 states and 2405289 transitions. [2019-09-10 06:27:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:16,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 344 [2019-09-10 06:27:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted.