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.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:06:13,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:06:13,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:06:13,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:06:13,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:06:13,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:06:13,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:06:13,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:06:13,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:06:13,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:06:13,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:06:13,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:06:13,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:06:13,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:06:13,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:06:13,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:06:13,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:06:13,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:06:13,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:06:13,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:06:13,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:06:13,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:06:13,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:06:13,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:06:13,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:06:13,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:06:13,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:06:13,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:06:13,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:06:13,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:06:13,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:06:13,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:06:13,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:06:13,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:06:13,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:06:13,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:06:13,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:06:13,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:06:13,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:06:13,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:06:13,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:06:13,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:06:13,205 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:06:13,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:06:13,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:06:13,206 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:06:13,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:06:13,208 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:06:13,208 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:06:13,208 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:06:13,208 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:06:13,208 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:06:13,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:06:13,212 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:06:13,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:06:13,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:06:13,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:06:13,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:06:13,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:06:13,213 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:06:13,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:06:13,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:06:13,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:06:13,214 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:06:13,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:06:13,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:13,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:06:13,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:06:13,215 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:06:13,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:06:13,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:06:13,216 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:06:13,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:06:13,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:06:13,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:06:13,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:06:13,301 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:06:13,302 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.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:06:13,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd6d6d3b/01b7cdacbcc1453fa8eda36cb84ee665/FLAGc7866552e [2019-09-10 09:06:14,287 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:06:14,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:06:14,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd6d6d3b/01b7cdacbcc1453fa8eda36cb84ee665/FLAGc7866552e [2019-09-10 09:06:14,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd6d6d3b/01b7cdacbcc1453fa8eda36cb84ee665 [2019-09-10 09:06:14,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:06:14,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:06:14,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:14,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:06:14,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:06:14,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:14" (1/1) ... [2019-09-10 09:06:14,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d77c1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:14, skipping insertion in model container [2019-09-10 09:06:14,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:06:14" (1/1) ... [2019-09-10 09:06:14,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:06:15,279 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:06:19,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:19,977 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:06:23,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:06:23,827 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:06:23,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23 WrapperNode [2019-09-10 09:06:23,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:06:23,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:06:23,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:06:23,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:06:23,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:23,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:23,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:23,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:24,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:24,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:24,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... [2019-09-10 09:06:24,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:06:24,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:06:24,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:06:24,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:06:24,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:06:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:06:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:06:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:06:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:06:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:06:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:06:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:06:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:06:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:06:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:06:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:06:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:06:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:06:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:06:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:06:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:06:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:06:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:06:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:06:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:06:38,822 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:06:38,822 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:06:38,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:38 BoogieIcfgContainer [2019-09-10 09:06:38,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:06:38,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:06:38,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:06:38,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:06:38,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:06:14" (1/3) ... [2019-09-10 09:06:38,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643ee5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:38, skipping insertion in model container [2019-09-10 09:06:38,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:06:23" (2/3) ... [2019-09-10 09:06:38,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643ee5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:06:38, skipping insertion in model container [2019-09-10 09:06:38,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:06:38" (3/3) ... [2019-09-10 09:06:38,837 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:06:38,847 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:06:38,859 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:06:38,876 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:06:38,905 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:06:38,905 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:06:38,905 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:06:38,905 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:06:38,905 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:06:38,906 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:06:38,906 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:06:38,906 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:06:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states. [2019-09-10 09:06:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:39,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:39,091 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:39,093 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1564128118, now seen corresponding path program 1 times [2019-09-10 09:06:39,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:39,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:39,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:39,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06: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 09:06:40,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:40,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:40,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:40,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:40,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:40,317 INFO L87 Difference]: Start difference. First operand 6854 states. Second operand 3 states. [2019-09-10 09:06:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:40,905 INFO L93 Difference]: Finished difference Result 8186 states and 14183 transitions. [2019-09-10 09:06:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:40,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:40,986 INFO L225 Difference]: With dead ends: 8186 [2019-09-10 09:06:40,986 INFO L226 Difference]: Without dead ends: 8178 [2019-09-10 09:06:40,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-09-10 09:06:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8176. [2019-09-10 09:06:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-09-10 09:06:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 13671 transitions. [2019-09-10 09:06:41,299 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 13671 transitions. Word has length 392 [2019-09-10 09:06:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:41,301 INFO L475 AbstractCegarLoop]: Abstraction has 8176 states and 13671 transitions. [2019-09-10 09:06:41,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 13671 transitions. [2019-09-10 09:06:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:41,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:41,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:41,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:41,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash -671030645, now seen corresponding path program 1 times [2019-09-10 09:06:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:41,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:41,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:41,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:41,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:41,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:41,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:41,817 INFO L87 Difference]: Start difference. First operand 8176 states and 13671 transitions. Second operand 3 states. [2019-09-10 09:06:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:42,428 INFO L93 Difference]: Finished difference Result 11950 states and 19913 transitions. [2019-09-10 09:06:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:42,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:42,494 INFO L225 Difference]: With dead ends: 11950 [2019-09-10 09:06:42,495 INFO L226 Difference]: Without dead ends: 11950 [2019-09-10 09:06:42,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11950 states. [2019-09-10 09:06:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11950 to 11948. [2019-09-10 09:06:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11948 states. [2019-09-10 09:06:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 19912 transitions. [2019-09-10 09:06:42,977 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 19912 transitions. Word has length 392 [2019-09-10 09:06:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:42,979 INFO L475 AbstractCegarLoop]: Abstraction has 11948 states and 19912 transitions. [2019-09-10 09:06:42,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 19912 transitions. [2019-09-10 09:06:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:43,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:43,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:43,032 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:43,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash -516159413, now seen corresponding path program 1 times [2019-09-10 09:06:43,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:43,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:43,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:43,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:43,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:43,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:43,456 INFO L87 Difference]: Start difference. First operand 11948 states and 19912 transitions. Second operand 3 states. [2019-09-10 09:06:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:44,463 INFO L93 Difference]: Finished difference Result 18394 states and 30719 transitions. [2019-09-10 09:06:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:44,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:44,534 INFO L225 Difference]: With dead ends: 18394 [2019-09-10 09:06:44,535 INFO L226 Difference]: Without dead ends: 18394 [2019-09-10 09:06:44,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18394 states. [2019-09-10 09:06:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18394 to 18392. [2019-09-10 09:06:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2019-09-10 09:06:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 30718 transitions. [2019-09-10 09:06:44,935 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 30718 transitions. Word has length 392 [2019-09-10 09:06:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:44,936 INFO L475 AbstractCegarLoop]: Abstraction has 18392 states and 30718 transitions. [2019-09-10 09:06:44,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 30718 transitions. [2019-09-10 09:06:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:44,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:44,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:44,991 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1946068491, now seen corresponding path program 1 times [2019-09-10 09:06:44,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:44,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:44,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:45,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:45,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:45,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:45,575 INFO L87 Difference]: Start difference. First operand 18392 states and 30718 transitions. Second operand 3 states. [2019-09-10 09:06:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:47,429 INFO L93 Difference]: Finished difference Result 30398 states and 50591 transitions. [2019-09-10 09:06:47,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:47,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:47,520 INFO L225 Difference]: With dead ends: 30398 [2019-09-10 09:06:47,520 INFO L226 Difference]: Without dead ends: 30398 [2019-09-10 09:06:47,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30398 states. [2019-09-10 09:06:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30398 to 30396. [2019-09-10 09:06:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30396 states. [2019-09-10 09:06:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30396 states to 30396 states and 50590 transitions. [2019-09-10 09:06:48,233 INFO L78 Accepts]: Start accepts. Automaton has 30396 states and 50590 transitions. Word has length 392 [2019-09-10 09:06:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:48,234 INFO L475 AbstractCegarLoop]: Abstraction has 30396 states and 50590 transitions. [2019-09-10 09:06:48,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30396 states and 50590 transitions. [2019-09-10 09:06:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:48,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:48,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:48,315 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2079890613, now seen corresponding path program 1 times [2019-09-10 09:06:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:48,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:48,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:49,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:49,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:49,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:49,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:49,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:49,804 INFO L87 Difference]: Start difference. First operand 30396 states and 50590 transitions. Second operand 3 states. [2019-09-10 09:06:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:50,596 INFO L93 Difference]: Finished difference Result 47014 states and 77915 transitions. [2019-09-10 09:06:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:50,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:50,704 INFO L225 Difference]: With dead ends: 47014 [2019-09-10 09:06:50,704 INFO L226 Difference]: Without dead ends: 47014 [2019-09-10 09:06:50,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-09-10 09:06:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 37068. [2019-09-10 09:06:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37068 states. [2019-09-10 09:06:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37068 states to 37068 states and 61806 transitions. [2019-09-10 09:06:51,451 INFO L78 Accepts]: Start accepts. Automaton has 37068 states and 61806 transitions. Word has length 392 [2019-09-10 09:06:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:51,452 INFO L475 AbstractCegarLoop]: Abstraction has 37068 states and 61806 transitions. [2019-09-10 09:06:51,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 37068 states and 61806 transitions. [2019-09-10 09:06:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:51,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:51,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:51,502 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:51,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1730300334, now seen corresponding path program 1 times [2019-09-10 09:06:51,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:51,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:51,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:51,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:52,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:52,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:52,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:52,210 INFO L87 Difference]: Start difference. First operand 37068 states and 61806 transitions. Second operand 3 states. [2019-09-10 09:06:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:52,466 INFO L93 Difference]: Finished difference Result 53762 states and 89503 transitions. [2019-09-10 09:06:52,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:52,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:52,546 INFO L225 Difference]: With dead ends: 53762 [2019-09-10 09:06:52,546 INFO L226 Difference]: Without dead ends: 53762 [2019-09-10 09:06:52,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53762 states. [2019-09-10 09:06:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53762 to 52864. [2019-09-10 09:06:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52864 states. [2019-09-10 09:06:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52864 states to 52864 states and 87838 transitions. [2019-09-10 09:06:53,623 INFO L78 Accepts]: Start accepts. Automaton has 52864 states and 87838 transitions. Word has length 392 [2019-09-10 09:06:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:53,624 INFO L475 AbstractCegarLoop]: Abstraction has 52864 states and 87838 transitions. [2019-09-10 09:06:53,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52864 states and 87838 transitions. [2019-09-10 09:06:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:53,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:53,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:53,689 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash 580759541, now seen corresponding path program 1 times [2019-09-10 09:06:53,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:53,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:53,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:54,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:54,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:54,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:54,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:54,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:54,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:54,310 INFO L87 Difference]: Start difference. First operand 52864 states and 87838 transitions. Second operand 3 states. [2019-09-10 09:06:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:54,958 INFO L93 Difference]: Finished difference Result 87398 states and 145225 transitions. [2019-09-10 09:06:54,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:54,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:06:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:55,104 INFO L225 Difference]: With dead ends: 87398 [2019-09-10 09:06:55,105 INFO L226 Difference]: Without dead ends: 87398 [2019-09-10 09:06:55,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87398 states. [2019-09-10 09:06:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87398 to 83100. [2019-09-10 09:06:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83100 states. [2019-09-10 09:06:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83100 states to 83100 states and 137312 transitions. [2019-09-10 09:06:57,806 INFO L78 Accepts]: Start accepts. Automaton has 83100 states and 137312 transitions. Word has length 392 [2019-09-10 09:06:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:57,807 INFO L475 AbstractCegarLoop]: Abstraction has 83100 states and 137312 transitions. [2019-09-10 09:06:57,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 83100 states and 137312 transitions. [2019-09-10 09:06:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:06:57,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:57,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:57,878 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash -220383142, now seen corresponding path program 1 times [2019-09-10 09:06:57,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:57,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:59,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:59,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:06:59,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:59,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:06:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:06:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:06:59,464 INFO L87 Difference]: Start difference. First operand 83100 states and 137312 transitions. Second operand 8 states. [2019-09-10 09:07:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:01,050 INFO L93 Difference]: Finished difference Result 192448 states and 320094 transitions. [2019-09-10 09:07:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 09:07:01,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 392 [2019-09-10 09:07:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:01,348 INFO L225 Difference]: With dead ends: 192448 [2019-09-10 09:07:01,348 INFO L226 Difference]: Without dead ends: 192448 [2019-09-10 09:07:01,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-10 09:07:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192448 states. [2019-09-10 09:07:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192448 to 143356. [2019-09-10 09:07:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143356 states. [2019-09-10 09:07:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143356 states to 143356 states and 237940 transitions. [2019-09-10 09:07:06,175 INFO L78 Accepts]: Start accepts. Automaton has 143356 states and 237940 transitions. Word has length 392 [2019-09-10 09:07:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:06,176 INFO L475 AbstractCegarLoop]: Abstraction has 143356 states and 237940 transitions. [2019-09-10 09:07:06,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:07:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 143356 states and 237940 transitions. [2019-09-10 09:07:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:07:06,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:06,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:06,263 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2050190897, now seen corresponding path program 1 times [2019-09-10 09:07:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:06,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:06,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:06,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:06,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:06,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:06,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:06,763 INFO L87 Difference]: Start difference. First operand 143356 states and 237940 transitions. Second operand 3 states. [2019-09-10 09:07:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:07,116 INFO L93 Difference]: Finished difference Result 90670 states and 150733 transitions. [2019-09-10 09:07:07,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:07,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:07:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:07,253 INFO L225 Difference]: With dead ends: 90670 [2019-09-10 09:07:07,254 INFO L226 Difference]: Without dead ends: 90670 [2019-09-10 09:07:07,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90670 states. [2019-09-10 09:07:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90670 to 90668. [2019-09-10 09:07:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90668 states. [2019-09-10 09:07:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90668 states to 90668 states and 150732 transitions. [2019-09-10 09:07:10,776 INFO L78 Accepts]: Start accepts. Automaton has 90668 states and 150732 transitions. Word has length 392 [2019-09-10 09:07:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:10,777 INFO L475 AbstractCegarLoop]: Abstraction has 90668 states and 150732 transitions. [2019-09-10 09:07:10,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 90668 states and 150732 transitions. [2019-09-10 09:07:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:07:10,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:10,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:10,807 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -735449498, now seen corresponding path program 1 times [2019-09-10 09:07:10,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:10,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:10,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:12,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:07:12,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:12,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:07:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:07:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:07:12,415 INFO L87 Difference]: Start difference. First operand 90668 states and 150732 transitions. Second operand 8 states. [2019-09-10 09:07:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:14,976 INFO L93 Difference]: Finished difference Result 431346 states and 716653 transitions. [2019-09-10 09:07:14,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 09:07:14,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 392 [2019-09-10 09:07:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:15,674 INFO L225 Difference]: With dead ends: 431346 [2019-09-10 09:07:15,674 INFO L226 Difference]: Without dead ends: 431346 [2019-09-10 09:07:15,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-10 09:07:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431346 states. [2019-09-10 09:07:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431346 to 265670. [2019-09-10 09:07:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265670 states. [2019-09-10 09:07:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265670 states to 265670 states and 442435 transitions. [2019-09-10 09:07:24,617 INFO L78 Accepts]: Start accepts. Automaton has 265670 states and 442435 transitions. Word has length 392 [2019-09-10 09:07:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:24,618 INFO L475 AbstractCegarLoop]: Abstraction has 265670 states and 442435 transitions. [2019-09-10 09:07:24,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:07:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 265670 states and 442435 transitions. [2019-09-10 09:07:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 09:07:24,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:24,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:24,672 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -425553466, now seen corresponding path program 1 times [2019-09-10 09:07:24,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:24,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:24,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:24,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:24,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:25,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:25,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:07:25,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:25,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:07:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:07:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:25,222 INFO L87 Difference]: Start difference. First operand 265670 states and 442435 transitions. Second operand 3 states. [2019-09-10 09:07:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:26,468 INFO L93 Difference]: Finished difference Result 360416 states and 597992 transitions. [2019-09-10 09:07:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:07:26,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-10 09:07:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:26,971 INFO L225 Difference]: With dead ends: 360416 [2019-09-10 09:07:26,971 INFO L226 Difference]: Without dead ends: 360416 [2019-09-10 09:07:26,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:07:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360416 states. [2019-09-10 09:07:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360416 to 331406. [2019-09-10 09:07:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331406 states. [2019-09-10 09:07:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331406 states to 331406 states and 550407 transitions. [2019-09-10 09:07:36,926 INFO L78 Accepts]: Start accepts. Automaton has 331406 states and 550407 transitions. Word has length 392 [2019-09-10 09:07:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:36,927 INFO L475 AbstractCegarLoop]: Abstraction has 331406 states and 550407 transitions. [2019-09-10 09:07:36,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 331406 states and 550407 transitions. [2019-09-10 09:07:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:07:36,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:36,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:07:36,996 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1875628507, now seen corresponding path program 1 times [2019-09-10 09:07:36,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:36,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:36,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:36,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:36,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:07:37,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:37,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:07:37,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:37,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:07:37,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:07:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:07:37,707 INFO L87 Difference]: Start difference. First operand 331406 states and 550407 transitions. Second operand 7 states. [2019-09-10 09:07:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:52,852 INFO L93 Difference]: Finished difference Result 1542340 states and 2571256 transitions. [2019-09-10 09:07:52,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:07:52,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 396 [2019-09-10 09:07:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:56,585 INFO L225 Difference]: With dead ends: 1542340 [2019-09-10 09:07:56,586 INFO L226 Difference]: Without dead ends: 1542340 [2019-09-10 09:07:56,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:07:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542340 states. [2019-09-10 09:08:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542340 to 778942. [2019-09-10 09:08:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778942 states. [2019-09-10 09:08:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778942 states to 778942 states and 1296863 transitions. [2019-09-10 09:08:31,639 INFO L78 Accepts]: Start accepts. Automaton has 778942 states and 1296863 transitions. Word has length 396 [2019-09-10 09:08:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:08:31,640 INFO L475 AbstractCegarLoop]: Abstraction has 778942 states and 1296863 transitions. [2019-09-10 09:08:31,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:08:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 778942 states and 1296863 transitions. [2019-09-10 09:08:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:08:31,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:08:31,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:08:31,717 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:08:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:08:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1189444082, now seen corresponding path program 1 times [2019-09-10 09:08:31,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:08:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:31,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:08:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:08:31,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:08:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:08:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:08:32,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:08:32,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:08:32,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:08:32,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:08:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:08:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:08:32,143 INFO L87 Difference]: Start difference. First operand 778942 states and 1296863 transitions. Second operand 3 states. [2019-09-10 09:08:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:43,852 INFO L93 Difference]: Finished difference Result 1024668 states and 1693866 transitions. [2019-09-10 09:08:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:08:43,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-10 09:08:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:08:45,582 INFO L225 Difference]: With dead ends: 1024668 [2019-09-10 09:08:45,582 INFO L226 Difference]: Without dead ends: 1024668 [2019-09-10 09:08:45,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 09:08:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024668 states. [2019-09-10 09:09:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024668 to 788926. [2019-09-10 09:09:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788926 states. [2019-09-10 09:09:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788926 states to 788926 states and 1303415 transitions. [2019-09-10 09:09:16,353 INFO L78 Accepts]: Start accepts. Automaton has 788926 states and 1303415 transitions. Word has length 396 [2019-09-10 09:09:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:09:16,354 INFO L475 AbstractCegarLoop]: Abstraction has 788926 states and 1303415 transitions. [2019-09-10 09:09:16,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:09:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 788926 states and 1303415 transitions. [2019-09-10 09:09:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-10 09:09:16,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:09:16,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:09:16,428 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:09:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:09:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1623944903, now seen corresponding path program 1 times [2019-09-10 09:09:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:09:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:09:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:09:16,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:09:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:09:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:09:18,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:09:18,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:09:18,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:09:18,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:09:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:09:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:09:18,740 INFO L87 Difference]: Start difference. First operand 788926 states and 1303415 transitions. Second operand 3 states. [2019-09-10 09:09:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:09:34,523 INFO L93 Difference]: Finished difference Result 1403667 states and 2318513 transitions. [2019-09-10 09:09:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:09:34,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-10 09:09:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:09:36,932 INFO L225 Difference]: With dead ends: 1403667 [2019-09-10 09:09:36,932 INFO L226 Difference]: Without dead ends: 1403667 [2019-09-10 09:09:36,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:09:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403667 states. [2019-09-10 09:10:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403667 to 1403665. [2019-09-10 09:10:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403665 states. [2019-09-10 09:10:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403665 states to 1403665 states and 2318512 transitions. [2019-09-10 09:10:20,805 INFO L78 Accepts]: Start accepts. Automaton has 1403665 states and 2318512 transitions. Word has length 396 [2019-09-10 09:10:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:10:20,805 INFO L475 AbstractCegarLoop]: Abstraction has 1403665 states and 2318512 transitions. [2019-09-10 09:10:20,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:10:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1403665 states and 2318512 transitions. [2019-09-10 09:10:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-10 09:10:20,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:10:20,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:10:20,930 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:10:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:10:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1744022196, now seen corresponding path program 1 times [2019-09-10 09:10:20,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:10:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:10:20,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:10:20,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:10:20,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:10:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:10:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:10:35,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:10:35,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:10:35,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:10:35,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:10:35,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:10:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:10:35,652 INFO L87 Difference]: Start difference. First operand 1403665 states and 2318512 transitions. Second operand 3 states. [2019-09-10 09:11:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:04,090 INFO L93 Difference]: Finished difference Result 2773704 states and 4569459 transitions. [2019-09-10 09:11:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:11:04,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-10 09:11:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:10,018 INFO L225 Difference]: With dead ends: 2773704 [2019-09-10 09:11:10,018 INFO L226 Difference]: Without dead ends: 2773704 [2019-09-10 09:11:10,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:11:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773704 states.