java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:22:36,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:22:36,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:22:36,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:22:36,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:22:36,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:22:36,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:22:36,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:22:36,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:22:36,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:22:36,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:22:36,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:22:36,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:22:36,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:22:36,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:22:36,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:22:36,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:22:36,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:22:36,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:22:36,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:22:36,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:22:36,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:22:36,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:22:36,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:22:36,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:22:36,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:22:36,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:22:36,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:22:36,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:22:36,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:22:36,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:22:36,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:22:36,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:22:36,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:22:36,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:22:36,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:22:36,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:22:36,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:22:36,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:22:36,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:22:36,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:22:36,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:22:36,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:22:36,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:22:36,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:22:36,164 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:22:36,164 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:22:36,165 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:22:36,165 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:22:36,165 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:22:36,165 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:22:36,165 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:22:36,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:22:36,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:22:36,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:22:36,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:22:36,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:22:36,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:22:36,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:22:36,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:22:36,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:22:36,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:22:36,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:22:36,170 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:22:36,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:22:36,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:22:36,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:22:36,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:22:36,172 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:22:36,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:22:36,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:22:36,172 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:22:36,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:22:36,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:22:36,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:22:36,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:22:36,242 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:22:36,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:22:36,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fe63be6/42fee3b3c95c44959aeee798f47feb0b/FLAGdd78b2db7 [2019-09-10 06:22:36,965 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:22:36,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:22:36,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fe63be6/42fee3b3c95c44959aeee798f47feb0b/FLAGdd78b2db7 [2019-09-10 06:22:37,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fe63be6/42fee3b3c95c44959aeee798f47feb0b [2019-09-10 06:22:37,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:22:37,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:22:37,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:22:37,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:22:37,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:22:37,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:22:37" (1/1) ... [2019-09-10 06:22:37,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf7c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:37, skipping insertion in model container [2019-09-10 06:22:37,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:22:37" (1/1) ... [2019-09-10 06:22:37,126 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:22:37,234 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:22:38,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:22:38,180 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:22:38,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:22:38,677 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:22:38,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38 WrapperNode [2019-09-10 06:22:38,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:22:38,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:22:38,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:22:38,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:22:38,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... [2019-09-10 06:22:38,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:22:38,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:22:38,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:22:38,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:22:38,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:22:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:22:38,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:22:38,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:22:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:22:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:22:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:22:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:22:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:22:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:22:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:22:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:22:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:22:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:22:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:22:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:22:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:22:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:22:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:22:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:22:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:22:41,287 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:22:41,287 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:22:41,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:22:41 BoogieIcfgContainer [2019-09-10 06:22:41,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:22:41,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:22:41,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:22:41,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:22:41,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:22:37" (1/3) ... [2019-09-10 06:22:41,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dd106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:22:41, skipping insertion in model container [2019-09-10 06:22:41,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:38" (2/3) ... [2019-09-10 06:22:41,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dd106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:22:41, skipping insertion in model container [2019-09-10 06:22:41,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:22:41" (3/3) ... [2019-09-10 06:22:41,297 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:22:41,307 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:22:41,331 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:22:41,349 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:22:41,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:22:41,383 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:22:41,383 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:22:41,383 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:22:41,384 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:22:41,384 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:22:41,384 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:22:41,384 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:22:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-09-10 06:22:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:22:41,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:41,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:41,450 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 246150438, now seen corresponding path program 1 times [2019-09-10 06:22:41,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:41,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:41,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:42,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:42,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:42,557 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 3 states. [2019-09-10 06:22:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:42,879 INFO L93 Difference]: Finished difference Result 1193 states and 2110 transitions. [2019-09-10 06:22:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:42,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:22:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:42,933 INFO L225 Difference]: With dead ends: 1193 [2019-09-10 06:22:42,933 INFO L226 Difference]: Without dead ends: 1185 [2019-09-10 06:22:42,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-10 06:22:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1183. [2019-09-10 06:22:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-09-10 06:22:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1830 transitions. [2019-09-10 06:22:43,067 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1830 transitions. Word has length 314 [2019-09-10 06:22:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:43,070 INFO L475 AbstractCegarLoop]: Abstraction has 1183 states and 1830 transitions. [2019-09-10 06:22:43,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1830 transitions. [2019-09-10 06:22:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:22:43,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:43,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:43,086 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1585474574, now seen corresponding path program 1 times [2019-09-10 06:22:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:43,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:43,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:43,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:43,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:43,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:43,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:43,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:43,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:43,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:43,661 INFO L87 Difference]: Start difference. First operand 1183 states and 1830 transitions. Second operand 3 states. [2019-09-10 06:22:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:43,917 INFO L93 Difference]: Finished difference Result 2031 states and 3127 transitions. [2019-09-10 06:22:43,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:43,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:22:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:43,936 INFO L225 Difference]: With dead ends: 2031 [2019-09-10 06:22:43,936 INFO L226 Difference]: Without dead ends: 2031 [2019-09-10 06:22:43,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-09-10 06:22:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2029. [2019-09-10 06:22:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-09-10 06:22:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3126 transitions. [2019-09-10 06:22:44,035 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3126 transitions. Word has length 314 [2019-09-10 06:22:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:44,038 INFO L475 AbstractCegarLoop]: Abstraction has 2029 states and 3126 transitions. [2019-09-10 06:22:44,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3126 transitions. [2019-09-10 06:22:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:22:44,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:44,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:44,055 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -226150766, now seen corresponding path program 1 times [2019-09-10 06:22:44,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:44,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:44,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:44,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:44,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:45,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:45,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:45,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:45,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:45,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:45,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:45,004 INFO L87 Difference]: Start difference. First operand 2029 states and 3126 transitions. Second operand 4 states. [2019-09-10 06:22:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:45,180 INFO L93 Difference]: Finished difference Result 3979 states and 6093 transitions. [2019-09-10 06:22:45,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:45,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:22:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:45,209 INFO L225 Difference]: With dead ends: 3979 [2019-09-10 06:22:45,210 INFO L226 Difference]: Without dead ends: 3979 [2019-09-10 06:22:45,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2019-09-10 06:22:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3977. [2019-09-10 06:22:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3977 states. [2019-09-10 06:22:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 6092 transitions. [2019-09-10 06:22:45,338 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 6092 transitions. Word has length 314 [2019-09-10 06:22:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:45,338 INFO L475 AbstractCegarLoop]: Abstraction has 3977 states and 6092 transitions. [2019-09-10 06:22:45,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 6092 transitions. [2019-09-10 06:22:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:22:45,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:45,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:45,351 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1296301299, now seen corresponding path program 1 times [2019-09-10 06:22:45,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:45,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:45,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:45,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:45,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:45,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:45,535 INFO L87 Difference]: Start difference. First operand 3977 states and 6092 transitions. Second operand 3 states. [2019-09-10 06:22:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:45,645 INFO L93 Difference]: Finished difference Result 7934 states and 12149 transitions. [2019-09-10 06:22:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:45,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:22:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:45,692 INFO L225 Difference]: With dead ends: 7934 [2019-09-10 06:22:45,692 INFO L226 Difference]: Without dead ends: 7934 [2019-09-10 06:22:45,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7934 states. [2019-09-10 06:22:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7934 to 3990. [2019-09-10 06:22:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2019-09-10 06:22:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 6111 transitions. [2019-09-10 06:22:45,887 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 6111 transitions. Word has length 316 [2019-09-10 06:22:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:45,888 INFO L475 AbstractCegarLoop]: Abstraction has 3990 states and 6111 transitions. [2019-09-10 06:22:45,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 6111 transitions. [2019-09-10 06:22:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:22:45,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:45,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:45,940 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash -95746744, now seen corresponding path program 1 times [2019-09-10 06:22:45,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:45,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:45,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:46,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:46,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:46,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:46,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:46,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:46,178 INFO L87 Difference]: Start difference. First operand 3990 states and 6111 transitions. Second operand 3 states. [2019-09-10 06:22:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:46,309 INFO L93 Difference]: Finished difference Result 7827 states and 11920 transitions. [2019-09-10 06:22:46,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:46,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:22:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:46,346 INFO L225 Difference]: With dead ends: 7827 [2019-09-10 06:22:46,346 INFO L226 Difference]: Without dead ends: 7827 [2019-09-10 06:22:46,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2019-09-10 06:22:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7825. [2019-09-10 06:22:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7825 states. [2019-09-10 06:22:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7825 states to 7825 states and 11919 transitions. [2019-09-10 06:22:46,507 INFO L78 Accepts]: Start accepts. Automaton has 7825 states and 11919 transitions. Word has length 316 [2019-09-10 06:22:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:46,508 INFO L475 AbstractCegarLoop]: Abstraction has 7825 states and 11919 transitions. [2019-09-10 06:22:46,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 11919 transitions. [2019-09-10 06:22:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:22:46,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:46,525 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] [2019-09-10 06:22:46,525 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash -836740616, now seen corresponding path program 1 times [2019-09-10 06:22:46,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:46,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:46,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:46,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:46,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:46,696 INFO L87 Difference]: Start difference. First operand 7825 states and 11919 transitions. Second operand 3 states. [2019-09-10 06:22:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:46,784 INFO L93 Difference]: Finished difference Result 15597 states and 23743 transitions. [2019-09-10 06:22:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:46,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-10 06:22:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:46,823 INFO L225 Difference]: With dead ends: 15597 [2019-09-10 06:22:46,823 INFO L226 Difference]: Without dead ends: 15597 [2019-09-10 06:22:46,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15597 states. [2019-09-10 06:22:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15597 to 7843. [2019-09-10 06:22:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7843 states. [2019-09-10 06:22:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7843 states to 7843 states and 11940 transitions. [2019-09-10 06:22:47,089 INFO L78 Accepts]: Start accepts. Automaton has 7843 states and 11940 transitions. Word has length 317 [2019-09-10 06:22:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:47,089 INFO L475 AbstractCegarLoop]: Abstraction has 7843 states and 11940 transitions. [2019-09-10 06:22:47,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7843 states and 11940 transitions. [2019-09-10 06:22:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:22:47,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:47,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:47,116 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1256830877, now seen corresponding path program 1 times [2019-09-10 06:22:47,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:47,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:47,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:47,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:47,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:47,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:47,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:47,450 INFO L87 Difference]: Start difference. First operand 7843 states and 11940 transitions. Second operand 3 states. [2019-09-10 06:22:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:47,591 INFO L93 Difference]: Finished difference Result 15304 states and 23141 transitions. [2019-09-10 06:22:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:47,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 06:22:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:47,629 INFO L225 Difference]: With dead ends: 15304 [2019-09-10 06:22:47,630 INFO L226 Difference]: Without dead ends: 15304 [2019-09-10 06:22:47,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15304 states. [2019-09-10 06:22:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15304 to 15302. [2019-09-10 06:22:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15302 states. [2019-09-10 06:22:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 23140 transitions. [2019-09-10 06:22:48,010 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 23140 transitions. Word has length 318 [2019-09-10 06:22:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:48,011 INFO L475 AbstractCegarLoop]: Abstraction has 15302 states and 23140 transitions. [2019-09-10 06:22:48,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 23140 transitions. [2019-09-10 06:22:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:22:48,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:48,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:48,042 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1023571840, now seen corresponding path program 1 times [2019-09-10 06:22:48,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:48,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:48,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:48,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:48,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:48,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:48,387 INFO L87 Difference]: Start difference. First operand 15302 states and 23140 transitions. Second operand 4 states. [2019-09-10 06:22:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:48,533 INFO L93 Difference]: Finished difference Result 28483 states and 42948 transitions. [2019-09-10 06:22:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:48,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 06:22:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:48,591 INFO L225 Difference]: With dead ends: 28483 [2019-09-10 06:22:48,591 INFO L226 Difference]: Without dead ends: 28483 [2019-09-10 06:22:48,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28483 states. [2019-09-10 06:22:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28483 to 15537. [2019-09-10 06:22:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15537 states. [2019-09-10 06:22:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15537 states to 15537 states and 23528 transitions. [2019-09-10 06:22:48,952 INFO L78 Accepts]: Start accepts. Automaton has 15537 states and 23528 transitions. Word has length 318 [2019-09-10 06:22:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:48,953 INFO L475 AbstractCegarLoop]: Abstraction has 15537 states and 23528 transitions. [2019-09-10 06:22:48,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15537 states and 23528 transitions. [2019-09-10 06:22:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:22:48,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:48,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:48,983 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:48,984 INFO L82 PathProgramCache]: Analyzing trace with hash 89752151, now seen corresponding path program 1 times [2019-09-10 06:22:48,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:48,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:49,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:49,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:49,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:49,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:49,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:49,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:49,810 INFO L87 Difference]: Start difference. First operand 15537 states and 23528 transitions. Second operand 3 states. [2019-09-10 06:22:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:49,918 INFO L93 Difference]: Finished difference Result 30307 states and 45700 transitions. [2019-09-10 06:22:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:49,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 06:22:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:50,009 INFO L225 Difference]: With dead ends: 30307 [2019-09-10 06:22:50,010 INFO L226 Difference]: Without dead ends: 30307 [2019-09-10 06:22:50,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30307 states. [2019-09-10 06:22:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30307 to 15641. [2019-09-10 06:22:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15641 states. [2019-09-10 06:22:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15641 states to 15641 states and 23671 transitions. [2019-09-10 06:22:50,348 INFO L78 Accepts]: Start accepts. Automaton has 15641 states and 23671 transitions. Word has length 320 [2019-09-10 06:22:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:50,349 INFO L475 AbstractCegarLoop]: Abstraction has 15641 states and 23671 transitions. [2019-09-10 06:22:50,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15641 states and 23671 transitions. [2019-09-10 06:22:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 06:22:50,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:50,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:50,379 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2119611222, now seen corresponding path program 1 times [2019-09-10 06:22:50,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:50,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:50,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:50,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:50,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:50,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:50,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:50,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:50,524 INFO L87 Difference]: Start difference. First operand 15641 states and 23671 transitions. Second operand 3 states. [2019-09-10 06:22:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:50,643 INFO L93 Difference]: Finished difference Result 30432 states and 45846 transitions. [2019-09-10 06:22:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:50,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 06:22:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:50,735 INFO L225 Difference]: With dead ends: 30432 [2019-09-10 06:22:50,736 INFO L226 Difference]: Without dead ends: 30432 [2019-09-10 06:22:50,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30432 states. [2019-09-10 06:22:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30432 to 15766. [2019-09-10 06:22:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-09-10 06:22:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 23817 transitions. [2019-09-10 06:22:51,214 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 23817 transitions. Word has length 321 [2019-09-10 06:22:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:51,214 INFO L475 AbstractCegarLoop]: Abstraction has 15766 states and 23817 transitions. [2019-09-10 06:22:51,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 23817 transitions. [2019-09-10 06:22:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:22:51,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:51,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:51,243 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash -289045942, now seen corresponding path program 1 times [2019-09-10 06:22:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:51,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:51,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:51,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:51,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:51,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:51,619 INFO L87 Difference]: Start difference. First operand 15766 states and 23817 transitions. Second operand 4 states. [2019-09-10 06:22:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:51,702 INFO L93 Difference]: Finished difference Result 14691 states and 22224 transitions. [2019-09-10 06:22:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:51,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 06:22:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:51,763 INFO L225 Difference]: With dead ends: 14691 [2019-09-10 06:22:51,763 INFO L226 Difference]: Without dead ends: 13894 [2019-09-10 06:22:51,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-09-10 06:22:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 13874. [2019-09-10 06:22:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-09-10 06:22:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 20957 transitions. [2019-09-10 06:22:51,941 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 20957 transitions. Word has length 322 [2019-09-10 06:22:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:51,941 INFO L475 AbstractCegarLoop]: Abstraction has 13874 states and 20957 transitions. [2019-09-10 06:22:51,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 20957 transitions. [2019-09-10 06:22:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:51,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:51,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:51,960 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1431049473, now seen corresponding path program 1 times [2019-09-10 06:22:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:51,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:51,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:52,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:52,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:52,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:52,189 INFO L87 Difference]: Start difference. First operand 13874 states and 20957 transitions. Second operand 3 states. [2019-09-10 06:22:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:52,976 INFO L93 Difference]: Finished difference Result 25375 states and 37972 transitions. [2019-09-10 06:22:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:52,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 06:22:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:53,025 INFO L225 Difference]: With dead ends: 25375 [2019-09-10 06:22:53,028 INFO L226 Difference]: Without dead ends: 25375 [2019-09-10 06:22:53,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25375 states. [2019-09-10 06:22:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25375 to 25373. [2019-09-10 06:22:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25373 states. [2019-09-10 06:22:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25373 states to 25373 states and 37971 transitions. [2019-09-10 06:22:53,382 INFO L78 Accepts]: Start accepts. Automaton has 25373 states and 37971 transitions. Word has length 326 [2019-09-10 06:22:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:53,382 INFO L475 AbstractCegarLoop]: Abstraction has 25373 states and 37971 transitions. [2019-09-10 06:22:53,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25373 states and 37971 transitions. [2019-09-10 06:22:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:53,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:53,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:53,403 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:53,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:53,404 INFO L82 PathProgramCache]: Analyzing trace with hash 244300407, now seen corresponding path program 1 times [2019-09-10 06:22:53,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:53,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:53,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:53,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:53,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:53,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:22:53,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:53,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:22:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:22:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:53,740 INFO L87 Difference]: Start difference. First operand 25373 states and 37971 transitions. Second operand 5 states. [2019-09-10 06:22:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:54,221 INFO L93 Difference]: Finished difference Result 13874 states and 20723 transitions. [2019-09-10 06:22:54,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:22:54,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2019-09-10 06:22:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:54,248 INFO L225 Difference]: With dead ends: 13874 [2019-09-10 06:22:54,248 INFO L226 Difference]: Without dead ends: 13874 [2019-09-10 06:22:54,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:22:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13874 states. [2019-09-10 06:22:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13874 to 13874. [2019-09-10 06:22:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-09-10 06:22:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 20723 transitions. [2019-09-10 06:22:54,447 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 20723 transitions. Word has length 326 [2019-09-10 06:22:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:54,448 INFO L475 AbstractCegarLoop]: Abstraction has 13874 states and 20723 transitions. [2019-09-10 06:22:54,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 20723 transitions. [2019-09-10 06:22:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:54,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:54,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:54,467 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash -373051514, now seen corresponding path program 1 times [2019-09-10 06:22:54,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:54,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:54,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:55,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:55,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:55,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:55,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:55,125 INFO L87 Difference]: Start difference. First operand 13874 states and 20723 transitions. Second operand 4 states. [2019-09-10 06:22:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:55,397 INFO L93 Difference]: Finished difference Result 25406 states and 37830 transitions. [2019-09-10 06:22:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:55,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 06:22:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:55,437 INFO L225 Difference]: With dead ends: 25406 [2019-09-10 06:22:55,438 INFO L226 Difference]: Without dead ends: 25406 [2019-09-10 06:22:55,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25406 states. [2019-09-10 06:22:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25406 to 25404. [2019-09-10 06:22:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25404 states. [2019-09-10 06:22:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25404 states to 25404 states and 37829 transitions. [2019-09-10 06:22:55,797 INFO L78 Accepts]: Start accepts. Automaton has 25404 states and 37829 transitions. Word has length 326 [2019-09-10 06:22:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:55,798 INFO L475 AbstractCegarLoop]: Abstraction has 25404 states and 37829 transitions. [2019-09-10 06:22:55,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 25404 states and 37829 transitions. [2019-09-10 06:22:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:22:55,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:55,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:55,820 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1629663082, now seen corresponding path program 1 times [2019-09-10 06:22:55,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:55,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:55,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:56,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:56,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:56,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:56,448 INFO L87 Difference]: Start difference. First operand 25404 states and 37829 transitions. Second operand 4 states. [2019-09-10 06:22:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:56,696 INFO L93 Difference]: Finished difference Result 49602 states and 73458 transitions. [2019-09-10 06:22:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:56,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 06:22:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:56,788 INFO L225 Difference]: With dead ends: 49602 [2019-09-10 06:22:56,788 INFO L226 Difference]: Without dead ends: 49602 [2019-09-10 06:22:56,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49602 states. [2019-09-10 06:22:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49602 to 49600. [2019-09-10 06:22:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49600 states. [2019-09-10 06:22:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49600 states to 49600 states and 73457 transitions. [2019-09-10 06:22:57,751 INFO L78 Accepts]: Start accepts. Automaton has 49600 states and 73457 transitions. Word has length 326 [2019-09-10 06:22:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:57,751 INFO L475 AbstractCegarLoop]: Abstraction has 49600 states and 73457 transitions. [2019-09-10 06:22:57,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 49600 states and 73457 transitions. [2019-09-10 06:22:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:22:57,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:57,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:57,799 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 980797981, now seen corresponding path program 1 times [2019-09-10 06:22:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:57,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:57,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:58,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:58,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:58,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:58,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:58,064 INFO L87 Difference]: Start difference. First operand 49600 states and 73457 transitions. Second operand 3 states. [2019-09-10 06:22:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:58,435 INFO L93 Difference]: Finished difference Result 96837 states and 142255 transitions. [2019-09-10 06:22:58,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:58,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 06:22:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:58,596 INFO L225 Difference]: With dead ends: 96837 [2019-09-10 06:22:58,596 INFO L226 Difference]: Without dead ends: 96837 [2019-09-10 06:22:58,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96837 states. [2019-09-10 06:23:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96837 to 96835. [2019-09-10 06:23:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96835 states. [2019-09-10 06:23:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96835 states to 96835 states and 142254 transitions. [2019-09-10 06:23:01,004 INFO L78 Accepts]: Start accepts. Automaton has 96835 states and 142254 transitions. Word has length 328 [2019-09-10 06:23:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:01,005 INFO L475 AbstractCegarLoop]: Abstraction has 96835 states and 142254 transitions. [2019-09-10 06:23:01,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 96835 states and 142254 transitions. [2019-09-10 06:23:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 06:23:01,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:01,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:01,078 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:01,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:01,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1499003912, now seen corresponding path program 1 times [2019-09-10 06:23:01,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:01,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:01,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:01,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:01,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:01,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:01,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:01,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:01,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:01,312 INFO L87 Difference]: Start difference. First operand 96835 states and 142254 transitions. Second operand 3 states. [2019-09-10 06:23:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:01,962 INFO L93 Difference]: Finished difference Result 189684 states and 276508 transitions. [2019-09-10 06:23:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:01,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 06:23:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:02,236 INFO L225 Difference]: With dead ends: 189684 [2019-09-10 06:23:02,236 INFO L226 Difference]: Without dead ends: 189684 [2019-09-10 06:23:02,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189684 states. [2019-09-10 06:23:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189684 to 189682. [2019-09-10 06:23:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189682 states. [2019-09-10 06:23:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189682 states to 189682 states and 276507 transitions. [2019-09-10 06:23:07,118 INFO L78 Accepts]: Start accepts. Automaton has 189682 states and 276507 transitions. Word has length 330 [2019-09-10 06:23:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:07,118 INFO L475 AbstractCegarLoop]: Abstraction has 189682 states and 276507 transitions. [2019-09-10 06:23:07,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 189682 states and 276507 transitions. [2019-09-10 06:23:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 06:23:07,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:07,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:07,278 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash 307016405, now seen corresponding path program 1 times [2019-09-10 06:23:07,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:07,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:07,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:07,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:07,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:07,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:07,643 INFO L87 Difference]: Start difference. First operand 189682 states and 276507 transitions. Second operand 4 states. [2019-09-10 06:23:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:08,653 INFO L93 Difference]: Finished difference Result 319111 states and 463784 transitions. [2019-09-10 06:23:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:08,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-10 06:23:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:09,172 INFO L225 Difference]: With dead ends: 319111 [2019-09-10 06:23:09,172 INFO L226 Difference]: Without dead ends: 319111 [2019-09-10 06:23:09,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319111 states. [2019-09-10 06:23:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319111 to 183931. [2019-09-10 06:23:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183931 states. [2019-09-10 06:23:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183931 states to 183931 states and 268034 transitions. [2019-09-10 06:23:17,448 INFO L78 Accepts]: Start accepts. Automaton has 183931 states and 268034 transitions. Word has length 330 [2019-09-10 06:23:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:17,449 INFO L475 AbstractCegarLoop]: Abstraction has 183931 states and 268034 transitions. [2019-09-10 06:23:17,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 183931 states and 268034 transitions. [2019-09-10 06:23:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 06:23:17,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:17,591 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] [2019-09-10 06:23:17,592 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash -709613371, now seen corresponding path program 1 times [2019-09-10 06:23:17,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:17,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:17,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:18,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:18,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:18,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:18,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:18,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:18,474 INFO L87 Difference]: Start difference. First operand 183931 states and 268034 transitions. Second operand 3 states. [2019-09-10 06:23:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:19,129 INFO L93 Difference]: Finished difference Result 328031 states and 477082 transitions. [2019-09-10 06:23:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:19,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-10 06:23:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:19,481 INFO L225 Difference]: With dead ends: 328031 [2019-09-10 06:23:19,481 INFO L226 Difference]: Without dead ends: 328031 [2019-09-10 06:23:19,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328031 states. [2019-09-10 06:23:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328031 to 184412. [2019-09-10 06:23:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184412 states. [2019-09-10 06:23:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184412 states to 184412 states and 268632 transitions. [2019-09-10 06:23:26,858 INFO L78 Accepts]: Start accepts. Automaton has 184412 states and 268632 transitions. Word has length 333 [2019-09-10 06:23:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:26,858 INFO L475 AbstractCegarLoop]: Abstraction has 184412 states and 268632 transitions. [2019-09-10 06:23:26,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 184412 states and 268632 transitions. [2019-09-10 06:23:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 06:23:27,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:27,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:27,009 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:27,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash -338182756, now seen corresponding path program 1 times [2019-09-10 06:23:27,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:27,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:27,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:27,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:27,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:27,359 INFO L87 Difference]: Start difference. First operand 184412 states and 268632 transitions. Second operand 4 states. [2019-09-10 06:23:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:28,546 INFO L93 Difference]: Finished difference Result 169407 states and 246795 transitions. [2019-09-10 06:23:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:28,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-10 06:23:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:28,706 INFO L225 Difference]: With dead ends: 169407 [2019-09-10 06:23:28,706 INFO L226 Difference]: Without dead ends: 165239 [2019-09-10 06:23:28,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:23:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165239 states. [2019-09-10 06:23:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165239 to 164912. [2019-09-10 06:23:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164912 states. [2019-09-10 06:23:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164912 states to 164912 states and 239930 transitions. [2019-09-10 06:23:31,603 INFO L78 Accepts]: Start accepts. Automaton has 164912 states and 239930 transitions. Word has length 334 [2019-09-10 06:23:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:31,604 INFO L475 AbstractCegarLoop]: Abstraction has 164912 states and 239930 transitions. [2019-09-10 06:23:31,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 164912 states and 239930 transitions. [2019-09-10 06:23:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 06:23:31,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:31,702 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] [2019-09-10 06:23:31,703 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1093412469, now seen corresponding path program 1 times [2019-09-10 06:23:31,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:31,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:31,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:31,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:31,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:32,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:23:32,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:32,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:23:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:23:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:23:32,186 INFO L87 Difference]: Start difference. First operand 164912 states and 239930 transitions. Second operand 8 states. [2019-09-10 06:23:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:32,988 INFO L93 Difference]: Finished difference Result 314082 states and 456143 transitions. [2019-09-10 06:23:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:32,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 338 [2019-09-10 06:23:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:33,322 INFO L225 Difference]: With dead ends: 314082 [2019-09-10 06:23:33,322 INFO L226 Difference]: Without dead ends: 314082 [2019-09-10 06:23:33,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:23:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314082 states. [2019-09-10 06:23:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314082 to 314080. [2019-09-10 06:23:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314080 states. [2019-09-10 06:23:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314080 states to 314080 states and 456142 transitions. [2019-09-10 06:23:42,099 INFO L78 Accepts]: Start accepts. Automaton has 314080 states and 456142 transitions. Word has length 338 [2019-09-10 06:23:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:42,100 INFO L475 AbstractCegarLoop]: Abstraction has 314080 states and 456142 transitions. [2019-09-10 06:23:42,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:23:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 314080 states and 456142 transitions. [2019-09-10 06:23:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 06:23:42,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:42,360 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] [2019-09-10 06:23:42,360 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1015113787, now seen corresponding path program 1 times [2019-09-10 06:23:42,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:42,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:42,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:42,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:42,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:42,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:42,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:42,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:42,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:42,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:42,821 INFO L87 Difference]: Start difference. First operand 314080 states and 456142 transitions. Second operand 6 states. [2019-09-10 06:23:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:49,158 INFO L93 Difference]: Finished difference Result 487308 states and 737114 transitions. [2019-09-10 06:23:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:23:49,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 338 [2019-09-10 06:23:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:49,699 INFO L225 Difference]: With dead ends: 487308 [2019-09-10 06:23:49,699 INFO L226 Difference]: Without dead ends: 487308 [2019-09-10 06:23:49,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:23:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487308 states. [2019-09-10 06:23:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487308 to 348724. [2019-09-10 06:23:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348724 states. [2019-09-10 06:23:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348724 states to 348724 states and 511990 transitions. [2019-09-10 06:23:55,759 INFO L78 Accepts]: Start accepts. Automaton has 348724 states and 511990 transitions. Word has length 338 [2019-09-10 06:23:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:55,760 INFO L475 AbstractCegarLoop]: Abstraction has 348724 states and 511990 transitions. [2019-09-10 06:23:55,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 348724 states and 511990 transitions. [2019-09-10 06:23:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 06:23:55,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:55,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] [2019-09-10 06:23:55,997 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 772196443, now seen corresponding path program 1 times [2019-09-10 06:23:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:55,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:23:56,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:56,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:23:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:23:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:23:56,825 INFO L87 Difference]: Start difference. First operand 348724 states and 511990 transitions. Second operand 14 states. [2019-09-10 06:24:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:10,537 INFO L93 Difference]: Finished difference Result 847137 states and 1259631 transitions. [2019-09-10 06:24:10,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:24:10,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 338 [2019-09-10 06:24:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:11,570 INFO L225 Difference]: With dead ends: 847137 [2019-09-10 06:24:11,570 INFO L226 Difference]: Without dead ends: 847137 [2019-09-10 06:24:11,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:24:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847137 states. [2019-09-10 06:24:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847137 to 377576. [2019-09-10 06:24:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377576 states. [2019-09-10 06:24:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377576 states to 377576 states and 551066 transitions. [2019-09-10 06:24:23,797 INFO L78 Accepts]: Start accepts. Automaton has 377576 states and 551066 transitions. Word has length 338 [2019-09-10 06:24:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:23,797 INFO L475 AbstractCegarLoop]: Abstraction has 377576 states and 551066 transitions. [2019-09-10 06:24:23,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:24:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 377576 states and 551066 transitions. [2019-09-10 06:24:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 06:24:30,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:30,882 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] [2019-09-10 06:24:30,883 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 133289292, now seen corresponding path program 1 times [2019-09-10 06:24:30,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:30,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:31,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:31,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:24:31,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:31,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:24:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:24:31,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:24:31,666 INFO L87 Difference]: Start difference. First operand 377576 states and 551066 transitions. Second operand 16 states. [2019-09-10 06:24:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:38,317 INFO L93 Difference]: Finished difference Result 827408 states and 1231695 transitions. [2019-09-10 06:24:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:24:38,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 338 [2019-09-10 06:24:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:39,371 INFO L225 Difference]: With dead ends: 827408 [2019-09-10 06:24:39,371 INFO L226 Difference]: Without dead ends: 827408 [2019-09-10 06:24:39,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=448, Invalid=1274, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:24:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827408 states. [2019-09-10 06:24:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827408 to 454080. [2019-09-10 06:24:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454080 states. [2019-09-10 06:25:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454080 states to 454080 states and 654550 transitions. [2019-09-10 06:25:01,519 INFO L78 Accepts]: Start accepts. Automaton has 454080 states and 654550 transitions. Word has length 338 [2019-09-10 06:25:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:01,519 INFO L475 AbstractCegarLoop]: Abstraction has 454080 states and 654550 transitions. [2019-09-10 06:25:01,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:25:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 454080 states and 654550 transitions. [2019-09-10 06:25:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 06:25:01,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:01,865 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] [2019-09-10 06:25:01,865 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash -109628052, now seen corresponding path program 1 times [2019-09-10 06:25:01,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:02,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:02,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:02,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:02,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:02,431 INFO L87 Difference]: Start difference. First operand 454080 states and 654550 transitions. Second operand 4 states. [2019-09-10 06:25:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:10,727 INFO L93 Difference]: Finished difference Result 861298 states and 1232835 transitions. [2019-09-10 06:25:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:10,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-09-10 06:25:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:12,880 INFO L225 Difference]: With dead ends: 861298 [2019-09-10 06:25:12,881 INFO L226 Difference]: Without dead ends: 861298 [2019-09-10 06:25:12,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861298 states. [2019-09-10 06:25:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861298 to 861296. [2019-09-10 06:25:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861296 states. [2019-09-10 06:25:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861296 states to 861296 states and 1232834 transitions. [2019-09-10 06:25:42,761 INFO L78 Accepts]: Start accepts. Automaton has 861296 states and 1232834 transitions. Word has length 338 [2019-09-10 06:25:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:42,761 INFO L475 AbstractCegarLoop]: Abstraction has 861296 states and 1232834 transitions. [2019-09-10 06:25:42,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 861296 states and 1232834 transitions. [2019-09-10 06:25:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 06:25:43,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:43,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:43,408 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1623358564, now seen corresponding path program 1 times [2019-09-10 06:25:43,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:43,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:45,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:45,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:45,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:45,593 INFO L87 Difference]: Start difference. First operand 861296 states and 1232834 transitions. Second operand 3 states. [2019-09-10 06:26:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:03,608 INFO L93 Difference]: Finished difference Result 1685477 states and 2390924 transitions. [2019-09-10 06:26:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:03,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 06:26:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:05,835 INFO L225 Difference]: With dead ends: 1685477 [2019-09-10 06:26:05,835 INFO L226 Difference]: Without dead ends: 1685477 [2019-09-10 06:26:05,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685477 states. [2019-09-10 06:26:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685477 to 1685223. [2019-09-10 06:26:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685223 states.