java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:29:52,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:29:52,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:29:52,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:29:52,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:29:52,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:29:52,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:29:52,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:29:52,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:29:52,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:29:52,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:29:52,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:29:52,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:29:52,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:29:52,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:29:52,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:29:52,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:29:52,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:29:52,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:29:52,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:29:52,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:29:52,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:29:52,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:29:52,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:29:52,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:29:52,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:29:52,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:29:52,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:29:52,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:29:52,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:29:52,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:29:52,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:29:52,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:29:52,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:29:52,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:29:52,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:29:52,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:29:52,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:29:52,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:29:52,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:29:52,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:29:52,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:29:52,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:29:52,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:29:52,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:29:52,159 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:29:52,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:29:52,160 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:29:52,160 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:29:52,160 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:29:52,161 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:29:52,161 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:29:52,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:29:52,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:29:52,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:29:52,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:29:52,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:29:52,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:29:52,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:29:52,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:29:52,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:29:52,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:29:52,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:29:52,165 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:29:52,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:29:52,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:29:52,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:29:52,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:29:52,166 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:29:52,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:29:52,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:29:52,167 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:29:52,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:29:52,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:29:52,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:29:52,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:29:52,231 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:29:52,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:29:52,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92bdb8cf/5aaba1820cc24ab0865d1dacb8eb8659/FLAGb3c854bc9 [2019-09-10 06:29:52,943 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:29:52,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:29:52,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92bdb8cf/5aaba1820cc24ab0865d1dacb8eb8659/FLAGb3c854bc9 [2019-09-10 06:29:53,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92bdb8cf/5aaba1820cc24ab0865d1dacb8eb8659 [2019-09-10 06:29:53,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:29:53,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:29:53,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:53,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:29:53,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:29:53,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:53" (1/1) ... [2019-09-10 06:29:53,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70685667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:53, skipping insertion in model container [2019-09-10 06:29:53,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:53" (1/1) ... [2019-09-10 06:29:53,143 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:29:53,311 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:29:54,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:54,977 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:29:56,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:56,158 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:29:56,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56 WrapperNode [2019-09-10 06:29:56,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:56,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:29:56,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:29:56,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:29:56,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... [2019-09-10 06:29:56,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:29:56,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:29:56,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:29:56,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:29:56,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:29:56,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:29:56,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:29:56,466 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:29:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:29:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:29:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:29:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:29:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:29:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:29:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:29:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:29:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:29:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:29:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:29:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:29:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:29:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:29:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:29:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:29:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:30:00,892 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:30:00,892 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:30:00,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:30:00 BoogieIcfgContainer [2019-09-10 06:30:00,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:30:00,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:30:00,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:30:00,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:30:00,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:29:53" (1/3) ... [2019-09-10 06:30:00,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1696e2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:30:00, skipping insertion in model container [2019-09-10 06:30:00,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:56" (2/3) ... [2019-09-10 06:30:00,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1696e2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:30:00, skipping insertion in model container [2019-09-10 06:30:00,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:30:00" (3/3) ... [2019-09-10 06:30:00,903 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:30:00,912 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:30:00,921 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:30:00,939 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:30:00,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:30:00,967 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:30:00,967 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:30:00,967 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:30:00,967 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:30:00,967 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:30:00,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:30:00,967 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:30:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states. [2019-09-10 06:30:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-10 06:30:01,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:01,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:01,061 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash 860174320, now seen corresponding path program 1 times [2019-09-10 06:30:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:01,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:01,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:02,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:02,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:02,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:02,326 INFO L87 Difference]: Start difference. First operand 1322 states. Second operand 3 states. [2019-09-10 06:30:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:02,779 INFO L93 Difference]: Finished difference Result 1964 states and 3509 transitions. [2019-09-10 06:30:02,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:02,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-09-10 06:30:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:02,887 INFO L225 Difference]: With dead ends: 1964 [2019-09-10 06:30:02,887 INFO L226 Difference]: Without dead ends: 1956 [2019-09-10 06:30:02,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-09-10 06:30:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1954. [2019-09-10 06:30:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-10 06:30:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 3183 transitions. [2019-09-10 06:30:03,047 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 3183 transitions. Word has length 467 [2019-09-10 06:30:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:03,051 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 3183 transitions. [2019-09-10 06:30:03,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 3183 transitions. [2019-09-10 06:30:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-10 06:30:03,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:03,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:03,070 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash -176279345, now seen corresponding path program 1 times [2019-09-10 06:30:03,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:03,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:03,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:05,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:05,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:05,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:05,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:05,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:05,187 INFO L87 Difference]: Start difference. First operand 1954 states and 3183 transitions. Second operand 4 states. [2019-09-10 06:30:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:05,438 INFO L93 Difference]: Finished difference Result 3856 states and 6255 transitions. [2019-09-10 06:30:05,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:05,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2019-09-10 06:30:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:05,462 INFO L225 Difference]: With dead ends: 3856 [2019-09-10 06:30:05,463 INFO L226 Difference]: Without dead ends: 3856 [2019-09-10 06:30:05,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:30:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2019-09-10 06:30:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3854. [2019-09-10 06:30:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3854 states. [2019-09-10 06:30:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 6254 transitions. [2019-09-10 06:30:05,551 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 6254 transitions. Word has length 467 [2019-09-10 06:30:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:05,551 INFO L475 AbstractCegarLoop]: Abstraction has 3854 states and 6254 transitions. [2019-09-10 06:30:05,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 6254 transitions. [2019-09-10 06:30:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-10 06:30:05,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:05,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:05,569 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1050032589, now seen corresponding path program 1 times [2019-09-10 06:30:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:05,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:05,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:06,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:06,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:06,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:06,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:06,330 INFO L87 Difference]: Start difference. First operand 3854 states and 6254 transitions. Second operand 3 states. [2019-09-10 06:30:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:06,607 INFO L93 Difference]: Finished difference Result 7620 states and 12322 transitions. [2019-09-10 06:30:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:06,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-09-10 06:30:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:06,656 INFO L225 Difference]: With dead ends: 7620 [2019-09-10 06:30:06,656 INFO L226 Difference]: Without dead ends: 7620 [2019-09-10 06:30:06,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-09-10 06:30:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7618. [2019-09-10 06:30:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7618 states. [2019-09-10 06:30:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7618 states to 7618 states and 12321 transitions. [2019-09-10 06:30:06,953 INFO L78 Accepts]: Start accepts. Automaton has 7618 states and 12321 transitions. Word has length 469 [2019-09-10 06:30:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:06,954 INFO L475 AbstractCegarLoop]: Abstraction has 7618 states and 12321 transitions. [2019-09-10 06:30:06,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 7618 states and 12321 transitions. [2019-09-10 06:30:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-10 06:30:06,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:06,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:06,981 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1709212756, now seen corresponding path program 1 times [2019-09-10 06:30:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:06,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:07,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:07,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:07,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:07,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:07,258 INFO L87 Difference]: Start difference. First operand 7618 states and 12321 transitions. Second operand 3 states. [2019-09-10 06:30:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:07,390 INFO L93 Difference]: Finished difference Result 15191 states and 24554 transitions. [2019-09-10 06:30:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:07,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-09-10 06:30:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:07,455 INFO L225 Difference]: With dead ends: 15191 [2019-09-10 06:30:07,456 INFO L226 Difference]: Without dead ends: 15191 [2019-09-10 06:30:07,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15191 states. [2019-09-10 06:30:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15191 to 7665. [2019-09-10 06:30:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7665 states. [2019-09-10 06:30:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 12395 transitions. [2019-09-10 06:30:07,751 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 12395 transitions. Word has length 470 [2019-09-10 06:30:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:07,752 INFO L475 AbstractCegarLoop]: Abstraction has 7665 states and 12395 transitions. [2019-09-10 06:30:07,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 12395 transitions. [2019-09-10 06:30:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-10 06:30:07,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:07,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:07,784 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 867417848, now seen corresponding path program 1 times [2019-09-10 06:30:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:07,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:07,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:08,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:08,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:08,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:08,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:08,396 INFO L87 Difference]: Start difference. First operand 7665 states and 12395 transitions. Second operand 3 states. [2019-09-10 06:30:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:08,765 INFO L93 Difference]: Finished difference Result 15006 states and 24146 transitions. [2019-09-10 06:30:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:08,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2019-09-10 06:30:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:08,812 INFO L225 Difference]: With dead ends: 15006 [2019-09-10 06:30:08,812 INFO L226 Difference]: Without dead ends: 15006 [2019-09-10 06:30:08,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15006 states. [2019-09-10 06:30:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15006 to 15004. [2019-09-10 06:30:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15004 states. [2019-09-10 06:30:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15004 states to 15004 states and 24145 transitions. [2019-09-10 06:30:09,278 INFO L78 Accepts]: Start accepts. Automaton has 15004 states and 24145 transitions. Word has length 471 [2019-09-10 06:30:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:09,279 INFO L475 AbstractCegarLoop]: Abstraction has 15004 states and 24145 transitions. [2019-09-10 06:30:09,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 15004 states and 24145 transitions. [2019-09-10 06:30:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-10 06:30:09,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:09,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:09,318 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash -563238701, now seen corresponding path program 1 times [2019-09-10 06:30:09,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:09,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:09,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:09,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:09,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:09,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:09,571 INFO L87 Difference]: Start difference. First operand 15004 states and 24145 transitions. Second operand 3 states. [2019-09-10 06:30:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:09,727 INFO L93 Difference]: Finished difference Result 29896 states and 48080 transitions. [2019-09-10 06:30:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:09,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2019-09-10 06:30:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:09,791 INFO L225 Difference]: With dead ends: 29896 [2019-09-10 06:30:09,791 INFO L226 Difference]: Without dead ends: 29896 [2019-09-10 06:30:09,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29896 states. [2019-09-10 06:30:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29896 to 15102. [2019-09-10 06:30:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15102 states. [2019-09-10 06:30:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15102 states to 15102 states and 24296 transitions. [2019-09-10 06:30:10,187 INFO L78 Accepts]: Start accepts. Automaton has 15102 states and 24296 transitions. Word has length 471 [2019-09-10 06:30:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:10,188 INFO L475 AbstractCegarLoop]: Abstraction has 15102 states and 24296 transitions. [2019-09-10 06:30:10,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15102 states and 24296 transitions. [2019-09-10 06:30:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-10 06:30:10,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:10,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:10,230 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash 692520227, now seen corresponding path program 1 times [2019-09-10 06:30:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:10,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:11,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:11,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:11,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:11,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:11,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:11,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:11,192 INFO L87 Difference]: Start difference. First operand 15102 states and 24296 transitions. Second operand 3 states. [2019-09-10 06:30:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:11,337 INFO L93 Difference]: Finished difference Result 30013 states and 48226 transitions. [2019-09-10 06:30:11,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:11,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 472 [2019-09-10 06:30:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:11,405 INFO L225 Difference]: With dead ends: 30013 [2019-09-10 06:30:11,405 INFO L226 Difference]: Without dead ends: 30013 [2019-09-10 06:30:11,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-09-10 06:30:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 15219. [2019-09-10 06:30:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15219 states. [2019-09-10 06:30:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15219 states to 15219 states and 24442 transitions. [2019-09-10 06:30:11,811 INFO L78 Accepts]: Start accepts. Automaton has 15219 states and 24442 transitions. Word has length 472 [2019-09-10 06:30:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:11,812 INFO L475 AbstractCegarLoop]: Abstraction has 15219 states and 24442 transitions. [2019-09-10 06:30:11,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 15219 states and 24442 transitions. [2019-09-10 06:30:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-10 06:30:11,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:11,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:11,842 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:11,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1994724451, now seen corresponding path program 1 times [2019-09-10 06:30:11,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:11,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:11,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:11,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:11,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:12,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:12,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:12,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:12,418 INFO L87 Difference]: Start difference. First operand 15219 states and 24442 transitions. Second operand 3 states. [2019-09-10 06:30:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:12,634 INFO L93 Difference]: Finished difference Result 29596 states and 47308 transitions. [2019-09-10 06:30:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:12,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-09-10 06:30:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:12,728 INFO L225 Difference]: With dead ends: 29596 [2019-09-10 06:30:12,729 INFO L226 Difference]: Without dead ends: 29596 [2019-09-10 06:30:12,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29596 states. [2019-09-10 06:30:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29596 to 29594. [2019-09-10 06:30:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29594 states. [2019-09-10 06:30:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29594 states to 29594 states and 47307 transitions. [2019-09-10 06:30:13,236 INFO L78 Accepts]: Start accepts. Automaton has 29594 states and 47307 transitions. Word has length 473 [2019-09-10 06:30:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:13,237 INFO L475 AbstractCegarLoop]: Abstraction has 29594 states and 47307 transitions. [2019-09-10 06:30:13,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29594 states and 47307 transitions. [2019-09-10 06:30:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-10 06:30:13,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:13,283 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash -57354464, now seen corresponding path program 1 times [2019-09-10 06:30:13,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:13,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:13,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:13,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:14,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:14,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:14,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:14,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:14,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:14,262 INFO L87 Difference]: Start difference. First operand 29594 states and 47307 transitions. Second operand 4 states. [2019-09-10 06:30:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:14,530 INFO L93 Difference]: Finished difference Result 56266 states and 89690 transitions. [2019-09-10 06:30:14,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:14,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2019-09-10 06:30:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:14,598 INFO L225 Difference]: With dead ends: 56266 [2019-09-10 06:30:14,599 INFO L226 Difference]: Without dead ends: 56266 [2019-09-10 06:30:14,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:30:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56266 states. [2019-09-10 06:30:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56266 to 30887. [2019-09-10 06:30:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30887 states. [2019-09-10 06:30:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30887 states to 30887 states and 49586 transitions. [2019-09-10 06:30:15,277 INFO L78 Accepts]: Start accepts. Automaton has 30887 states and 49586 transitions. Word has length 473 [2019-09-10 06:30:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:15,278 INFO L475 AbstractCegarLoop]: Abstraction has 30887 states and 49586 transitions. [2019-09-10 06:30:15,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30887 states and 49586 transitions. [2019-09-10 06:30:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:30:15,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:15,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:15,310 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1679281834, now seen corresponding path program 1 times [2019-09-10 06:30:15,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:15,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:15,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:16,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:16,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:16,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:16,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:16,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:16,298 INFO L87 Difference]: Start difference. First operand 30887 states and 49586 transitions. Second operand 3 states. [2019-09-10 06:30:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:16,541 INFO L93 Difference]: Finished difference Result 58296 states and 92894 transitions. [2019-09-10 06:30:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:16,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-10 06:30:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:16,608 INFO L225 Difference]: With dead ends: 58296 [2019-09-10 06:30:16,609 INFO L226 Difference]: Without dead ends: 58296 [2019-09-10 06:30:16,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58296 states. [2019-09-10 06:30:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58296 to 31334. [2019-09-10 06:30:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31334 states. [2019-09-10 06:30:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31334 states to 31334 states and 50261 transitions. [2019-09-10 06:30:17,193 INFO L78 Accepts]: Start accepts. Automaton has 31334 states and 50261 transitions. Word has length 476 [2019-09-10 06:30:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:17,194 INFO L475 AbstractCegarLoop]: Abstraction has 31334 states and 50261 transitions. [2019-09-10 06:30:17,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 31334 states and 50261 transitions. [2019-09-10 06:30:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-10 06:30:17,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:17,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:17,226 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744572, now seen corresponding path program 1 times [2019-09-10 06:30:17,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:17,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:17,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:17,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:17,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:17,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:17,616 INFO L87 Difference]: Start difference. First operand 31334 states and 50261 transitions. Second operand 3 states. [2019-09-10 06:30:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:17,792 INFO L93 Difference]: Finished difference Result 58911 states and 93770 transitions. [2019-09-10 06:30:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:17,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 477 [2019-09-10 06:30:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:17,848 INFO L225 Difference]: With dead ends: 58911 [2019-09-10 06:30:17,848 INFO L226 Difference]: Without dead ends: 58911 [2019-09-10 06:30:17,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58911 states. [2019-09-10 06:30:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58911 to 31981. [2019-09-10 06:30:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31981 states. [2019-09-10 06:30:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31981 states to 31981 states and 51201 transitions. [2019-09-10 06:30:18,348 INFO L78 Accepts]: Start accepts. Automaton has 31981 states and 51201 transitions. Word has length 477 [2019-09-10 06:30:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:18,349 INFO L475 AbstractCegarLoop]: Abstraction has 31981 states and 51201 transitions. [2019-09-10 06:30:18,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 31981 states and 51201 transitions. [2019-09-10 06:30:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-10 06:30:18,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:18,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:18,379 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash -428994466, now seen corresponding path program 1 times [2019-09-10 06:30:18,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:18,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:18,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:18,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:18,645 INFO L87 Difference]: Start difference. First operand 31981 states and 51201 transitions. Second operand 3 states. [2019-09-10 06:30:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:18,824 INFO L93 Difference]: Finished difference Result 59765 states and 94832 transitions. [2019-09-10 06:30:18,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:18,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-10 06:30:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:18,887 INFO L225 Difference]: With dead ends: 59765 [2019-09-10 06:30:18,887 INFO L226 Difference]: Without dead ends: 59765 [2019-09-10 06:30:18,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59765 states. [2019-09-10 06:30:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59765 to 32835. [2019-09-10 06:30:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32835 states. [2019-09-10 06:30:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32835 states to 32835 states and 52263 transitions. [2019-09-10 06:30:19,443 INFO L78 Accepts]: Start accepts. Automaton has 32835 states and 52263 transitions. Word has length 478 [2019-09-10 06:30:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:19,443 INFO L475 AbstractCegarLoop]: Abstraction has 32835 states and 52263 transitions. [2019-09-10 06:30:19,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32835 states and 52263 transitions. [2019-09-10 06:30:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-10 06:30:19,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:19,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:19,475 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 275233195, now seen corresponding path program 1 times [2019-09-10 06:30:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:19,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:19,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:20,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:20,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:30:20,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:20,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:30:20,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:30:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:30:20,164 INFO L87 Difference]: Start difference. First operand 32835 states and 52263 transitions. Second operand 5 states. [2019-09-10 06:30:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:21,513 INFO L93 Difference]: Finished difference Result 32837 states and 52040 transitions. [2019-09-10 06:30:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:30:21,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 479 [2019-09-10 06:30:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:21,544 INFO L225 Difference]: With dead ends: 32837 [2019-09-10 06:30:21,544 INFO L226 Difference]: Without dead ends: 32837 [2019-09-10 06:30:21,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:30:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32837 states. [2019-09-10 06:30:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32837 to 32835. [2019-09-10 06:30:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32835 states. [2019-09-10 06:30:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32835 states to 32835 states and 52039 transitions. [2019-09-10 06:30:22,086 INFO L78 Accepts]: Start accepts. Automaton has 32835 states and 52039 transitions. Word has length 479 [2019-09-10 06:30:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:22,086 INFO L475 AbstractCegarLoop]: Abstraction has 32835 states and 52039 transitions. [2019-09-10 06:30:22,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:30:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 32835 states and 52039 transitions. [2019-09-10 06:30:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-10 06:30:22,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:22,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:22,110 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1098672624, now seen corresponding path program 1 times [2019-09-10 06:30:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:22,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:22,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:22,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:23,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:30:23,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:23,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:30:23,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:30:23,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:30:23,980 INFO L87 Difference]: Start difference. First operand 32835 states and 52039 transitions. Second operand 16 states. [2019-09-10 06:30:27,650 WARN L188 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-09-10 06:30:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:30,072 INFO L93 Difference]: Finished difference Result 58860 states and 92757 transitions. [2019-09-10 06:30:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:30:30,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 479 [2019-09-10 06:30:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:30,120 INFO L225 Difference]: With dead ends: 58860 [2019-09-10 06:30:30,120 INFO L226 Difference]: Without dead ends: 58860 [2019-09-10 06:30:30,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=331, Invalid=791, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:30:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58860 states. [2019-09-10 06:30:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58860 to 35351. [2019-09-10 06:30:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35351 states. [2019-09-10 06:30:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35351 states to 35351 states and 55707 transitions. [2019-09-10 06:30:30,509 INFO L78 Accepts]: Start accepts. Automaton has 35351 states and 55707 transitions. Word has length 479 [2019-09-10 06:30:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:30,510 INFO L475 AbstractCegarLoop]: Abstraction has 35351 states and 55707 transitions. [2019-09-10 06:30:30,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:30:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 35351 states and 55707 transitions. [2019-09-10 06:30:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-10 06:30:30,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:30,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:30,533 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1827309321, now seen corresponding path program 1 times [2019-09-10 06:30:30,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:30,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:31,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:31,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:31,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:31,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:31,714 INFO L87 Difference]: Start difference. First operand 35351 states and 55707 transitions. Second operand 4 states. [2019-09-10 06:30:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:31,994 INFO L93 Difference]: Finished difference Result 68971 states and 108220 transitions. [2019-09-10 06:30:31,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:31,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2019-09-10 06:30:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:32,071 INFO L225 Difference]: With dead ends: 68971 [2019-09-10 06:30:32,071 INFO L226 Difference]: Without dead ends: 68971 [2019-09-10 06:30:32,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:30:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68971 states. [2019-09-10 06:30:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68971 to 68969. [2019-09-10 06:30:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68969 states. [2019-09-10 06:30:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68969 states to 68969 states and 108219 transitions. [2019-09-10 06:30:32,903 INFO L78 Accepts]: Start accepts. Automaton has 68969 states and 108219 transitions. Word has length 479 [2019-09-10 06:30:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:32,903 INFO L475 AbstractCegarLoop]: Abstraction has 68969 states and 108219 transitions. [2019-09-10 06:30:32,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 68969 states and 108219 transitions. [2019-09-10 06:30:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-10 06:30:32,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:32,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:32,951 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 904031781, now seen corresponding path program 1 times [2019-09-10 06:30:32,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:32,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:32,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:33,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:33,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:33,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:33,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:33,461 INFO L87 Difference]: Start difference. First operand 68969 states and 108219 transitions. Second operand 3 states. [2019-09-10 06:30:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:33,827 INFO L93 Difference]: Finished difference Result 134946 states and 210510 transitions. [2019-09-10 06:30:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:33,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-10 06:30:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:33,964 INFO L225 Difference]: With dead ends: 134946 [2019-09-10 06:30:33,964 INFO L226 Difference]: Without dead ends: 134946 [2019-09-10 06:30:33,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134946 states. [2019-09-10 06:30:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134946 to 134944. [2019-09-10 06:30:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134944 states. [2019-09-10 06:30:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134944 states to 134944 states and 210509 transitions. [2019-09-10 06:30:36,840 INFO L78 Accepts]: Start accepts. Automaton has 134944 states and 210509 transitions. Word has length 481 [2019-09-10 06:30:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:36,840 INFO L475 AbstractCegarLoop]: Abstraction has 134944 states and 210509 transitions. [2019-09-10 06:30:36,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 134944 states and 210509 transitions. [2019-09-10 06:30:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-10 06:30:36,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:36,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:36,935 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1816704969, now seen corresponding path program 1 times [2019-09-10 06:30:36,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:36,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:36,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:37,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:37,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:37,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:37,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:37,350 INFO L87 Difference]: Start difference. First operand 134944 states and 210509 transitions. Second operand 3 states. [2019-09-10 06:30:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:37,879 INFO L93 Difference]: Finished difference Result 265558 states and 412344 transitions. [2019-09-10 06:30:37,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:37,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-10 06:30:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:41,225 INFO L225 Difference]: With dead ends: 265558 [2019-09-10 06:30:41,226 INFO L226 Difference]: Without dead ends: 265558 [2019-09-10 06:30:41,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265558 states. [2019-09-10 06:30:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265558 to 265556. [2019-09-10 06:30:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265556 states. [2019-09-10 06:30:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265556 states to 265556 states and 412343 transitions. [2019-09-10 06:30:44,144 INFO L78 Accepts]: Start accepts. Automaton has 265556 states and 412343 transitions. Word has length 481 [2019-09-10 06:30:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:44,144 INFO L475 AbstractCegarLoop]: Abstraction has 265556 states and 412343 transitions. [2019-09-10 06:30:44,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 265556 states and 412343 transitions. [2019-09-10 06:30:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-10 06:30:44,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:44,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:44,367 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash -898482756, now seen corresponding path program 1 times [2019-09-10 06:30:44,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:44,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:44,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:44,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:44,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:44,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:44,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:44,828 INFO L87 Difference]: Start difference. First operand 265556 states and 412343 transitions. Second operand 3 states. [2019-09-10 06:30:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:45,915 INFO L93 Difference]: Finished difference Result 521931 states and 806195 transitions. [2019-09-10 06:30:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:45,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2019-09-10 06:30:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:46,497 INFO L225 Difference]: With dead ends: 521931 [2019-09-10 06:30:46,497 INFO L226 Difference]: Without dead ends: 521931 [2019-09-10 06:30:46,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521931 states. [2019-09-10 06:30:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521931 to 521929. [2019-09-10 06:30:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521929 states. [2019-09-10 06:30:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521929 states to 521929 states and 806194 transitions. [2019-09-10 06:30:58,219 INFO L78 Accepts]: Start accepts. Automaton has 521929 states and 806194 transitions. Word has length 483 [2019-09-10 06:30:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:58,220 INFO L475 AbstractCegarLoop]: Abstraction has 521929 states and 806194 transitions. [2019-09-10 06:30:58,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 521929 states and 806194 transitions. [2019-09-10 06:30:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-10 06:30:58,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:58,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:58,677 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash -801853505, now seen corresponding path program 1 times [2019-09-10 06:30:58,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:58,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:58,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:58,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:58,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:59,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:59,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:59,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:59,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:59,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:59,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:59,225 INFO L87 Difference]: Start difference. First operand 521929 states and 806194 transitions. Second operand 4 states. [2019-09-10 06:31:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:06,916 INFO L93 Difference]: Finished difference Result 957147 states and 1471841 transitions. [2019-09-10 06:31:06,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:31:06,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2019-09-10 06:31:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:09,181 INFO L225 Difference]: With dead ends: 957147 [2019-09-10 06:31:09,181 INFO L226 Difference]: Without dead ends: 957147 [2019-09-10 06:31:09,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:31:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957147 states. [2019-09-10 06:31:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957147 to 568841. [2019-09-10 06:31:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568841 states. [2019-09-10 06:31:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568841 states to 568841 states and 885224 transitions. [2019-09-10 06:31:26,200 INFO L78 Accepts]: Start accepts. Automaton has 568841 states and 885224 transitions. Word has length 483 [2019-09-10 06:31:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:26,201 INFO L475 AbstractCegarLoop]: Abstraction has 568841 states and 885224 transitions. [2019-09-10 06:31:26,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 568841 states and 885224 transitions. [2019-09-10 06:31:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-10 06:31:35,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:35,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:31:35,289 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2015802514, now seen corresponding path program 1 times [2019-09-10 06:31:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:35,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:35,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:31:35,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:35,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:31:35,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:35,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:31:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:31:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:31:35,825 INFO L87 Difference]: Start difference. First operand 568841 states and 885224 transitions. Second operand 4 states. [2019-09-10 06:31:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:38,474 INFO L93 Difference]: Finished difference Result 1054360 states and 1635970 transitions. [2019-09-10 06:31:38,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:31:38,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-09-10 06:31:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:40,914 INFO L225 Difference]: With dead ends: 1054360 [2019-09-10 06:31:40,914 INFO L226 Difference]: Without dead ends: 1054360 [2019-09-10 06:31:40,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:31:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054360 states. [2019-09-10 06:31:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054360 to 582682. [2019-09-10 06:31:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582682 states. [2019-09-10 06:31:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582682 states to 582682 states and 909857 transitions. [2019-09-10 06:31:58,203 INFO L78 Accepts]: Start accepts. Automaton has 582682 states and 909857 transitions. Word has length 485 [2019-09-10 06:31:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:58,203 INFO L475 AbstractCegarLoop]: Abstraction has 582682 states and 909857 transitions. [2019-09-10 06:31:58,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 582682 states and 909857 transitions. [2019-09-10 06:31:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 06:31:58,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:58,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:31:58,809 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash -699969512, now seen corresponding path program 1 times [2019-09-10 06:31:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:58,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:58,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:58,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:00,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:00,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:00,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:00,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:00,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:00,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:00,619 INFO L87 Difference]: Start difference. First operand 582682 states and 909857 transitions. Second operand 3 states. [2019-09-10 06:32:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:11,379 INFO L93 Difference]: Finished difference Result 1045286 states and 1624108 transitions. [2019-09-10 06:32:11,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:11,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 06:32:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:12,660 INFO L225 Difference]: With dead ends: 1045286 [2019-09-10 06:32:12,661 INFO L226 Difference]: Without dead ends: 1045286 [2019-09-10 06:32:12,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045286 states. [2019-09-10 06:32:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045286 to 596221. [2019-09-10 06:32:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596221 states. [2019-09-10 06:32:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596221 states to 596221 states and 927448 transitions. [2019-09-10 06:32:28,432 INFO L78 Accepts]: Start accepts. Automaton has 596221 states and 927448 transitions. Word has length 490 [2019-09-10 06:32:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:28,432 INFO L475 AbstractCegarLoop]: Abstraction has 596221 states and 927448 transitions. [2019-09-10 06:32:28,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 596221 states and 927448 transitions. [2019-09-10 06:32:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 06:32:37,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:37,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:32:37,757 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:37,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2063414391, now seen corresponding path program 1 times [2019-09-10 06:32:37,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:37,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:37,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:37,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:37,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:37,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:37,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:37,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:37,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:37,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:37,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:37,979 INFO L87 Difference]: Start difference. First operand 596221 states and 927448 transitions. Second operand 3 states. [2019-09-10 06:32:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:46,820 INFO L93 Difference]: Finished difference Result 1013269 states and 1557919 transitions. [2019-09-10 06:32:46,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:46,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 06:32:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:47,746 INFO L225 Difference]: With dead ends: 1013269 [2019-09-10 06:32:47,746 INFO L226 Difference]: Without dead ends: 1013269 [2019-09-10 06:32:47,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013269 states. [2019-09-10 06:32:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013269 to 603347. [2019-09-10 06:32:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603347 states. [2019-09-10 06:32:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603347 states to 603347 states and 938206 transitions. [2019-09-10 06:32:58,092 INFO L78 Accepts]: Start accepts. Automaton has 603347 states and 938206 transitions. Word has length 490 [2019-09-10 06:32:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:58,092 INFO L475 AbstractCegarLoop]: Abstraction has 603347 states and 938206 transitions. [2019-09-10 06:32:58,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 603347 states and 938206 transitions. [2019-09-10 06:33:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 06:33:08,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:08,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:08,075 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash -58536517, now seen corresponding path program 1 times [2019-09-10 06:33:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:08,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:08,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:08,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:08,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:08,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:08,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:08,646 INFO L87 Difference]: Start difference. First operand 603347 states and 938206 transitions. Second operand 4 states. [2019-09-10 06:33:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:12,313 INFO L93 Difference]: Finished difference Result 1062878 states and 1646891 transitions. [2019-09-10 06:33:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:12,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2019-09-10 06:33:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:13,424 INFO L225 Difference]: With dead ends: 1062878 [2019-09-10 06:33:13,424 INFO L226 Difference]: Without dead ends: 1062878 [2019-09-10 06:33:13,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:33:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062878 states. [2019-09-10 06:33:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062878 to 669380. [2019-09-10 06:33:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669380 states. [2019-09-10 06:33:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669380 states to 669380 states and 1052272 transitions. [2019-09-10 06:33:32,485 INFO L78 Accepts]: Start accepts. Automaton has 669380 states and 1052272 transitions. Word has length 491 [2019-09-10 06:33:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:32,485 INFO L475 AbstractCegarLoop]: Abstraction has 669380 states and 1052272 transitions. [2019-09-10 06:33:32,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 669380 states and 1052272 transitions. [2019-09-10 06:33:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 06:33:33,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:33,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:33,091 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash 313379420, now seen corresponding path program 1 times [2019-09-10 06:33:33,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:33,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:33,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:42,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:42,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:33:42,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:42,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:33:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:33:42,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:33:42,676 INFO L87 Difference]: Start difference. First operand 669380 states and 1052272 transitions. Second operand 17 states. [2019-09-10 06:33:45,207 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:33:46,134 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:34:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:03,881 INFO L93 Difference]: Finished difference Result 1877704 states and 2932394 transitions. [2019-09-10 06:34:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:34:03,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 491 [2019-09-10 06:34:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:06,314 INFO L225 Difference]: With dead ends: 1877704 [2019-09-10 06:34:06,315 INFO L226 Difference]: Without dead ends: 1877704 [2019-09-10 06:34:06,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=720, Invalid=1730, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:34:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877704 states. [2019-09-10 06:34:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877704 to 889412. [2019-09-10 06:34:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889412 states. [2019-09-10 06:34:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889412 states to 889412 states and 1392048 transitions. [2019-09-10 06:34:43,899 INFO L78 Accepts]: Start accepts. Automaton has 889412 states and 1392048 transitions. Word has length 491 [2019-09-10 06:34:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:43,900 INFO L475 AbstractCegarLoop]: Abstraction has 889412 states and 1392048 transitions. [2019-09-10 06:34:43,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:34:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 889412 states and 1392048 transitions. [2019-09-10 06:34:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 06:34:44,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:44,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:44,565 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:44,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2085595177, now seen corresponding path program 1 times [2019-09-10 06:34:44,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:44,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:44,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:48,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 06:34:48,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:48,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:34:48,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:48,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:34:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:34:48,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:34:48,160 INFO L87 Difference]: Start difference. First operand 889412 states and 1392048 transitions. Second operand 16 states. [2019-09-10 06:34:50,466 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-09-10 06:34:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:58,114 INFO L93 Difference]: Finished difference Result 1356778 states and 2124871 transitions. [2019-09-10 06:34:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:34:58,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 491 [2019-09-10 06:34:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:01,618 INFO L225 Difference]: With dead ends: 1356778 [2019-09-10 06:35:01,619 INFO L226 Difference]: Without dead ends: 1356778 [2019-09-10 06:35:01,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=331, Invalid=791, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:35:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356778 states. [2019-09-10 06:35:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356778 to 868228. [2019-09-10 06:35:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868228 states. [2019-09-10 06:35:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868228 states to 868228 states and 1361520 transitions. [2019-09-10 06:35:31,770 INFO L78 Accepts]: Start accepts. Automaton has 868228 states and 1361520 transitions. Word has length 491 [2019-09-10 06:35:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:31,771 INFO L475 AbstractCegarLoop]: Abstraction has 868228 states and 1361520 transitions. [2019-09-10 06:35:31,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:35:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 868228 states and 1361520 transitions. [2019-09-10 06:35:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 06:35:43,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:43,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:43,425 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 172474953, now seen corresponding path program 1 times [2019-09-10 06:35:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:43,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:43,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:44,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:44,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:35:44,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:44,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:35:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:35:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:35:44,892 INFO L87 Difference]: Start difference. First operand 868228 states and 1361520 transitions. Second operand 13 states. [2019-09-10 06:35:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:52,191 INFO L93 Difference]: Finished difference Result 1280070 states and 1995341 transitions. [2019-09-10 06:35:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:35:52,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 491 [2019-09-10 06:35:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:53,786 INFO L225 Difference]: With dead ends: 1280070 [2019-09-10 06:35:53,787 INFO L226 Difference]: Without dead ends: 1280070 [2019-09-10 06:35:53,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:35:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280070 states. [2019-09-10 06:36:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280070 to 917444. [2019-09-10 06:36:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917444 states. [2019-09-10 06:36:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917444 states to 917444 states and 1432304 transitions. [2019-09-10 06:36:19,001 INFO L78 Accepts]: Start accepts. Automaton has 917444 states and 1432304 transitions. Word has length 491 [2019-09-10 06:36:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:19,001 INFO L475 AbstractCegarLoop]: Abstraction has 917444 states and 1432304 transitions. [2019-09-10 06:36:19,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:36:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 917444 states and 1432304 transitions. [2019-09-10 06:36:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 06:36:32,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:32,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:32,348 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2068467652, now seen corresponding path program 1 times [2019-09-10 06:36:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:32,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:32,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:33,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:33,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:36:33,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:33,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:36:33,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:36:33,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:36:33,338 INFO L87 Difference]: Start difference. First operand 917444 states and 1432304 transitions. Second operand 4 states. [2019-09-10 06:36:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:39,843 INFO L93 Difference]: Finished difference Result 1802916 states and 2803576 transitions. [2019-09-10 06:36:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:36:39,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2019-09-10 06:36:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:42,064 INFO L225 Difference]: With dead ends: 1802916 [2019-09-10 06:36:42,064 INFO L226 Difference]: Without dead ends: 1802916 [2019-09-10 06:36:42,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802916 states. [2019-09-10 06:37:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802916 to 1802914. [2019-09-10 06:37:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802914 states.