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_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:00:14,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:00:14,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:00:14,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:00:14,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:00:14,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:00:14,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:00:14,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:00:14,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:00:14,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:00:14,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:00:14,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:00:14,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:00:14,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:00:14,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:00:14,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:00:14,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:00:14,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:00:14,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:00:14,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:00:14,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:00:14,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:00:14,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:00:14,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:00:14,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:00:14,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:00:14,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:00:14,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:00:14,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:00:14,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:00:14,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:00:14,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:00:14,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:00:14,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:00:14,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:00:14,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:00:14,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:00:14,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:00:14,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:00:14,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:00:14,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:00:14,702 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 09:00:14,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:00:14,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:00:14,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:00:14,717 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:00:14,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:00:14,718 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:00:14,721 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:00:14,721 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:00:14,722 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:00:14,722 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:00:14,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:00:14,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:00:14,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:00:14,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:00:14,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:00:14,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:00:14,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:00:14,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:00:14,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:00:14,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:00:14,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:00:14,727 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:00:14,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:00:14,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:00:14,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:00:14,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:00:14,728 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:00:14,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:00:14,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:00:14,728 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:00:14,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:00:14,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:00:14,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:00:14,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:00:14,778 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:00:14,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 09:00:14,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d84269c/14865bc57845422faf7bb623b7101098/FLAG0062706bd [2019-09-10 09:00:15,556 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:00:15,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 09:00:15,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d84269c/14865bc57845422faf7bb623b7101098/FLAG0062706bd [2019-09-10 09:00:15,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d84269c/14865bc57845422faf7bb623b7101098 [2019-09-10 09:00:15,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:00:15,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:00:15,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:15,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:00:15,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:00:15,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:15" (1/1) ... [2019-09-10 09:00:15,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7268adb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:15, skipping insertion in model container [2019-09-10 09:00:15,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:15" (1/1) ... [2019-09-10 09:00:15,776 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:00:15,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:00:17,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:17,470 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:00:18,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:18,447 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:00:18,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18 WrapperNode [2019-09-10 09:00:18,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:18,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:00:18,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:00:18,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:00:18,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (1/1) ... [2019-09-10 09:00:18,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:00:18,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:00:18,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:00:18,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:00:18,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (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 09:00:18,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:00:18,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:00:18,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:00:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:00:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:00:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:00:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:00:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:00:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:00:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:00:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:00:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:00:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:00:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:00:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:00:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:00:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:00:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:00:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:00:21,888 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:00:21,889 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:00:21,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:21 BoogieIcfgContainer [2019-09-10 09:00:21,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:00:21,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:00:21,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:00:21,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:00:21,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:00:15" (1/3) ... [2019-09-10 09:00:21,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e166bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:21, skipping insertion in model container [2019-09-10 09:00:21,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:18" (2/3) ... [2019-09-10 09:00:21,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e166bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:21, skipping insertion in model container [2019-09-10 09:00:21,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:21" (3/3) ... [2019-09-10 09:00:21,904 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 09:00:21,916 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:00:21,926 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 09:00:21,944 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 09:00:21,977 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:00:21,977 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:00:21,977 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:00:21,978 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:00:21,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:00:21,978 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:00:21,978 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:00:21,978 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:00:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states. [2019-09-10 09:00:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 09:00:22,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:22,074 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] [2019-09-10 09:00:22,078 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1287678275, now seen corresponding path program 1 times [2019-09-10 09:00:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:22,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:22,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:23,066 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 09:00:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:23,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:23,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:23,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:23,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:23,093 INFO L87 Difference]: Start difference. First operand 992 states. Second operand 3 states. [2019-09-10 09:00:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:23,447 INFO L93 Difference]: Finished difference Result 1442 states and 2543 transitions. [2019-09-10 09:00:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:23,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 09:00:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:23,490 INFO L225 Difference]: With dead ends: 1442 [2019-09-10 09:00:23,490 INFO L226 Difference]: Without dead ends: 1434 [2019-09-10 09:00:23,494 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 09:00:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-09-10 09:00:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2019-09-10 09:00:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-10 09:00:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2204 transitions. [2019-09-10 09:00:23,622 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2204 transitions. Word has length 318 [2019-09-10 09:00:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:23,628 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 2204 transitions. [2019-09-10 09:00:23,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2204 transitions. [2019-09-10 09:00:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 09:00:23,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:23,638 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] [2019-09-10 09:00:23,638 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1747906473, now seen corresponding path program 1 times [2019-09-10 09:00:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:23,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:24,154 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 09:00:24,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:24,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:24,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:24,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:24,162 INFO L87 Difference]: Start difference. First operand 1432 states and 2204 transitions. Second operand 3 states. [2019-09-10 09:00:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:24,653 INFO L93 Difference]: Finished difference Result 2408 states and 3731 transitions. [2019-09-10 09:00:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:24,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 09:00:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:24,672 INFO L225 Difference]: With dead ends: 2408 [2019-09-10 09:00:24,672 INFO L226 Difference]: Without dead ends: 2408 [2019-09-10 09:00:24,674 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 09:00:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-09-10 09:00:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2406. [2019-09-10 09:00:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-09-10 09:00:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3730 transitions. [2019-09-10 09:00:24,743 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3730 transitions. Word has length 318 [2019-09-10 09:00:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:24,744 INFO L475 AbstractCegarLoop]: Abstraction has 2406 states and 3730 transitions. [2019-09-10 09:00:24,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3730 transitions. [2019-09-10 09:00:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 09:00:24,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:24,755 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] [2019-09-10 09:00:24,756 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1748245097, now seen corresponding path program 1 times [2019-09-10 09:00:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:24,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:24,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:25,789 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 09:00:25,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:25,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:25,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:25,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:25,792 INFO L87 Difference]: Start difference. First operand 2406 states and 3730 transitions. Second operand 4 states. [2019-09-10 09:00:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:25,973 INFO L93 Difference]: Finished difference Result 4720 states and 7275 transitions. [2019-09-10 09:00:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:25,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 09:00:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:25,999 INFO L225 Difference]: With dead ends: 4720 [2019-09-10 09:00:25,999 INFO L226 Difference]: Without dead ends: 4720 [2019-09-10 09:00:25,999 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 09:00:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2019-09-10 09:00:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 4565. [2019-09-10 09:00:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-09-10 09:00:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 7066 transitions. [2019-09-10 09:00:26,139 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 7066 transitions. Word has length 318 [2019-09-10 09:00:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:26,139 INFO L475 AbstractCegarLoop]: Abstraction has 4565 states and 7066 transitions. [2019-09-10 09:00:26,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 7066 transitions. [2019-09-10 09:00:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 09:00:26,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:26,159 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 09:00:26,160 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1483231033, now seen corresponding path program 1 times [2019-09-10 09:00:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:26,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:26,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:26,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:26,629 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 09:00:26,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:26,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:26,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:26,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:26,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:26,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:26,632 INFO L87 Difference]: Start difference. First operand 4565 states and 7066 transitions. Second operand 3 states. [2019-09-10 09:00:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:26,779 INFO L93 Difference]: Finished difference Result 8958 states and 13788 transitions. [2019-09-10 09:00:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:26,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 09:00:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:26,828 INFO L225 Difference]: With dead ends: 8958 [2019-09-10 09:00:26,828 INFO L226 Difference]: Without dead ends: 8958 [2019-09-10 09:00:26,829 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 09:00:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2019-09-10 09:00:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 8803. [2019-09-10 09:00:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8803 states. [2019-09-10 09:00:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8803 states to 8803 states and 13579 transitions. [2019-09-10 09:00:27,084 INFO L78 Accepts]: Start accepts. Automaton has 8803 states and 13579 transitions. Word has length 320 [2019-09-10 09:00:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:27,084 INFO L475 AbstractCegarLoop]: Abstraction has 8803 states and 13579 transitions. [2019-09-10 09:00:27,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 8803 states and 13579 transitions. [2019-09-10 09:00:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 09:00:27,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:27,104 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 09:00:27,104 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1608891380, now seen corresponding path program 1 times [2019-09-10 09:00:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:27,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:27,357 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 09:00:27,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:27,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:27,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:27,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:27,359 INFO L87 Difference]: Start difference. First operand 8803 states and 13579 transitions. Second operand 3 states. [2019-09-10 09:00:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:27,453 INFO L93 Difference]: Finished difference Result 17573 states and 27098 transitions. [2019-09-10 09:00:27,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:27,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 09:00:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:27,523 INFO L225 Difference]: With dead ends: 17573 [2019-09-10 09:00:27,523 INFO L226 Difference]: Without dead ends: 17573 [2019-09-10 09:00:27,524 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 09:00:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17573 states. [2019-09-10 09:00:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17573 to 8822. [2019-09-10 09:00:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8822 states. [2019-09-10 09:00:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8822 states to 8822 states and 13607 transitions. [2019-09-10 09:00:27,820 INFO L78 Accepts]: Start accepts. Automaton has 8822 states and 13607 transitions. Word has length 320 [2019-09-10 09:00:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:27,820 INFO L475 AbstractCegarLoop]: Abstraction has 8822 states and 13607 transitions. [2019-09-10 09:00:27,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8822 states and 13607 transitions. [2019-09-10 09:00:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 09:00:27,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:27,843 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] [2019-09-10 09:00:27,844 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -290238007, now seen corresponding path program 1 times [2019-09-10 09:00:27,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:27,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:27,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:27,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:28,019 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 09:00:28,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:28,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:28,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:28,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:28,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:28,021 INFO L87 Difference]: Start difference. First operand 8822 states and 13607 transitions. Second operand 3 states. [2019-09-10 09:00:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:28,115 INFO L93 Difference]: Finished difference Result 17591 states and 27119 transitions. [2019-09-10 09:00:28,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:28,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 09:00:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:28,158 INFO L225 Difference]: With dead ends: 17591 [2019-09-10 09:00:28,158 INFO L226 Difference]: Without dead ends: 17591 [2019-09-10 09:00:28,159 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 09:00:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17591 states. [2019-09-10 09:00:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17591 to 8840. [2019-09-10 09:00:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-10 09:00:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 13628 transitions. [2019-09-10 09:00:28,475 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 13628 transitions. Word has length 321 [2019-09-10 09:00:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:28,475 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 13628 transitions. [2019-09-10 09:00:28,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 13628 transitions. [2019-09-10 09:00:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 09:00:28,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:28,496 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 09:00:28,497 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1939877569, now seen corresponding path program 1 times [2019-09-10 09:00:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:28,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:28,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:28,883 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 09:00:28,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:28,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:28,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:28,885 INFO L87 Difference]: Start difference. First operand 8840 states and 13628 transitions. Second operand 4 states. [2019-09-10 09:00:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:29,046 INFO L93 Difference]: Finished difference Result 17518 states and 26968 transitions. [2019-09-10 09:00:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:29,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 09:00:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:29,097 INFO L225 Difference]: With dead ends: 17518 [2019-09-10 09:00:29,098 INFO L226 Difference]: Without dead ends: 17518 [2019-09-10 09:00:29,098 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 09:00:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17518 states. [2019-09-10 09:00:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17518 to 9047. [2019-09-10 09:00:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9047 states. [2019-09-10 09:00:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 13981 transitions. [2019-09-10 09:00:29,399 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 13981 transitions. Word has length 322 [2019-09-10 09:00:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:29,399 INFO L475 AbstractCegarLoop]: Abstraction has 9047 states and 13981 transitions. [2019-09-10 09:00:29,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 13981 transitions. [2019-09-10 09:00:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 09:00:29,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:29,421 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 09:00:29,422 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1116371106, now seen corresponding path program 1 times [2019-09-10 09:00:29,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:29,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:29,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:29,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:29,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:29,812 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 09:00:29,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:29,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:29,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:29,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:29,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:29,814 INFO L87 Difference]: Start difference. First operand 9047 states and 13981 transitions. Second operand 3 states. [2019-09-10 09:00:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:29,951 INFO L93 Difference]: Finished difference Result 17481 states and 26801 transitions. [2019-09-10 09:00:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:29,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 09:00:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:29,985 INFO L225 Difference]: With dead ends: 17481 [2019-09-10 09:00:29,985 INFO L226 Difference]: Without dead ends: 17481 [2019-09-10 09:00:29,986 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 09:00:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17481 states. [2019-09-10 09:00:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17481 to 17326. [2019-09-10 09:00:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17326 states. [2019-09-10 09:00:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17326 states to 17326 states and 26592 transitions. [2019-09-10 09:00:30,313 INFO L78 Accepts]: Start accepts. Automaton has 17326 states and 26592 transitions. Word has length 322 [2019-09-10 09:00:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:30,313 INFO L475 AbstractCegarLoop]: Abstraction has 17326 states and 26592 transitions. [2019-09-10 09:00:30,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17326 states and 26592 transitions. [2019-09-10 09:00:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 09:00:30,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:30,344 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 09:00:30,346 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash -810014832, now seen corresponding path program 1 times [2019-09-10 09:00:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:30,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:30,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:30,518 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 09:00:30,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:30,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:30,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:30,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:30,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:30,521 INFO L87 Difference]: Start difference. First operand 17326 states and 26592 transitions. Second operand 3 states. [2019-09-10 09:00:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:30,631 INFO L93 Difference]: Finished difference Result 33885 states and 51828 transitions. [2019-09-10 09:00:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:30,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 09:00:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:30,693 INFO L225 Difference]: With dead ends: 33885 [2019-09-10 09:00:30,694 INFO L226 Difference]: Without dead ends: 33885 [2019-09-10 09:00:30,695 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 09:00:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33885 states. [2019-09-10 09:00:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33885 to 17430. [2019-09-10 09:00:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17430 states. [2019-09-10 09:00:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 26735 transitions. [2019-09-10 09:00:31,226 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 26735 transitions. Word has length 324 [2019-09-10 09:00:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:31,226 INFO L475 AbstractCegarLoop]: Abstraction has 17430 states and 26735 transitions. [2019-09-10 09:00:31,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 26735 transitions. [2019-09-10 09:00:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 09:00:31,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:31,259 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 09:00:31,259 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash -902236738, now seen corresponding path program 1 times [2019-09-10 09:00:31,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:31,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:31,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:31,438 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 09:00:31,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:31,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:31,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:31,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:31,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:31,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:31,440 INFO L87 Difference]: Start difference. First operand 17430 states and 26735 transitions. Second operand 3 states. [2019-09-10 09:00:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:31,583 INFO L93 Difference]: Finished difference Result 26680 states and 41148 transitions. [2019-09-10 09:00:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:31,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 09:00:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:31,625 INFO L225 Difference]: With dead ends: 26680 [2019-09-10 09:00:31,625 INFO L226 Difference]: Without dead ends: 26680 [2019-09-10 09:00:31,625 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 09:00:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26680 states. [2019-09-10 09:00:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26680 to 21334. [2019-09-10 09:00:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21334 states. [2019-09-10 09:00:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21334 states to 21334 states and 33179 transitions. [2019-09-10 09:00:32,015 INFO L78 Accepts]: Start accepts. Automaton has 21334 states and 33179 transitions. Word has length 324 [2019-09-10 09:00:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:32,016 INFO L475 AbstractCegarLoop]: Abstraction has 21334 states and 33179 transitions. [2019-09-10 09:00:32,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 21334 states and 33179 transitions. [2019-09-10 09:00:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 09:00:32,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:32,054 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] [2019-09-10 09:00:32,055 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1240426541, now seen corresponding path program 1 times [2019-09-10 09:00:32,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:32,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:32,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:32,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:32,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:32,984 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 09:00:32,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:32,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:32,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:32,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:32,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:32,986 INFO L87 Difference]: Start difference. First operand 21334 states and 33179 transitions. Second operand 3 states. [2019-09-10 09:00:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:33,117 INFO L93 Difference]: Finished difference Result 41818 states and 64862 transitions. [2019-09-10 09:00:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:33,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-10 09:00:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:33,177 INFO L225 Difference]: With dead ends: 41818 [2019-09-10 09:00:33,177 INFO L226 Difference]: Without dead ends: 41818 [2019-09-10 09:00:33,178 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 09:00:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41818 states. [2019-09-10 09:00:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41818 to 21459. [2019-09-10 09:00:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21459 states. [2019-09-10 09:00:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 33325 transitions. [2019-09-10 09:00:33,690 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 33325 transitions. Word has length 325 [2019-09-10 09:00:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:33,690 INFO L475 AbstractCegarLoop]: Abstraction has 21459 states and 33325 transitions. [2019-09-10 09:00:33,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 33325 transitions. [2019-09-10 09:00:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 09:00:33,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:33,718 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] [2019-09-10 09:00:33,718 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:33,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash -797625659, now seen corresponding path program 1 times [2019-09-10 09:00:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:33,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:33,906 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 09:00:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:33,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:33,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:33,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:33,909 INFO L87 Difference]: Start difference. First operand 21459 states and 33325 transitions. Second operand 3 states. [2019-09-10 09:00:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:34,083 INFO L93 Difference]: Finished difference Result 32773 states and 51270 transitions. [2019-09-10 09:00:34,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:34,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 09:00:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:34,126 INFO L225 Difference]: With dead ends: 32773 [2019-09-10 09:00:34,126 INFO L226 Difference]: Without dead ends: 32773 [2019-09-10 09:00:34,127 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 09:00:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32773 states. [2019-09-10 09:00:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32773 to 28467. [2019-09-10 09:00:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28467 states. [2019-09-10 09:00:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28467 states to 28467 states and 44825 transitions. [2019-09-10 09:00:34,727 INFO L78 Accepts]: Start accepts. Automaton has 28467 states and 44825 transitions. Word has length 326 [2019-09-10 09:00:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:34,727 INFO L475 AbstractCegarLoop]: Abstraction has 28467 states and 44825 transitions. [2019-09-10 09:00:34,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 28467 states and 44825 transitions. [2019-09-10 09:00:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 09:00:34,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:34,762 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] [2019-09-10 09:00:34,763 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash -880682557, now seen corresponding path program 1 times [2019-09-10 09:00:34,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:34,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:35,146 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 09:00:35,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:35,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:35,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:35,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:35,149 INFO L87 Difference]: Start difference. First operand 28467 states and 44825 transitions. Second operand 4 states. [2019-09-10 09:00:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:35,260 INFO L93 Difference]: Finished difference Result 25931 states and 40770 transitions. [2019-09-10 09:00:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:35,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 09:00:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:35,329 INFO L225 Difference]: With dead ends: 25931 [2019-09-10 09:00:35,330 INFO L226 Difference]: Without dead ends: 25134 [2019-09-10 09:00:35,330 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 09:00:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25134 states. [2019-09-10 09:00:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25134 to 25114. [2019-09-10 09:00:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25114 states. [2019-09-10 09:00:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25114 states to 25114 states and 39503 transitions. [2019-09-10 09:00:35,671 INFO L78 Accepts]: Start accepts. Automaton has 25114 states and 39503 transitions. Word has length 326 [2019-09-10 09:00:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:35,671 INFO L475 AbstractCegarLoop]: Abstraction has 25114 states and 39503 transitions. [2019-09-10 09:00:35,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25114 states and 39503 transitions. [2019-09-10 09:00:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:35,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:35,689 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 09:00:35,690 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 47073857, now seen corresponding path program 1 times [2019-09-10 09:00:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:35,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:36,122 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 09:00:36,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:36,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:00:36,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:36,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:00:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:00:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:00:36,125 INFO L87 Difference]: Start difference. First operand 25114 states and 39503 transitions. Second operand 5 states. [2019-09-10 09:00:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:37,185 INFO L93 Difference]: Finished difference Result 25116 states and 39342 transitions. [2019-09-10 09:00:37,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:00:37,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2019-09-10 09:00:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:37,237 INFO L225 Difference]: With dead ends: 25116 [2019-09-10 09:00:37,237 INFO L226 Difference]: Without dead ends: 25116 [2019-09-10 09:00:37,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:00:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25116 states. [2019-09-10 09:00:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25116 to 25114. [2019-09-10 09:00:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25114 states. [2019-09-10 09:00:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25114 states to 25114 states and 39341 transitions. [2019-09-10 09:00:37,551 INFO L78 Accepts]: Start accepts. Automaton has 25114 states and 39341 transitions. Word has length 327 [2019-09-10 09:00:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:37,551 INFO L475 AbstractCegarLoop]: Abstraction has 25114 states and 39341 transitions. [2019-09-10 09:00:37,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:00:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 25114 states and 39341 transitions. [2019-09-10 09:00:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:37,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:37,567 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 09:00:37,567 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1819119044, now seen corresponding path program 1 times [2019-09-10 09:00:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:37,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:38,071 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 09:00:38,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:38,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:00:38,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:38,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:00:38,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:00:38,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:00:38,073 INFO L87 Difference]: Start difference. First operand 25114 states and 39341 transitions. Second operand 8 states. [2019-09-10 09:00:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:41,633 INFO L93 Difference]: Finished difference Result 129062 states and 204193 transitions. [2019-09-10 09:00:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 09:00:41,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 327 [2019-09-10 09:00:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:41,968 INFO L225 Difference]: With dead ends: 129062 [2019-09-10 09:00:41,969 INFO L226 Difference]: Without dead ends: 129062 [2019-09-10 09:00:41,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-10 09:00:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129062 states. [2019-09-10 09:00:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129062 to 63962. [2019-09-10 09:00:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63962 states. [2019-09-10 09:00:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63962 states to 63962 states and 99672 transitions. [2019-09-10 09:00:43,264 INFO L78 Accepts]: Start accepts. Automaton has 63962 states and 99672 transitions. Word has length 327 [2019-09-10 09:00:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:43,264 INFO L475 AbstractCegarLoop]: Abstraction has 63962 states and 99672 transitions. [2019-09-10 09:00:43,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:00:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 63962 states and 99672 transitions. [2019-09-10 09:00:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:43,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:43,293 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 09:00:43,293 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash -443227393, now seen corresponding path program 1 times [2019-09-10 09:00:43,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:43,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:43,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:00:43,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:43,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:43,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:43,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:43,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:43,855 INFO L87 Difference]: Start difference. First operand 63962 states and 99672 transitions. Second operand 3 states. [2019-09-10 09:00:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:44,328 INFO L93 Difference]: Finished difference Result 122888 states and 191581 transitions. [2019-09-10 09:00:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:44,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 09:00:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:44,498 INFO L225 Difference]: With dead ends: 122888 [2019-09-10 09:00:44,498 INFO L226 Difference]: Without dead ends: 122888 [2019-09-10 09:00:44,498 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 09:00:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122888 states. [2019-09-10 09:00:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122888 to 122772. [2019-09-10 09:00:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122772 states. [2019-09-10 09:00:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122772 states to 122772 states and 191466 transitions. [2019-09-10 09:00:48,298 INFO L78 Accepts]: Start accepts. Automaton has 122772 states and 191466 transitions. Word has length 327 [2019-09-10 09:00:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:48,299 INFO L475 AbstractCegarLoop]: Abstraction has 122772 states and 191466 transitions. [2019-09-10 09:00:48,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 122772 states and 191466 transitions. [2019-09-10 09:00:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:48,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:48,350 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 09:00:48,350 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2072896260, now seen corresponding path program 1 times [2019-09-10 09:00:48,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:48,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:49,005 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 09:00:49,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:49,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:00:49,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:49,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:00:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:00:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:00:49,007 INFO L87 Difference]: Start difference. First operand 122772 states and 191466 transitions. Second operand 9 states. [2019-09-10 09:00:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:51,215 INFO L93 Difference]: Finished difference Result 117636 states and 182988 transitions. [2019-09-10 09:00:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 09:00:51,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-10 09:00:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:51,426 INFO L225 Difference]: With dead ends: 117636 [2019-09-10 09:00:51,426 INFO L226 Difference]: Without dead ends: 117636 [2019-09-10 09:00:51,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:00:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117636 states. [2019-09-10 09:00:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117636 to 62622. [2019-09-10 09:00:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62622 states. [2019-09-10 09:00:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62622 states to 62622 states and 96142 transitions. [2019-09-10 09:00:52,850 INFO L78 Accepts]: Start accepts. Automaton has 62622 states and 96142 transitions. Word has length 327 [2019-09-10 09:00:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:52,851 INFO L475 AbstractCegarLoop]: Abstraction has 62622 states and 96142 transitions. [2019-09-10 09:00:52,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 09:00:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 62622 states and 96142 transitions. [2019-09-10 09:00:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:52,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:52,876 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 09:00:52,877 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1131631352, now seen corresponding path program 1 times [2019-09-10 09:00:52,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:52,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:52,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:53,423 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 09:00:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:53,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:53,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:53,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:53,425 INFO L87 Difference]: Start difference. First operand 62622 states and 96142 transitions. Second operand 4 states. [2019-09-10 09:00:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:53,892 INFO L93 Difference]: Finished difference Result 122089 states and 186743 transitions. [2019-09-10 09:00:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:53,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-10 09:00:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:54,114 INFO L225 Difference]: With dead ends: 122089 [2019-09-10 09:00:54,114 INFO L226 Difference]: Without dead ends: 122089 [2019-09-10 09:00:54,115 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 09:00:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122089 states. [2019-09-10 09:00:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122089 to 121914. [2019-09-10 09:00:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121914 states. [2019-09-10 09:00:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121914 states to 121914 states and 186510 transitions. [2019-09-10 09:00:56,235 INFO L78 Accepts]: Start accepts. Automaton has 121914 states and 186510 transitions. Word has length 327 [2019-09-10 09:00:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:56,235 INFO L475 AbstractCegarLoop]: Abstraction has 121914 states and 186510 transitions. [2019-09-10 09:00:56,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 121914 states and 186510 transitions. [2019-09-10 09:00:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 09:00:56,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:56,283 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] [2019-09-10 09:00:56,283 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -532511749, now seen corresponding path program 1 times [2019-09-10 09:00:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:56,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:56,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:56,537 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 09:00:56,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:56,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:56,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:56,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:56,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:56,540 INFO L87 Difference]: Start difference. First operand 121914 states and 186510 transitions. Second operand 3 states. [2019-09-10 09:00:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:57,290 INFO L93 Difference]: Finished difference Result 237905 states and 362553 transitions. [2019-09-10 09:00:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:57,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 09:00:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:57,652 INFO L225 Difference]: With dead ends: 237905 [2019-09-10 09:00:57,652 INFO L226 Difference]: Without dead ends: 237905 [2019-09-10 09:00:57,652 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 09:00:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237905 states. [2019-09-10 09:01:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237905 to 237738. [2019-09-10 09:01:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237738 states. [2019-09-10 09:01:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237738 states to 237738 states and 362336 transitions. [2019-09-10 09:01:02,822 INFO L78 Accepts]: Start accepts. Automaton has 237738 states and 362336 transitions. Word has length 329 [2019-09-10 09:01:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:02,822 INFO L475 AbstractCegarLoop]: Abstraction has 237738 states and 362336 transitions. [2019-09-10 09:01:02,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 237738 states and 362336 transitions. [2019-09-10 09:01:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 09:01:02,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:02,906 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] [2019-09-10 09:01:02,907 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1923708690, now seen corresponding path program 1 times [2019-09-10 09:01:02,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:02,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:03,094 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 09:01:03,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:03,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:03,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:03,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:03,096 INFO L87 Difference]: Start difference. First operand 237738 states and 362336 transitions. Second operand 3 states. [2019-09-10 09:01:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:07,476 INFO L93 Difference]: Finished difference Result 391919 states and 600630 transitions. [2019-09-10 09:01:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:07,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 09:01:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:07,943 INFO L225 Difference]: With dead ends: 391919 [2019-09-10 09:01:07,943 INFO L226 Difference]: Without dead ends: 391919 [2019-09-10 09:01:07,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 09:01:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391919 states. [2019-09-10 09:01:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391919 to 354730. [2019-09-10 09:01:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354730 states. [2019-09-10 09:01:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354730 states to 354730 states and 545384 transitions. [2019-09-10 09:01:11,598 INFO L78 Accepts]: Start accepts. Automaton has 354730 states and 545384 transitions. Word has length 330 [2019-09-10 09:01:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:11,598 INFO L475 AbstractCegarLoop]: Abstraction has 354730 states and 545384 transitions. [2019-09-10 09:01:11,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 354730 states and 545384 transitions. [2019-09-10 09:01:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 09:01:11,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:11,681 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] [2019-09-10 09:01:11,682 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1189850304, now seen corresponding path program 1 times [2019-09-10 09:01:11,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:11,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:11,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:11,933 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 09:01:11,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:11,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:11,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:11,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:11,936 INFO L87 Difference]: Start difference. First operand 354730 states and 545384 transitions. Second operand 3 states. [2019-09-10 09:01:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:17,577 INFO L93 Difference]: Finished difference Result 656233 states and 1001998 transitions. [2019-09-10 09:01:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:17,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 09:01:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:18,540 INFO L225 Difference]: With dead ends: 656233 [2019-09-10 09:01:18,541 INFO L226 Difference]: Without dead ends: 656233 [2019-09-10 09:01:18,541 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 09:01:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656233 states. [2019-09-10 09:01:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656233 to 656074. [2019-09-10 09:01:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656074 states. [2019-09-10 09:01:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656074 states to 656074 states and 1001797 transitions. [2019-09-10 09:01:34,498 INFO L78 Accepts]: Start accepts. Automaton has 656074 states and 1001797 transitions. Word has length 331 [2019-09-10 09:01:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:34,498 INFO L475 AbstractCegarLoop]: Abstraction has 656074 states and 1001797 transitions. [2019-09-10 09:01:34,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 656074 states and 1001797 transitions. [2019-09-10 09:01:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 09:01:42,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:42,925 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] [2019-09-10 09:01:42,926 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1037795325, now seen corresponding path program 1 times [2019-09-10 09:01:42,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:42,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:42,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:43,303 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 09:01:43,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:43,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:43,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:43,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:43,305 INFO L87 Difference]: Start difference. First operand 656074 states and 1001797 transitions. Second operand 4 states. [2019-09-10 09:01:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:48,211 INFO L93 Difference]: Finished difference Result 1175718 states and 1791535 transitions. [2019-09-10 09:01:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:48,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-09-10 09:01:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:49,970 INFO L225 Difference]: With dead ends: 1175718 [2019-09-10 09:01:49,970 INFO L226 Difference]: Without dead ends: 1175718 [2019-09-10 09:01:49,971 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 09:01:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175718 states. [2019-09-10 09:02:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175718 to 643677. [2019-09-10 09:02:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643677 states. [2019-09-10 09:02:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643677 states to 643677 states and 982405 transitions. [2019-09-10 09:02:25,946 INFO L78 Accepts]: Start accepts. Automaton has 643677 states and 982405 transitions. Word has length 331 [2019-09-10 09:02:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:25,947 INFO L475 AbstractCegarLoop]: Abstraction has 643677 states and 982405 transitions. [2019-09-10 09:02:25,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:02:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 643677 states and 982405 transitions. [2019-09-10 09:02:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 09:02:26,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:26,122 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 09:02:26,123 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1442843131, now seen corresponding path program 1 times [2019-09-10 09:02:26,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:26,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:26,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:26,286 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 09:02:26,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:26,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:26,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:26,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:26,288 INFO L87 Difference]: Start difference. First operand 643677 states and 982405 transitions. Second operand 3 states. [2019-09-10 09:02:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:36,298 INFO L93 Difference]: Finished difference Result 1150330 states and 1753767 transitions. [2019-09-10 09:02:36,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:36,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 09:02:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:38,852 INFO L225 Difference]: With dead ends: 1150330 [2019-09-10 09:02:38,852 INFO L226 Difference]: Without dead ends: 1150330 [2019-09-10 09:02:38,852 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 09:02:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150330 states. [2019-09-10 09:02:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150330 to 644158. [2019-09-10 09:02:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644158 states. [2019-09-10 09:02:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644158 states to 644158 states and 983003 transitions. [2019-09-10 09:02:58,960 INFO L78 Accepts]: Start accepts. Automaton has 644158 states and 983003 transitions. Word has length 334 [2019-09-10 09:02:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:58,960 INFO L475 AbstractCegarLoop]: Abstraction has 644158 states and 983003 transitions. [2019-09-10 09:02:58,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 644158 states and 983003 transitions. [2019-09-10 09:02:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 09:02:59,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:59,141 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] [2019-09-10 09:02:59,141 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash -367233502, now seen corresponding path program 1 times [2019-09-10 09:02:59,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:59,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:01,362 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 09:03:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:01,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:03:01,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:01,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:03:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:03:01,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:03:01,367 INFO L87 Difference]: Start difference. First operand 644158 states and 983003 transitions. Second operand 4 states. [2019-09-10 09:03:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:02,958 INFO L93 Difference]: Finished difference Result 611388 states and 932263 transitions. [2019-09-10 09:03:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:03:02,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-09-10 09:03:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:13,799 INFO L225 Difference]: With dead ends: 611388 [2019-09-10 09:03:13,800 INFO L226 Difference]: Without dead ends: 607220 [2019-09-10 09:03:13,800 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 09:03:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607220 states. [2019-09-10 09:03:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607220 to 606893. [2019-09-10 09:03:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606893 states. [2019-09-10 09:03:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606893 states to 606893 states and 925398 transitions. [2019-09-10 09:03:31,403 INFO L78 Accepts]: Start accepts. Automaton has 606893 states and 925398 transitions. Word has length 335 [2019-09-10 09:03:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:31,403 INFO L475 AbstractCegarLoop]: Abstraction has 606893 states and 925398 transitions. [2019-09-10 09:03:31,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:03:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 606893 states and 925398 transitions. [2019-09-10 09:03:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 09:03:31,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:31,561 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] [2019-09-10 09:03:31,561 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1549078389, now seen corresponding path program 1 times [2019-09-10 09:03:31,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:31,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:31,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:31,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:31,753 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 09:03:31,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:31,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:31,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:31,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:31,755 INFO L87 Difference]: Start difference. First operand 606893 states and 925398 transitions. Second operand 3 states. [2019-09-10 09:03:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:36,169 INFO L93 Difference]: Finished difference Result 1077167 states and 1652268 transitions. [2019-09-10 09:03:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:36,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 09:03:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:47,896 INFO L225 Difference]: With dead ends: 1077167 [2019-09-10 09:03:47,896 INFO L226 Difference]: Without dead ends: 1077167 [2019-09-10 09:03:47,897 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 09:03:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077167 states. [2019-09-10 09:03:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077167 to 962621. [2019-09-10 09:03:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962621 states. [2019-09-10 09:04:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962621 states to 962621 states and 1490779 transitions. [2019-09-10 09:04:15,745 INFO L78 Accepts]: Start accepts. Automaton has 962621 states and 1490779 transitions. Word has length 335 [2019-09-10 09:04:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:15,746 INFO L475 AbstractCegarLoop]: Abstraction has 962621 states and 1490779 transitions. [2019-09-10 09:04:15,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 962621 states and 1490779 transitions. [2019-09-10 09:04:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 09:04:15,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:15,922 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 09:04:15,922 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2057672490, now seen corresponding path program 1 times [2019-09-10 09:04:15,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:15,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:15,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:25,586 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 09:04:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:04:25,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:25,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:04:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:04:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:04:25,588 INFO L87 Difference]: Start difference. First operand 962621 states and 1490779 transitions. Second operand 8 states. [2019-09-10 09:04:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:49,831 INFO L93 Difference]: Finished difference Result 2534275 states and 3871358 transitions. [2019-09-10 09:04:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 09:04:49,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-09-10 09:04:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:55,239 INFO L225 Difference]: With dead ends: 2534275 [2019-09-10 09:04:55,239 INFO L226 Difference]: Without dead ends: 2534275 [2019-09-10 09:04:55,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 09:04:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534275 states. [2019-09-10 09:05:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534275 to 1365157. [2019-09-10 09:05:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365157 states.