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/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:04:36,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:04:36,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:04:36,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:04:36,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:04:36,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:04:36,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:04:36,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:04:36,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:04:36,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:04:36,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:04:36,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:04:36,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:04:36,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:04:36,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:04:36,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:04:36,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:04:36,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:04:36,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:04:36,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:04:36,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:04:36,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:04:36,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:04:36,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:04:36,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:04:36,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:04:36,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:04:36,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:04:36,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:04:36,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:04:36,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:04:36,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:04:36,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:04:36,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:04:36,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:04:36,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:04:36,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:04:36,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:04:36,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:04:36,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:04:36,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:04:36,120 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 04:04:36,134 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:04:36,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:04:36,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:04:36,135 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:04:36,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:04:36,136 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:04:36,136 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:04:36,136 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:04:36,137 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:04:36,137 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:04:36,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:04:36,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:04:36,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:04:36,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:04:36,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:04:36,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:04:36,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:04:36,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:04:36,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:04:36,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:04:36,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:04:36,140 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:04:36,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:04:36,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:04:36,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:04:36,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:04:36,141 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:04:36,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:04:36,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:04:36,142 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:04:36,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:04:36,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:04:36,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:04:36,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:04:36,199 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:04:36,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2019-09-10 04:04:36,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690fe5403/aa8d99153fc94351b8c8646e3c84cb6e/FLAG7e416287d [2019-09-10 04:04:36,852 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:04:36,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2019-09-10 04:04:36,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690fe5403/aa8d99153fc94351b8c8646e3c84cb6e/FLAG7e416287d [2019-09-10 04:04:37,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690fe5403/aa8d99153fc94351b8c8646e3c84cb6e [2019-09-10 04:04:37,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:04:37,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:04:37,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:04:37,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:04:37,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:04:37,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:37,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4556da18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37, skipping insertion in model container [2019-09-10 04:04:37,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:37,114 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:04:37,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:04:37,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:04:37,800 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:04:37,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:04:37,998 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:04:37,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37 WrapperNode [2019-09-10 04:04:37,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:04:38,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:04:38,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:04:38,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:04:38,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (1/1) ... [2019-09-10 04:04:38,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:04:38,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:04:38,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:04:38,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:04:38,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (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 04:04:38,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:04:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:04:38,269 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:04:38,269 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:04:38,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:04:38,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:04:38,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:04:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:04:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:04:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:04:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:04:38,270 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:04:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:04:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:04:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:04:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:04:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:04:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:04:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:04:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:04:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:04:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:04:40,688 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:04:40,689 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:04:40,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:04:40 BoogieIcfgContainer [2019-09-10 04:04:40,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:04:40,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:04:40,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:04:40,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:04:40,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:04:37" (1/3) ... [2019-09-10 04:04:40,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db7225b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:04:40, skipping insertion in model container [2019-09-10 04:04:40,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:37" (2/3) ... [2019-09-10 04:04:40,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db7225b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:04:40, skipping insertion in model container [2019-09-10 04:04:40,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:04:40" (3/3) ... [2019-09-10 04:04:40,699 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2019-09-10 04:04:40,708 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:04:40,719 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:04:40,736 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:04:40,772 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:04:40,772 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:04:40,772 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:04:40,772 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:04:40,772 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:04:40,772 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:04:40,773 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:04:40,773 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:04:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states. [2019-09-10 04:04:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 04:04:40,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:40,847 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] [2019-09-10 04:04:40,849 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1201379833, now seen corresponding path program 1 times [2019-09-10 04:04:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:40,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:04:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:41,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:41,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:41,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:41,603 INFO L87 Difference]: Start difference. First operand 732 states. Second operand 5 states. [2019-09-10 04:04:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:41,901 INFO L93 Difference]: Finished difference Result 736 states and 1329 transitions. [2019-09-10 04:04:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:41,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 04:04:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:41,949 INFO L225 Difference]: With dead ends: 736 [2019-09-10 04:04:41,950 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 04:04:41,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 04:04:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-10 04:04:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-10 04:04:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1261 transitions. [2019-09-10 04:04:42,090 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1261 transitions. Word has length 176 [2019-09-10 04:04:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:42,093 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1261 transitions. [2019-09-10 04:04:42,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1261 transitions. [2019-09-10 04:04:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 04:04:42,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:42,107 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] [2019-09-10 04:04:42,108 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1760990222, now seen corresponding path program 1 times [2019-09-10 04:04:42,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:42,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:42,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:42,488 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 04:04:42,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:42,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:42,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:42,498 INFO L87 Difference]: Start difference. First operand 727 states and 1261 transitions. Second operand 5 states. [2019-09-10 04:04:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:45,613 INFO L93 Difference]: Finished difference Result 901 states and 1537 transitions. [2019-09-10 04:04:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:45,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-09-10 04:04:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:45,621 INFO L225 Difference]: With dead ends: 901 [2019-09-10 04:04:45,622 INFO L226 Difference]: Without dead ends: 901 [2019-09-10 04:04:45,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-10 04:04:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 889. [2019-09-10 04:04:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-10 04:04:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1522 transitions. [2019-09-10 04:04:45,653 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1522 transitions. Word has length 235 [2019-09-10 04:04:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:45,654 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1522 transitions. [2019-09-10 04:04:45,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1522 transitions. [2019-09-10 04:04:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 04:04:45,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:45,660 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] [2019-09-10 04:04:45,661 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:45,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1455690326, now seen corresponding path program 1 times [2019-09-10 04:04:45,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:45,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:45,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:45,932 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 04:04:45,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:45,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:45,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:45,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:45,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:45,935 INFO L87 Difference]: Start difference. First operand 889 states and 1522 transitions. Second operand 5 states. [2019-09-10 04:04:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:48,796 INFO L93 Difference]: Finished difference Result 1214 states and 2040 transitions. [2019-09-10 04:04:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:04:48,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-09-10 04:04:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:48,807 INFO L225 Difference]: With dead ends: 1214 [2019-09-10 04:04:48,807 INFO L226 Difference]: Without dead ends: 1214 [2019-09-10 04:04:48,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-09-10 04:04:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1206. [2019-09-10 04:04:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-09-10 04:04:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2033 transitions. [2019-09-10 04:04:48,845 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2033 transitions. Word has length 239 [2019-09-10 04:04:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:48,846 INFO L475 AbstractCegarLoop]: Abstraction has 1206 states and 2033 transitions. [2019-09-10 04:04:48,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2033 transitions. [2019-09-10 04:04:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 04:04:48,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:48,851 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] [2019-09-10 04:04:48,852 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1913212166, now seen corresponding path program 1 times [2019-09-10 04:04:48,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:48,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:49,158 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 04:04:49,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:49,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:49,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:49,161 INFO L87 Difference]: Start difference. First operand 1206 states and 2033 transitions. Second operand 5 states. [2019-09-10 04:04:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:51,847 INFO L93 Difference]: Finished difference Result 1836 states and 3030 transitions. [2019-09-10 04:04:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:51,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2019-09-10 04:04:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:51,864 INFO L225 Difference]: With dead ends: 1836 [2019-09-10 04:04:51,864 INFO L226 Difference]: Without dead ends: 1836 [2019-09-10 04:04:51,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-09-10 04:04:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1822. [2019-09-10 04:04:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-09-10 04:04:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 3017 transitions. [2019-09-10 04:04:51,959 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 3017 transitions. Word has length 243 [2019-09-10 04:04:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:51,960 INFO L475 AbstractCegarLoop]: Abstraction has 1822 states and 3017 transitions. [2019-09-10 04:04:51,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3017 transitions. [2019-09-10 04:04:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 04:04:51,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:51,967 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] [2019-09-10 04:04:51,967 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:51,968 INFO L82 PathProgramCache]: Analyzing trace with hash 56946978, now seen corresponding path program 1 times [2019-09-10 04:04:51,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:51,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:52,172 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 04:04:52,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:52,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:52,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:52,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:52,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:52,175 INFO L87 Difference]: Start difference. First operand 1822 states and 3017 transitions. Second operand 5 states. [2019-09-10 04:04:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:55,054 INFO L93 Difference]: Finished difference Result 3044 states and 4934 transitions. [2019-09-10 04:04:55,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:04:55,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 247 [2019-09-10 04:04:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:55,072 INFO L225 Difference]: With dead ends: 3044 [2019-09-10 04:04:55,072 INFO L226 Difference]: Without dead ends: 3044 [2019-09-10 04:04:55,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2019-09-10 04:04:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3018. [2019-09-10 04:04:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-09-10 04:04:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4909 transitions. [2019-09-10 04:04:55,170 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4909 transitions. Word has length 247 [2019-09-10 04:04:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:55,171 INFO L475 AbstractCegarLoop]: Abstraction has 3018 states and 4909 transitions. [2019-09-10 04:04:55,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4909 transitions. [2019-09-10 04:04:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 04:04:55,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:55,179 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] [2019-09-10 04:04:55,179 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 19601918, now seen corresponding path program 1 times [2019-09-10 04:04:55,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:55,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:55,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:55,432 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 04:04:55,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:55,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:55,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:55,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:55,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:55,434 INFO L87 Difference]: Start difference. First operand 3018 states and 4909 transitions. Second operand 5 states. [2019-09-10 04:04:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:58,374 INFO L93 Difference]: Finished difference Result 5388 states and 8590 transitions. [2019-09-10 04:04:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:04:58,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-09-10 04:04:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:58,398 INFO L225 Difference]: With dead ends: 5388 [2019-09-10 04:04:58,399 INFO L226 Difference]: Without dead ends: 5388 [2019-09-10 04:04:58,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5388 states. [2019-09-10 04:04:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5388 to 5338. [2019-09-10 04:04:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5338 states. [2019-09-10 04:04:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 8541 transitions. [2019-09-10 04:04:58,548 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 8541 transitions. Word has length 251 [2019-09-10 04:04:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:58,548 INFO L475 AbstractCegarLoop]: Abstraction has 5338 states and 8541 transitions. [2019-09-10 04:04:58,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 8541 transitions. [2019-09-10 04:04:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 04:04:58,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:58,558 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] [2019-09-10 04:04:58,558 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1668081690, now seen corresponding path program 1 times [2019-09-10 04:04:58,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:58,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:59,106 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 04:04:59,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:59,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:04:59,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:59,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:04:59,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:04:59,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:04:59,108 INFO L87 Difference]: Start difference. First operand 5338 states and 8541 transitions. Second operand 13 states. [2019-09-10 04:05:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:11,857 INFO L93 Difference]: Finished difference Result 32705 states and 52930 transitions. [2019-09-10 04:05:11,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:05:11,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 255 [2019-09-10 04:05:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:12,057 INFO L225 Difference]: With dead ends: 32705 [2019-09-10 04:05:12,058 INFO L226 Difference]: Without dead ends: 32705 [2019-09-10 04:05:12,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:05:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32705 states. [2019-09-10 04:05:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32705 to 29395. [2019-09-10 04:05:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29395 states. [2019-09-10 04:05:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29395 states to 29395 states and 47423 transitions. [2019-09-10 04:05:12,926 INFO L78 Accepts]: Start accepts. Automaton has 29395 states and 47423 transitions. Word has length 255 [2019-09-10 04:05:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:12,927 INFO L475 AbstractCegarLoop]: Abstraction has 29395 states and 47423 transitions. [2019-09-10 04:05:12,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:05:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29395 states and 47423 transitions. [2019-09-10 04:05:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:05:12,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:12,953 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] [2019-09-10 04:05:12,954 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:12,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash -738368700, now seen corresponding path program 1 times [2019-09-10 04:05:12,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:12,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:12,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:13,322 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 04:05:13,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:13,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:13,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:13,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:13,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:13,325 INFO L87 Difference]: Start difference. First operand 29395 states and 47423 transitions. Second operand 6 states. [2019-09-10 04:05:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:19,019 INFO L93 Difference]: Finished difference Result 46075 states and 74357 transitions. [2019-09-10 04:05:19,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:05:19,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-10 04:05:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:19,234 INFO L225 Difference]: With dead ends: 46075 [2019-09-10 04:05:19,235 INFO L226 Difference]: Without dead ends: 46075 [2019-09-10 04:05:19,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:05:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46075 states. [2019-09-10 04:05:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46075 to 43369. [2019-09-10 04:05:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-09-10 04:05:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 70086 transitions. [2019-09-10 04:05:20,358 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 70086 transitions. Word has length 256 [2019-09-10 04:05:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:20,359 INFO L475 AbstractCegarLoop]: Abstraction has 43369 states and 70086 transitions. [2019-09-10 04:05:20,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 70086 transitions. [2019-09-10 04:05:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:05:20,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:20,388 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] [2019-09-10 04:05:20,389 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash -970166047, now seen corresponding path program 1 times [2019-09-10 04:05:20,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:20,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:20,900 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 04:05:20,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:20,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:05:20,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:20,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:05:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:05:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:05:20,903 INFO L87 Difference]: Start difference. First operand 43369 states and 70086 transitions. Second operand 13 states. [2019-09-10 04:05:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:36,828 INFO L93 Difference]: Finished difference Result 78548 states and 127743 transitions. [2019-09-10 04:05:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:05:36,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2019-09-10 04:05:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:37,099 INFO L225 Difference]: With dead ends: 78548 [2019-09-10 04:05:37,099 INFO L226 Difference]: Without dead ends: 78548 [2019-09-10 04:05:37,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:05:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78548 states. [2019-09-10 04:05:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78548 to 74850. [2019-09-10 04:05:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74850 states. [2019-09-10 04:05:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74850 states to 74850 states and 121297 transitions. [2019-09-10 04:05:39,839 INFO L78 Accepts]: Start accepts. Automaton has 74850 states and 121297 transitions. Word has length 256 [2019-09-10 04:05:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:39,840 INFO L475 AbstractCegarLoop]: Abstraction has 74850 states and 121297 transitions. [2019-09-10 04:05:39,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:05:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 74850 states and 121297 transitions. [2019-09-10 04:05:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:05:39,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:39,875 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] [2019-09-10 04:05:39,875 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1993892992, now seen corresponding path program 1 times [2019-09-10 04:05:39,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:39,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:40,359 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 04:05:40,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:40,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:05:40,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:40,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:05:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:05:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:05:40,365 INFO L87 Difference]: Start difference. First operand 74850 states and 121297 transitions. Second operand 13 states. [2019-09-10 04:05:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:58,615 INFO L93 Difference]: Finished difference Result 110155 states and 179744 transitions. [2019-09-10 04:05:58,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:05:58,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2019-09-10 04:05:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:59,418 INFO L225 Difference]: With dead ends: 110155 [2019-09-10 04:05:59,418 INFO L226 Difference]: Without dead ends: 110155 [2019-09-10 04:05:59,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1069, Invalid=4631, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:05:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110155 states. [2019-09-10 04:06:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110155 to 104503. [2019-09-10 04:06:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104503 states. [2019-09-10 04:06:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104503 states to 104503 states and 169631 transitions. [2019-09-10 04:06:04,169 INFO L78 Accepts]: Start accepts. Automaton has 104503 states and 169631 transitions. Word has length 256 [2019-09-10 04:06:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:04,170 INFO L475 AbstractCegarLoop]: Abstraction has 104503 states and 169631 transitions. [2019-09-10 04:06:04,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:06:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 104503 states and 169631 transitions. [2019-09-10 04:06:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:06:04,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:04,206 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] [2019-09-10 04:06:04,206 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1982808095, now seen corresponding path program 1 times [2019-09-10 04:06:04,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:04,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:04,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:04,454 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 04:06:04,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:04,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:04,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:04,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:04,456 INFO L87 Difference]: Start difference. First operand 104503 states and 169631 transitions. Second operand 6 states. [2019-09-10 04:06:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:07,755 INFO L93 Difference]: Finished difference Result 109881 states and 179613 transitions. [2019-09-10 04:06:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:06:07,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-10 04:06:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:08,323 INFO L225 Difference]: With dead ends: 109881 [2019-09-10 04:06:08,324 INFO L226 Difference]: Without dead ends: 109881 [2019-09-10 04:06:08,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:06:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109881 states. [2019-09-10 04:06:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109881 to 104761. [2019-09-10 04:06:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104761 states. [2019-09-10 04:06:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104761 states to 104761 states and 169639 transitions. [2019-09-10 04:06:10,591 INFO L78 Accepts]: Start accepts. Automaton has 104761 states and 169639 transitions. Word has length 256 [2019-09-10 04:06:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:10,592 INFO L475 AbstractCegarLoop]: Abstraction has 104761 states and 169639 transitions. [2019-09-10 04:06:10,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:06:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104761 states and 169639 transitions. [2019-09-10 04:06:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:06:10,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:10,620 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] [2019-09-10 04:06:10,620 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash 712895554, now seen corresponding path program 1 times [2019-09-10 04:06:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:10,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:10,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:11,115 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 04:06:11,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:11,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:06:11,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:11,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:06:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:06:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:06:11,117 INFO L87 Difference]: Start difference. First operand 104761 states and 169639 transitions. Second operand 13 states. [2019-09-10 04:06:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:29,599 INFO L93 Difference]: Finished difference Result 140737 states and 228681 transitions. [2019-09-10 04:06:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:06:29,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2019-09-10 04:06:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:29,952 INFO L225 Difference]: With dead ends: 140737 [2019-09-10 04:06:29,952 INFO L226 Difference]: Without dead ends: 140737 [2019-09-10 04:06:29,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:06:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140737 states. [2019-09-10 04:06:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140737 to 133795. [2019-09-10 04:06:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133795 states. [2019-09-10 04:06:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133795 states to 133795 states and 217009 transitions. [2019-09-10 04:06:32,276 INFO L78 Accepts]: Start accepts. Automaton has 133795 states and 217009 transitions. Word has length 256 [2019-09-10 04:06:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:32,277 INFO L475 AbstractCegarLoop]: Abstraction has 133795 states and 217009 transitions. [2019-09-10 04:06:32,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:06:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 133795 states and 217009 transitions. [2019-09-10 04:06:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:06:32,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:32,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:06:32,300 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1745613599, now seen corresponding path program 1 times [2019-09-10 04:06:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:32,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:32,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:32,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:32,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:06:32,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:32,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:32,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:32,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:32,553 INFO L87 Difference]: Start difference. First operand 133795 states and 217009 transitions. Second operand 6 states. [2019-09-10 04:06:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:36,524 INFO L93 Difference]: Finished difference Result 142538 states and 231515 transitions. [2019-09-10 04:06:36,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:06:36,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-10 04:06:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:36,916 INFO L225 Difference]: With dead ends: 142538 [2019-09-10 04:06:36,916 INFO L226 Difference]: Without dead ends: 142538 [2019-09-10 04:06:36,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:06:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142538 states. [2019-09-10 04:06:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142538 to 134327. [2019-09-10 04:06:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134327 states. [2019-09-10 04:06:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134327 states to 134327 states and 217419 transitions. [2019-09-10 04:06:43,061 INFO L78 Accepts]: Start accepts. Automaton has 134327 states and 217419 transitions. Word has length 256 [2019-09-10 04:06:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:43,061 INFO L475 AbstractCegarLoop]: Abstraction has 134327 states and 217419 transitions. [2019-09-10 04:06:43,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:06:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 134327 states and 217419 transitions. [2019-09-10 04:06:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 04:06:43,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:43,071 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] [2019-09-10 04:06:43,071 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1919395601, now seen corresponding path program 1 times [2019-09-10 04:06:43,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:43,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:43,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:43,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:43,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:43,342 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 04:06:43,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:43,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:43,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:43,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:43,345 INFO L87 Difference]: Start difference. First operand 134327 states and 217419 transitions. Second operand 6 states. [2019-09-10 04:06:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:48,148 INFO L93 Difference]: Finished difference Result 229800 states and 372094 transitions. [2019-09-10 04:06:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:06:48,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 04:06:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:48,715 INFO L225 Difference]: With dead ends: 229800 [2019-09-10 04:06:48,715 INFO L226 Difference]: Without dead ends: 229800 [2019-09-10 04:06:48,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:06:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229800 states. [2019-09-10 04:06:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229800 to 228985. [2019-09-10 04:06:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228985 states. [2019-09-10 04:06:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228985 states to 228985 states and 370981 transitions. [2019-09-10 04:06:57,541 INFO L78 Accepts]: Start accepts. Automaton has 228985 states and 370981 transitions. Word has length 257 [2019-09-10 04:06:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:57,542 INFO L475 AbstractCegarLoop]: Abstraction has 228985 states and 370981 transitions. [2019-09-10 04:06:57,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:06:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 228985 states and 370981 transitions. [2019-09-10 04:06:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 04:06:57,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:57,551 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] [2019-09-10 04:06:57,551 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash 540049723, now seen corresponding path program 1 times [2019-09-10 04:06:57,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:57,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:57,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:57,999 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 04:06:58,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:58,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:58,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:58,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:58,001 INFO L87 Difference]: Start difference. First operand 228985 states and 370981 transitions. Second operand 6 states. [2019-09-10 04:07:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:01,996 INFO L93 Difference]: Finished difference Result 240516 states and 389049 transitions. [2019-09-10 04:07:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 04:07:01,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 04:07:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:02,774 INFO L225 Difference]: With dead ends: 240516 [2019-09-10 04:07:02,774 INFO L226 Difference]: Without dead ends: 240516 [2019-09-10 04:07:02,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:07:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240516 states. [2019-09-10 04:07:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240516 to 229362. [2019-09-10 04:07:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229362 states. [2019-09-10 04:07:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229362 states to 229362 states and 370981 transitions. [2019-09-10 04:07:11,929 INFO L78 Accepts]: Start accepts. Automaton has 229362 states and 370981 transitions. Word has length 257 [2019-09-10 04:07:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:11,930 INFO L475 AbstractCegarLoop]: Abstraction has 229362 states and 370981 transitions. [2019-09-10 04:07:11,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:07:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 229362 states and 370981 transitions. [2019-09-10 04:07:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 04:07:11,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:11,936 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] [2019-09-10 04:07:11,936 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:11,937 INFO L82 PathProgramCache]: Analyzing trace with hash -516165191, now seen corresponding path program 1 times [2019-09-10 04:07:11,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:11,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:11,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:12,282 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 04:07:12,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:12,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:07:12,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:12,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:07:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:07:12,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:07:12,286 INFO L87 Difference]: Start difference. First operand 229362 states and 370981 transitions. Second operand 6 states. [2019-09-10 04:07:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:17,031 INFO L93 Difference]: Finished difference Result 249024 states and 415211 transitions. [2019-09-10 04:07:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:07:17,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 04:07:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:17,891 INFO L225 Difference]: With dead ends: 249024 [2019-09-10 04:07:17,892 INFO L226 Difference]: Without dead ends: 249024 [2019-09-10 04:07:17,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:07:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249024 states. [2019-09-10 04:07:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249024 to 231742. [2019-09-10 04:07:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231742 states. [2019-09-10 04:07:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231742 states to 231742 states and 374789 transitions. [2019-09-10 04:07:26,389 INFO L78 Accepts]: Start accepts. Automaton has 231742 states and 374789 transitions. Word has length 257 [2019-09-10 04:07:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:26,389 INFO L475 AbstractCegarLoop]: Abstraction has 231742 states and 374789 transitions. [2019-09-10 04:07:26,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:07:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 231742 states and 374789 transitions. [2019-09-10 04:07:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 04:07:26,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:26,393 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] [2019-09-10 04:07:26,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1640941925, now seen corresponding path program 1 times [2019-09-10 04:07:26,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:26,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:26,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:26,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:26,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:26,695 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 04:07:26,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:26,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:07:26,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:26,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:07:26,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:07:26,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:07:26,698 INFO L87 Difference]: Start difference. First operand 231742 states and 374789 transitions. Second operand 6 states. [2019-09-10 04:07:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:33,904 INFO L93 Difference]: Finished difference Result 509117 states and 824968 transitions. [2019-09-10 04:07:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:07:33,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-10 04:07:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:35,477 INFO L225 Difference]: With dead ends: 509117 [2019-09-10 04:07:35,477 INFO L226 Difference]: Without dead ends: 509117 [2019-09-10 04:07:35,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:07:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509117 states. [2019-09-10 04:07:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509117 to 418520. [2019-09-10 04:07:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418520 states. [2019-09-10 04:07:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418520 states to 418520 states and 678047 transitions. [2019-09-10 04:07:48,731 INFO L78 Accepts]: Start accepts. Automaton has 418520 states and 678047 transitions. Word has length 258 [2019-09-10 04:07:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:48,732 INFO L475 AbstractCegarLoop]: Abstraction has 418520 states and 678047 transitions. [2019-09-10 04:07:48,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:07:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 418520 states and 678047 transitions. [2019-09-10 04:07:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 04:07:48,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:48,736 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] [2019-09-10 04:07:48,737 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -393940472, now seen corresponding path program 1 times [2019-09-10 04:07:48,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:48,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:48,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:48,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:48,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:48,950 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 04:07:48,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:48,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:07:48,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:48,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:07:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:07:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:07:48,952 INFO L87 Difference]: Start difference. First operand 418520 states and 678047 transitions. Second operand 6 states. [2019-09-10 04:07:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:58,042 INFO L93 Difference]: Finished difference Result 832621 states and 1347485 transitions. [2019-09-10 04:07:58,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:07:58,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-10 04:07:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:09,905 INFO L225 Difference]: With dead ends: 832621 [2019-09-10 04:08:09,905 INFO L226 Difference]: Without dead ends: 832621 [2019-09-10 04:08:09,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:08:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832621 states. [2019-09-10 04:08:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832621 to 828021. [2019-09-10 04:08:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828021 states. [2019-09-10 04:08:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828021 states to 828021 states and 1341017 transitions. [2019-09-10 04:08:34,468 INFO L78 Accepts]: Start accepts. Automaton has 828021 states and 1341017 transitions. Word has length 259 [2019-09-10 04:08:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:34,468 INFO L475 AbstractCegarLoop]: Abstraction has 828021 states and 1341017 transitions. [2019-09-10 04:08:34,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 828021 states and 1341017 transitions. [2019-09-10 04:08:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 04:08:34,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:34,473 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] [2019-09-10 04:08:34,473 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash -443286030, now seen corresponding path program 1 times [2019-09-10 04:08:34,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:34,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:34,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:34,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:34,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:34,696 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 04:08:34,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:34,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:34,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:34,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:34,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:34,698 INFO L87 Difference]: Start difference. First operand 828021 states and 1341017 transitions. Second operand 6 states. [2019-09-10 04:09:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:02,210 INFO L93 Difference]: Finished difference Result 1455893 states and 2359780 transitions. [2019-09-10 04:09:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:09:02,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-09-10 04:09:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:07,273 INFO L225 Difference]: With dead ends: 1455893 [2019-09-10 04:09:07,273 INFO L226 Difference]: Without dead ends: 1455893 [2019-09-10 04:09:07,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:09:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455893 states. [2019-09-10 04:10:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455893 to 1450615. [2019-09-10 04:10:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450615 states. [2019-09-10 04:10:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450615 states to 1450615 states and 2351953 transitions. [2019-09-10 04:10:07,278 INFO L78 Accepts]: Start accepts. Automaton has 1450615 states and 2351953 transitions. Word has length 260 [2019-09-10 04:10:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:07,278 INFO L475 AbstractCegarLoop]: Abstraction has 1450615 states and 2351953 transitions. [2019-09-10 04:10:07,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:10:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1450615 states and 2351953 transitions. [2019-09-10 04:10:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 04:10:07,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:07,282 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] [2019-09-10 04:10:07,283 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash -924984949, now seen corresponding path program 1 times [2019-09-10 04:10:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:07,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:07,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:20,055 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 04:10:20,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:10:20,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 04:10:20,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:20,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:10:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:10:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 04:10:20,058 INFO L87 Difference]: Start difference. First operand 1450615 states and 2351953 transitions. Second operand 14 states. [2019-09-10 04:11:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:32,588 INFO L93 Difference]: Finished difference Result 3230644 states and 5397709 transitions. [2019-09-10 04:11:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 04:11:32,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-09-10 04:11:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted.