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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:54:05,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:54:05,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:54:05,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:54:05,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:54:05,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:54:05,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:54:05,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:54:05,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:54:05,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:54:05,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:54:05,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:54:05,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:54:05,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:54:05,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:54:05,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:54:05,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:54:05,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:54:05,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:54:05,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:54:05,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:54:05,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:54:05,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:54:05,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:54:05,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:54:05,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:54:05,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:54:05,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:54:05,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:54:05,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:54:05,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:54:05,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:54:05,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:54:05,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:54:05,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:54:05,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:54:05,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:54:05,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:54:05,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:54:05,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:54:05,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:54:05,708 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 08:54:05,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:54:05,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:54:05,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:54:05,734 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:54:05,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:54:05,735 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:54:05,735 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:54:05,736 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:54:05,736 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:54:05,736 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:54:05,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:54:05,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:54:05,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:54:05,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:54:05,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:54:05,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:54:05,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:54:05,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:54:05,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:54:05,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:54:05,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:54:05,741 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:54:05,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:54:05,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:54:05,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:54:05,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:54:05,742 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:54:05,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:54:05,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:54:05,743 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:54:05,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:54:05,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:54:05,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:54:05,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:54:05,822 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:54:05,823 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:54:05,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0808cec0/0cf64bc5eba449aa94b8f6f3671d3220/FLAGee9643512 [2019-09-10 08:54:06,562 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:54:06,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:54:06,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0808cec0/0cf64bc5eba449aa94b8f6f3671d3220/FLAGee9643512 [2019-09-10 08:54:06,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0808cec0/0cf64bc5eba449aa94b8f6f3671d3220 [2019-09-10 08:54:06,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:54:06,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:54:06,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:54:06,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:54:06,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:54:06,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:54:06" (1/1) ... [2019-09-10 08:54:06,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2231e286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:06, skipping insertion in model container [2019-09-10 08:54:06,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:54:06" (1/1) ... [2019-09-10 08:54:06,775 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:54:06,946 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:54:08,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:54:08,572 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:54:09,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:54:09,705 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:54:09,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09 WrapperNode [2019-09-10 08:54:09,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:54:09,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:54:09,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:54:09,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:54:09,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (1/1) ... [2019-09-10 08:54:09,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:54:09,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:54:09,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:54:09,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:54:09,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (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 08:54:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:54:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:54:09,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:54:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:54:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:54:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:54:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:54:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:54:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:54:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:54:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:54:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:54:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:54:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:54:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:54:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:54:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:54:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:54:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:54:13,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:54:13,142 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:54:13,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:54:13 BoogieIcfgContainer [2019-09-10 08:54:13,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:54:13,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:54:13,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:54:13,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:54:13,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:54:06" (1/3) ... [2019-09-10 08:54:13,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cbb3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:54:13, skipping insertion in model container [2019-09-10 08:54:13,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:09" (2/3) ... [2019-09-10 08:54:13,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cbb3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:54:13, skipping insertion in model container [2019-09-10 08:54:13,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:54:13" (3/3) ... [2019-09-10 08:54:13,154 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:54:13,164 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:54:13,174 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 08:54:13,193 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 08:54:13,222 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:54:13,222 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:54:13,223 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:54:13,223 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:54:13,223 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:54:13,223 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:54:13,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:54:13,224 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:54:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states. [2019-09-10 08:54:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:54:13,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:13,301 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 08:54:13,303 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 913474507, now seen corresponding path program 1 times [2019-09-10 08:54:13,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:13,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:13,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:14,349 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 08:54:14,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:14,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:14,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:14,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:14,373 INFO L87 Difference]: Start difference. First operand 992 states. Second operand 3 states. [2019-09-10 08:54:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:14,709 INFO L93 Difference]: Finished difference Result 1442 states and 2543 transitions. [2019-09-10 08:54:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:14,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:54:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:14,747 INFO L225 Difference]: With dead ends: 1442 [2019-09-10 08:54:14,748 INFO L226 Difference]: Without dead ends: 1434 [2019-09-10 08:54:14,750 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 08:54:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-09-10 08:54:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2019-09-10 08:54:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-10 08:54:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2204 transitions. [2019-09-10 08:54:14,875 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2204 transitions. Word has length 318 [2019-09-10 08:54:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:14,877 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 2204 transitions. [2019-09-10 08:54:14,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2204 transitions. [2019-09-10 08:54:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:54:14,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:14,884 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 08:54:14,885 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash 679727429, now seen corresponding path program 1 times [2019-09-10 08:54:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:14,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:14,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:14,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:15,264 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 08:54:15,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:15,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:15,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:15,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:15,271 INFO L87 Difference]: Start difference. First operand 1432 states and 2204 transitions. Second operand 3 states. [2019-09-10 08:54:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:15,603 INFO L93 Difference]: Finished difference Result 2324 states and 3593 transitions. [2019-09-10 08:54:15,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:15,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:54:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:15,628 INFO L225 Difference]: With dead ends: 2324 [2019-09-10 08:54:15,628 INFO L226 Difference]: Without dead ends: 2324 [2019-09-10 08:54:15,629 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 08:54:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-09-10 08:54:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2322. [2019-09-10 08:54:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-09-10 08:54:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3592 transitions. [2019-09-10 08:54:15,743 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3592 transitions. Word has length 318 [2019-09-10 08:54:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:15,746 INFO L475 AbstractCegarLoop]: Abstraction has 2322 states and 3592 transitions. [2019-09-10 08:54:15,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3592 transitions. [2019-09-10 08:54:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:54:15,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:15,767 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 08:54:15,768 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -40366510, now seen corresponding path program 1 times [2019-09-10 08:54:15,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:15,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:15,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:16,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:16,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:16,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:16,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:16,497 INFO L87 Difference]: Start difference. First operand 2322 states and 3592 transitions. Second operand 3 states. [2019-09-10 08:54:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:16,865 INFO L93 Difference]: Finished difference Result 4152 states and 6445 transitions. [2019-09-10 08:54:16,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:16,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:54:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:16,891 INFO L225 Difference]: With dead ends: 4152 [2019-09-10 08:54:16,892 INFO L226 Difference]: Without dead ends: 4152 [2019-09-10 08:54:16,892 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 08:54:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2019-09-10 08:54:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4150. [2019-09-10 08:54:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4150 states. [2019-09-10 08:54:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 6444 transitions. [2019-09-10 08:54:16,998 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 6444 transitions. Word has length 318 [2019-09-10 08:54:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:16,999 INFO L475 AbstractCegarLoop]: Abstraction has 4150 states and 6444 transitions. [2019-09-10 08:54:16,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 6444 transitions. [2019-09-10 08:54:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:54:17,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:17,012 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 08:54:17,012 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash -40705134, now seen corresponding path program 1 times [2019-09-10 08:54:17,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:17,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:17,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:18,064 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 08:54:18,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:18,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:18,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:18,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:18,067 INFO L87 Difference]: Start difference. First operand 4150 states and 6444 transitions. Second operand 4 states. [2019-09-10 08:54:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:18,286 INFO L93 Difference]: Finished difference Result 8132 states and 12551 transitions. [2019-09-10 08:54:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:18,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 08:54:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:18,328 INFO L225 Difference]: With dead ends: 8132 [2019-09-10 08:54:18,329 INFO L226 Difference]: Without dead ends: 8132 [2019-09-10 08:54:18,329 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 08:54:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2019-09-10 08:54:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 7971. [2019-09-10 08:54:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7971 states. [2019-09-10 08:54:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7971 states to 7971 states and 12336 transitions. [2019-09-10 08:54:18,510 INFO L78 Accepts]: Start accepts. Automaton has 7971 states and 12336 transitions. Word has length 318 [2019-09-10 08:54:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:18,510 INFO L475 AbstractCegarLoop]: Abstraction has 7971 states and 12336 transitions. [2019-09-10 08:54:18,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 7971 states and 12336 transitions. [2019-09-10 08:54:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:54:18,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:18,528 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 08:54:18,528 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash 224308930, now seen corresponding path program 1 times [2019-09-10 08:54:18,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:18,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:18,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:18,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:18,878 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 08:54:18,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:18,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:18,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:18,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:18,881 INFO L87 Difference]: Start difference. First operand 7971 states and 12336 transitions. Second operand 3 states. [2019-09-10 08:54:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:19,059 INFO L93 Difference]: Finished difference Result 15620 states and 24026 transitions. [2019-09-10 08:54:19,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:19,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:54:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:19,135 INFO L225 Difference]: With dead ends: 15620 [2019-09-10 08:54:19,135 INFO L226 Difference]: Without dead ends: 15620 [2019-09-10 08:54:19,136 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 08:54:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-09-10 08:54:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 15459. [2019-09-10 08:54:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15459 states. [2019-09-10 08:54:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15459 states to 15459 states and 23811 transitions. [2019-09-10 08:54:19,603 INFO L78 Accepts]: Start accepts. Automaton has 15459 states and 23811 transitions. Word has length 320 [2019-09-10 08:54:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:19,604 INFO L475 AbstractCegarLoop]: Abstraction has 15459 states and 23811 transitions. [2019-09-10 08:54:19,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15459 states and 23811 transitions. [2019-09-10 08:54:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:54:19,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:19,649 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 08:54:19,650 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 98648583, now seen corresponding path program 1 times [2019-09-10 08:54:19,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:19,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:19,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:20,505 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 08:54:20,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:20,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:20,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:20,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:20,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:20,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:20,510 INFO L87 Difference]: Start difference. First operand 15459 states and 23811 transitions. Second operand 3 states. [2019-09-10 08:54:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:20,665 INFO L93 Difference]: Finished difference Result 30885 states and 47562 transitions. [2019-09-10 08:54:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:20,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:54:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:20,737 INFO L225 Difference]: With dead ends: 30885 [2019-09-10 08:54:20,737 INFO L226 Difference]: Without dead ends: 30885 [2019-09-10 08:54:20,738 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 08:54:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30885 states. [2019-09-10 08:54:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30885 to 15478. [2019-09-10 08:54:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15478 states. [2019-09-10 08:54:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15478 states to 15478 states and 23839 transitions. [2019-09-10 08:54:21,100 INFO L78 Accepts]: Start accepts. Automaton has 15478 states and 23839 transitions. Word has length 320 [2019-09-10 08:54:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:21,100 INFO L475 AbstractCegarLoop]: Abstraction has 15478 states and 23839 transitions. [2019-09-10 08:54:21,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15478 states and 23839 transitions. [2019-09-10 08:54:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:54:21,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:21,129 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 08:54:21,129 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1417301956, now seen corresponding path program 1 times [2019-09-10 08:54:21,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:21,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:21,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:21,292 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 08:54:21,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:21,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:21,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:21,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:21,295 INFO L87 Difference]: Start difference. First operand 15478 states and 23839 transitions. Second operand 3 states. [2019-09-10 08:54:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:21,496 INFO L93 Difference]: Finished difference Result 30903 states and 47583 transitions. [2019-09-10 08:54:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 08:54:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:21,582 INFO L225 Difference]: With dead ends: 30903 [2019-09-10 08:54:21,583 INFO L226 Difference]: Without dead ends: 30903 [2019-09-10 08:54:21,583 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 08:54:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30903 states. [2019-09-10 08:54:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30903 to 15496. [2019-09-10 08:54:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-09-10 08:54:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 23860 transitions. [2019-09-10 08:54:22,143 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 23860 transitions. Word has length 321 [2019-09-10 08:54:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:22,143 INFO L475 AbstractCegarLoop]: Abstraction has 15496 states and 23860 transitions. [2019-09-10 08:54:22,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 23860 transitions. [2019-09-10 08:54:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:54:22,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:22,172 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 08:54:22,173 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash -232337606, now seen corresponding path program 1 times [2019-09-10 08:54:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:22,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:22,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:22,616 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 08:54:22,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:22,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:22,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:22,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:22,619 INFO L87 Difference]: Start difference. First operand 15496 states and 23860 transitions. Second operand 4 states. [2019-09-10 08:54:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:22,777 INFO L93 Difference]: Finished difference Result 30830 states and 47432 transitions. [2019-09-10 08:54:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:22,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 08:54:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:22,837 INFO L225 Difference]: With dead ends: 30830 [2019-09-10 08:54:22,837 INFO L226 Difference]: Without dead ends: 30830 [2019-09-10 08:54:22,838 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 08:54:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30830 states. [2019-09-10 08:54:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30830 to 15703. [2019-09-10 08:54:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15703 states. [2019-09-10 08:54:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15703 states to 15703 states and 24213 transitions. [2019-09-10 08:54:23,450 INFO L78 Accepts]: Start accepts. Automaton has 15703 states and 24213 transitions. Word has length 322 [2019-09-10 08:54:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:23,450 INFO L475 AbstractCegarLoop]: Abstraction has 15703 states and 24213 transitions. [2019-09-10 08:54:23,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 15703 states and 24213 transitions. [2019-09-10 08:54:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:54:23,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:23,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:54:23,480 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1471056227, now seen corresponding path program 1 times [2019-09-10 08:54:23,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:23,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:23,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:23,766 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 08:54:23,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:23,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:23,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:23,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:23,768 INFO L87 Difference]: Start difference. First operand 15703 states and 24213 transitions. Second operand 3 states. [2019-09-10 08:54:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:23,967 INFO L93 Difference]: Finished difference Result 28838 states and 44105 transitions. [2019-09-10 08:54:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:23,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:54:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:24,011 INFO L225 Difference]: With dead ends: 28838 [2019-09-10 08:54:24,012 INFO L226 Difference]: Without dead ends: 28838 [2019-09-10 08:54:24,012 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 08:54:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28838 states. [2019-09-10 08:54:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28838 to 28677. [2019-09-10 08:54:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28677 states. [2019-09-10 08:54:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 43890 transitions. [2019-09-10 08:54:24,485 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 43890 transitions. Word has length 322 [2019-09-10 08:54:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:24,486 INFO L475 AbstractCegarLoop]: Abstraction has 28677 states and 43890 transitions. [2019-09-10 08:54:24,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 43890 transitions. [2019-09-10 08:54:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:54:24,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:24,540 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 08:54:24,541 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash 897525131, now seen corresponding path program 1 times [2019-09-10 08:54:24,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:24,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:24,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:24,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:25,377 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 08:54:25,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:25,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:25,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:25,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:25,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:25,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:25,379 INFO L87 Difference]: Start difference. First operand 28677 states and 43890 transitions. Second operand 3 states. [2019-09-10 08:54:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:25,566 INFO L93 Difference]: Finished difference Result 56587 states and 86424 transitions. [2019-09-10 08:54:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:25,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:54:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:25,643 INFO L225 Difference]: With dead ends: 56587 [2019-09-10 08:54:25,644 INFO L226 Difference]: Without dead ends: 56587 [2019-09-10 08:54:25,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56587 states. [2019-09-10 08:54:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56587 to 28781. [2019-09-10 08:54:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28781 states. [2019-09-10 08:54:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28781 states to 28781 states and 44033 transitions. [2019-09-10 08:54:26,264 INFO L78 Accepts]: Start accepts. Automaton has 28781 states and 44033 transitions. Word has length 324 [2019-09-10 08:54:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:26,265 INFO L475 AbstractCegarLoop]: Abstraction has 28781 states and 44033 transitions. [2019-09-10 08:54:26,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28781 states and 44033 transitions. [2019-09-10 08:54:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:54:26,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:26,300 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 08:54:26,300 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash -660231972, now seen corresponding path program 1 times [2019-09-10 08:54:26,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:26,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:26,497 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 08:54:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:26,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:26,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:26,499 INFO L87 Difference]: Start difference. First operand 28781 states and 44033 transitions. Second operand 3 states. [2019-09-10 08:54:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:26,725 INFO L93 Difference]: Finished difference Result 46199 states and 71144 transitions. [2019-09-10 08:54:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:54:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:26,789 INFO L225 Difference]: With dead ends: 46199 [2019-09-10 08:54:26,790 INFO L226 Difference]: Without dead ends: 46199 [2019-09-10 08:54:26,790 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 08:54:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46199 states. [2019-09-10 08:54:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46199 to 36137. [2019-09-10 08:54:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36137 states. [2019-09-10 08:54:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36137 states to 36137 states and 56147 transitions. [2019-09-10 08:54:27,522 INFO L78 Accepts]: Start accepts. Automaton has 36137 states and 56147 transitions. Word has length 324 [2019-09-10 08:54:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:27,523 INFO L475 AbstractCegarLoop]: Abstraction has 36137 states and 56147 transitions. [2019-09-10 08:54:27,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 36137 states and 56147 transitions. [2019-09-10 08:54:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 08:54:27,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:27,554 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 08:54:27,555 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1347000792, now seen corresponding path program 1 times [2019-09-10 08:54:27,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:27,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:27,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:27,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:27,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:27,743 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 08:54:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:27,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:27,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:27,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:27,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:27,745 INFO L87 Difference]: Start difference. First operand 36137 states and 56147 transitions. Second operand 3 states. [2019-09-10 08:54:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:27,995 INFO L93 Difference]: Finished difference Result 71424 states and 110798 transitions. [2019-09-10 08:54:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:27,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-10 08:54:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:28,089 INFO L225 Difference]: With dead ends: 71424 [2019-09-10 08:54:28,090 INFO L226 Difference]: Without dead ends: 71424 [2019-09-10 08:54:28,090 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 08:54:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71424 states. [2019-09-10 08:54:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71424 to 36262. [2019-09-10 08:54:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36262 states. [2019-09-10 08:54:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36262 states to 36262 states and 56293 transitions. [2019-09-10 08:54:29,215 INFO L78 Accepts]: Start accepts. Automaton has 36262 states and 56293 transitions. Word has length 325 [2019-09-10 08:54:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:29,216 INFO L475 AbstractCegarLoop]: Abstraction has 36262 states and 56293 transitions. [2019-09-10 08:54:29,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36262 states and 56293 transitions. [2019-09-10 08:54:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:54:29,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:29,242 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 08:54:29,242 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -840298597, now seen corresponding path program 1 times [2019-09-10 08:54:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:29,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:29,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:29,447 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 08:54:29,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:29,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:29,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:29,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:29,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:29,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:29,450 INFO L87 Difference]: Start difference. First operand 36262 states and 56293 transitions. Second operand 3 states. [2019-09-10 08:54:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:29,762 INFO L93 Difference]: Finished difference Result 57134 states and 89244 transitions. [2019-09-10 08:54:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:29,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:54:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:29,849 INFO L225 Difference]: With dead ends: 57134 [2019-09-10 08:54:29,849 INFO L226 Difference]: Without dead ends: 57134 [2019-09-10 08:54:29,849 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 08:54:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57134 states. [2019-09-10 08:54:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57134 to 49454. [2019-09-10 08:54:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49454 states. [2019-09-10 08:54:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49454 states to 49454 states and 77863 transitions. [2019-09-10 08:54:30,546 INFO L78 Accepts]: Start accepts. Automaton has 49454 states and 77863 transitions. Word has length 326 [2019-09-10 08:54:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:30,547 INFO L475 AbstractCegarLoop]: Abstraction has 49454 states and 77863 transitions. [2019-09-10 08:54:30,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 49454 states and 77863 transitions. [2019-09-10 08:54:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:54:30,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:30,576 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 08:54:30,576 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:30,577 INFO L82 PathProgramCache]: Analyzing trace with hash 826857406, now seen corresponding path program 1 times [2019-09-10 08:54:30,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:30,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:30,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:30,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:30,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:32,056 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 08:54:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:32,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:32,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:32,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:32,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:32,059 INFO L87 Difference]: Start difference. First operand 49454 states and 77863 transitions. Second operand 4 states. [2019-09-10 08:54:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:32,278 INFO L93 Difference]: Finished difference Result 47065 states and 74054 transitions. [2019-09-10 08:54:32,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:32,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 08:54:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:32,380 INFO L225 Difference]: With dead ends: 47065 [2019-09-10 08:54:32,380 INFO L226 Difference]: Without dead ends: 46268 [2019-09-10 08:54:32,381 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 08:54:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46268 states. [2019-09-10 08:54:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46268 to 46248. [2019-09-10 08:54:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46248 states. [2019-09-10 08:54:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46248 states to 46248 states and 72787 transitions. [2019-09-10 08:54:32,879 INFO L78 Accepts]: Start accepts. Automaton has 46248 states and 72787 transitions. Word has length 326 [2019-09-10 08:54:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:32,880 INFO L475 AbstractCegarLoop]: Abstraction has 46248 states and 72787 transitions. [2019-09-10 08:54:32,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 46248 states and 72787 transitions. [2019-09-10 08:54:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:54:32,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:32,908 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 08:54:32,908 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 289078623, now seen corresponding path program 1 times [2019-09-10 08:54:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:32,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:33,410 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 08:54:33,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:33,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:33,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:33,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:33,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:33,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:33,412 INFO L87 Difference]: Start difference. First operand 46248 states and 72787 transitions. Second operand 5 states. [2019-09-10 08:54:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:34,338 INFO L93 Difference]: Finished difference Result 46250 states and 72482 transitions. [2019-09-10 08:54:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:54:34,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2019-09-10 08:54:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:34,419 INFO L225 Difference]: With dead ends: 46250 [2019-09-10 08:54:34,419 INFO L226 Difference]: Without dead ends: 46250 [2019-09-10 08:54:34,420 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 08:54:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46250 states. [2019-09-10 08:54:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46250 to 46248. [2019-09-10 08:54:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46248 states. [2019-09-10 08:54:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46248 states to 46248 states and 72481 transitions. [2019-09-10 08:54:35,107 INFO L78 Accepts]: Start accepts. Automaton has 46248 states and 72481 transitions. Word has length 327 [2019-09-10 08:54:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:35,107 INFO L475 AbstractCegarLoop]: Abstraction has 46248 states and 72481 transitions. [2019-09-10 08:54:35,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:54:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 46248 states and 72481 transitions. [2019-09-10 08:54:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:54:35,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:35,133 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 08:54:35,133 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1577114278, now seen corresponding path program 1 times [2019-09-10 08:54:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:35,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:35,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:35,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:35,565 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 08:54:35,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:35,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:54:35,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:35,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:54:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:54:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:35,571 INFO L87 Difference]: Start difference. First operand 46248 states and 72481 transitions. Second operand 9 states. [2019-09-10 08:54:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:42,476 INFO L93 Difference]: Finished difference Result 326932 states and 517684 transitions. [2019-09-10 08:54:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:54:42,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-10 08:54:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:42,852 INFO L225 Difference]: With dead ends: 326932 [2019-09-10 08:54:42,852 INFO L226 Difference]: Without dead ends: 326932 [2019-09-10 08:54:42,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:54:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326932 states. [2019-09-10 08:54:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326932 to 140942. [2019-09-10 08:54:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140942 states. [2019-09-10 08:54:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140942 states to 140942 states and 220989 transitions. [2019-09-10 08:54:47,815 INFO L78 Accepts]: Start accepts. Automaton has 140942 states and 220989 transitions. Word has length 327 [2019-09-10 08:54:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:47,815 INFO L475 AbstractCegarLoop]: Abstraction has 140942 states and 220989 transitions. [2019-09-10 08:54:47,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:54:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 140942 states and 220989 transitions. [2019-09-10 08:54:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:54:47,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:47,872 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 08:54:47,872 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:47,873 INFO L82 PathProgramCache]: Analyzing trace with hash 608853482, now seen corresponding path program 1 times [2019-09-10 08:54:47,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:47,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:48,410 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 08:54:48,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:48,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:54:48,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:48,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:54:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:54:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:48,412 INFO L87 Difference]: Start difference. First operand 140942 states and 220989 transitions. Second operand 9 states. [2019-09-10 08:54:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:51,291 INFO L93 Difference]: Finished difference Result 189126 states and 295084 transitions. [2019-09-10 08:54:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:54:51,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-10 08:54:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:51,517 INFO L225 Difference]: With dead ends: 189126 [2019-09-10 08:54:51,517 INFO L226 Difference]: Without dead ends: 189126 [2019-09-10 08:54:51,518 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 08:54:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189126 states. [2019-09-10 08:54:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189126 to 62318. [2019-09-10 08:54:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62318 states. [2019-09-10 08:54:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62318 states to 62318 states and 95522 transitions. [2019-09-10 08:54:52,765 INFO L78 Accepts]: Start accepts. Automaton has 62318 states and 95522 transitions. Word has length 327 [2019-09-10 08:54:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:52,765 INFO L475 AbstractCegarLoop]: Abstraction has 62318 states and 95522 transitions. [2019-09-10 08:54:52,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:54:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 62318 states and 95522 transitions. [2019-09-10 08:54:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:54:52,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:52,790 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 08:54:52,791 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash 575908611, now seen corresponding path program 1 times [2019-09-10 08:54:52,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:52,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:52,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:53,414 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 08:54:53,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:53,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:53,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:53,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:53,416 INFO L87 Difference]: Start difference. First operand 62318 states and 95522 transitions. Second operand 4 states. [2019-09-10 08:54:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:53,875 INFO L93 Difference]: Finished difference Result 121539 states and 185649 transitions. [2019-09-10 08:54:53,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:53,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-10 08:54:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:54,012 INFO L225 Difference]: With dead ends: 121539 [2019-09-10 08:54:54,012 INFO L226 Difference]: Without dead ends: 121539 [2019-09-10 08:54:54,012 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 08:54:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121539 states. [2019-09-10 08:54:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121539 to 121390. [2019-09-10 08:54:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121390 states. [2019-09-10 08:54:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121390 states to 121390 states and 185450 transitions. [2019-09-10 08:54:57,001 INFO L78 Accepts]: Start accepts. Automaton has 121390 states and 185450 transitions. Word has length 327 [2019-09-10 08:54:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:57,002 INFO L475 AbstractCegarLoop]: Abstraction has 121390 states and 185450 transitions. [2019-09-10 08:54:57,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121390 states and 185450 transitions. [2019-09-10 08:54:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 08:54:57,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:57,050 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 08:54:57,051 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:57,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1175028214, now seen corresponding path program 1 times [2019-09-10 08:54:57,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:57,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:57,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:57,312 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 08:54:57,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:57,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:57,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:57,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:57,314 INFO L87 Difference]: Start difference. First operand 121390 states and 185450 transitions. Second operand 3 states. [2019-09-10 08:54:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:58,095 INFO L93 Difference]: Finished difference Result 236957 states and 360705 transitions. [2019-09-10 08:54:58,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:58,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 08:54:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:58,474 INFO L225 Difference]: With dead ends: 236957 [2019-09-10 08:54:58,475 INFO L226 Difference]: Without dead ends: 236957 [2019-09-10 08:54:58,476 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 08:54:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236957 states. [2019-09-10 08:55:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236957 to 236812. [2019-09-10 08:55:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236812 states. [2019-09-10 08:55:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236812 states to 236812 states and 360514 transitions. [2019-09-10 08:55:01,629 INFO L78 Accepts]: Start accepts. Automaton has 236812 states and 360514 transitions. Word has length 329 [2019-09-10 08:55:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:01,629 INFO L475 AbstractCegarLoop]: Abstraction has 236812 states and 360514 transitions. [2019-09-10 08:55:01,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 236812 states and 360514 transitions. [2019-09-10 08:55:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:55:01,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:01,729 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 08:55:01,729 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1006142569, now seen corresponding path program 1 times [2019-09-10 08:55:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:01,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:05,865 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 08:55:05,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:05,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:05,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:05,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:05,868 INFO L87 Difference]: Start difference. First operand 236812 states and 360514 transitions. Second operand 3 states. [2019-09-10 08:55:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:07,014 INFO L93 Difference]: Finished difference Result 389625 states and 596352 transitions. [2019-09-10 08:55:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:07,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:55:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:07,545 INFO L225 Difference]: With dead ends: 389625 [2019-09-10 08:55:07,546 INFO L226 Difference]: Without dead ends: 389625 [2019-09-10 08:55:07,546 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 08:55:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389625 states. [2019-09-10 08:55:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389625 to 353804. [2019-09-10 08:55:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353804 states. [2019-09-10 08:55:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353804 states to 353804 states and 543274 transitions. [2019-09-10 08:55:11,779 INFO L78 Accepts]: Start accepts. Automaton has 353804 states and 543274 transitions. Word has length 330 [2019-09-10 08:55:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:11,780 INFO L475 AbstractCegarLoop]: Abstraction has 353804 states and 543274 transitions. [2019-09-10 08:55:11,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 353804 states and 543274 transitions. [2019-09-10 08:55:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 08:55:12,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:12,857 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 08:55:12,857 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash 517689659, now seen corresponding path program 1 times [2019-09-10 08:55:12,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:12,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:12,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:12,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:12,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:13,119 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 08:55:13,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:13,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:13,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:13,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:13,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:13,121 INFO L87 Difference]: Start difference. First operand 353804 states and 543274 transitions. Second operand 3 states. [2019-09-10 08:55:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:14,805 INFO L93 Difference]: Finished difference Result 694272 states and 1060186 transitions. [2019-09-10 08:55:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:14,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 08:55:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:15,840 INFO L225 Difference]: With dead ends: 694272 [2019-09-10 08:55:15,841 INFO L226 Difference]: Without dead ends: 694272 [2019-09-10 08:55:15,841 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 08:55:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694272 states. [2019-09-10 08:55:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694272 to 694131. [2019-09-10 08:55:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694131 states. [2019-09-10 08:55:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694131 states to 694131 states and 1060003 transitions. [2019-09-10 08:55:31,866 INFO L78 Accepts]: Start accepts. Automaton has 694131 states and 1060003 transitions. Word has length 331 [2019-09-10 08:55:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:31,866 INFO L475 AbstractCegarLoop]: Abstraction has 694131 states and 1060003 transitions. [2019-09-10 08:55:31,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 694131 states and 1060003 transitions. [2019-09-10 08:55:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 08:55:39,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:39,943 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 08:55:39,944 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash 669744638, now seen corresponding path program 1 times [2019-09-10 08:55:39,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:39,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:39,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:40,284 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 08:55:40,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:40,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:40,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:40,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:40,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:40,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:40,286 INFO L87 Difference]: Start difference. First operand 694131 states and 1060003 transitions. Second operand 4 states. [2019-09-10 08:55:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:43,999 INFO L93 Difference]: Finished difference Result 1208542 states and 1840683 transitions. [2019-09-10 08:55:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:44,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-09-10 08:55:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:54,074 INFO L225 Difference]: With dead ends: 1208542 [2019-09-10 08:55:54,074 INFO L226 Difference]: Without dead ends: 1208542 [2019-09-10 08:55:54,075 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 08:55:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208542 states. [2019-09-10 08:56:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208542 to 677755. [2019-09-10 08:56:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677755 states. [2019-09-10 08:56:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677755 states to 677755 states and 1034329 transitions. [2019-09-10 08:56:17,734 INFO L78 Accepts]: Start accepts. Automaton has 677755 states and 1034329 transitions. Word has length 331 [2019-09-10 08:56:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 677755 states and 1034329 transitions. [2019-09-10 08:56:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 677755 states and 1034329 transitions. [2019-09-10 08:56:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 08:56:17,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:17,926 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 08:56:17,927 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1144584202, now seen corresponding path program 1 times [2019-09-10 08:56:17,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:17,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:17,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:18,086 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 08:56:18,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:18,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:18,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:18,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:18,088 INFO L87 Difference]: Start difference. First operand 677755 states and 1034329 transitions. Second operand 3 states. [2019-09-10 08:56:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:32,798 INFO L93 Difference]: Finished difference Result 1205368 states and 1837401 transitions. [2019-09-10 08:56:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:32,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 08:56:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:34,474 INFO L225 Difference]: With dead ends: 1205368 [2019-09-10 08:56:34,474 INFO L226 Difference]: Without dead ends: 1205368 [2019-09-10 08:56:34,474 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 08:56:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205368 states. [2019-09-10 08:56:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205368 to 678236. [2019-09-10 08:56:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678236 states. [2019-09-10 08:57:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678236 states to 678236 states and 1034927 transitions. [2019-09-10 08:57:06,266 INFO L78 Accepts]: Start accepts. Automaton has 678236 states and 1034927 transitions. Word has length 334 [2019-09-10 08:57:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:06,267 INFO L475 AbstractCegarLoop]: Abstraction has 678236 states and 1034927 transitions. [2019-09-10 08:57:06,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 678236 states and 1034927 transitions. [2019-09-10 08:57:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 08:57:06,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:06,462 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 08:57:06,462 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1340306461, now seen corresponding path program 1 times [2019-09-10 08:57:06,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:06,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:06,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:06,809 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 08:57:06,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:06,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:06,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:06,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:06,811 INFO L87 Difference]: Start difference. First operand 678236 states and 1034927 transitions. Second operand 4 states. [2019-09-10 08:57:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:10,240 INFO L93 Difference]: Finished difference Result 609874 states and 928963 transitions. [2019-09-10 08:57:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:10,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-09-10 08:57:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:11,174 INFO L225 Difference]: With dead ends: 609874 [2019-09-10 08:57:11,174 INFO L226 Difference]: Without dead ends: 605706 [2019-09-10 08:57:11,175 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 08:57:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605706 states. [2019-09-10 08:57:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605706 to 605379. [2019-09-10 08:57:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605379 states. [2019-09-10 08:57:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605379 states to 605379 states and 922098 transitions. [2019-09-10 08:57:27,546 INFO L78 Accepts]: Start accepts. Automaton has 605379 states and 922098 transitions. Word has length 335 [2019-09-10 08:57:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:27,546 INFO L475 AbstractCegarLoop]: Abstraction has 605379 states and 922098 transitions. [2019-09-10 08:57:27,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 605379 states and 922098 transitions. [2019-09-10 08:57:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 08:57:27,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:27,745 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 08:57:27,745 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:27,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1667913666, now seen corresponding path program 1 times [2019-09-10 08:57:27,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:27,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:27,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:35,952 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 08:57:35,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:35,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:35,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:35,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:35,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:35,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:35,954 INFO L87 Difference]: Start difference. First operand 605379 states and 922098 transitions. Second operand 3 states. [2019-09-10 08:57:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:39,700 INFO L93 Difference]: Finished difference Result 1075571 states and 1649878 transitions. [2019-09-10 08:57:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 08:57:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:41,341 INFO L225 Difference]: With dead ends: 1075571 [2019-09-10 08:57:41,341 INFO L226 Difference]: Without dead ends: 1075571 [2019-09-10 08:57:41,341 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 08:57:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075571 states. [2019-09-10 08:58:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075571 to 961107. [2019-09-10 08:58:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961107 states. [2019-09-10 08:58:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961107 states to 961107 states and 1488471 transitions. [2019-09-10 08:58:19,457 INFO L78 Accepts]: Start accepts. Automaton has 961107 states and 1488471 transitions. Word has length 335 [2019-09-10 08:58:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:19,457 INFO L475 AbstractCegarLoop]: Abstraction has 961107 states and 1488471 transitions. [2019-09-10 08:58:19,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 961107 states and 1488471 transitions. [2019-09-10 08:58:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:58:19,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:19,631 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 08:58:19,631 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -635286330, now seen corresponding path program 1 times [2019-09-10 08:58:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:19,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:20,065 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 08:58:20,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:20,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:58:20,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:20,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:58:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:58:20,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:58:20,070 INFO L87 Difference]: Start difference. First operand 961107 states and 1488471 transitions. Second operand 8 states. [2019-09-10 08:58:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:44,764 INFO L93 Difference]: Finished difference Result 2530867 states and 3862582 transitions. [2019-09-10 08:58:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:58:44,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-09-10 08:58:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:50,456 INFO L225 Difference]: With dead ends: 2530867 [2019-09-10 08:58:50,456 INFO L226 Difference]: Without dead ends: 2530867 [2019-09-10 08:58:50,456 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 08:58:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530867 states. [2019-09-10 08:59:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530867 to 1363011. [2019-09-10 08:59:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363011 states.