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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:30:23,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:30:23,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:30:23,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:30:23,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:30:23,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:30:23,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:30:23,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:30:23,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:30:23,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:30:23,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:30:23,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:30:23,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:30:23,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:30:23,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:30:23,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:30:23,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:30:23,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:30:23,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:30:23,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:30:23,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:30:23,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:30:23,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:30:23,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:30:23,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:30:23,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:30:23,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:30:23,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:30:23,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:30:23,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:30:23,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:30:23,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:30:23,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:30:23,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:30:23,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:30:23,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:30:23,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:30:23,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:30:23,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:30:23,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:30:23,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:30:23,208 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:30:23,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:30:23,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:30:23,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:30:23,224 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:30:23,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:30:23,225 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:30:23,225 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:30:23,226 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:30:23,226 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:30:23,226 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:30:23,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:30:23,227 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:30:23,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:30:23,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:30:23,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:30:23,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:30:23,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:30:23,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:30:23,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:30:23,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:30:23,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:30:23,229 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:30:23,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:30:23,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:30:23,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:30:23,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:30:23,230 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:30:23,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:30:23,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:30:23,230 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:30:23,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:30:23,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:30:23,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:30:23,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:30:23,277 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:30:23,278 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:30:23,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b162d52a2/0513b8ad611b4a0b906e5c774e7aeb2e/FLAG74b5b2b11 [2019-09-10 06:30:23,997 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:30:23,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:30:24,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b162d52a2/0513b8ad611b4a0b906e5c774e7aeb2e/FLAG74b5b2b11 [2019-09-10 06:30:24,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b162d52a2/0513b8ad611b4a0b906e5c774e7aeb2e [2019-09-10 06:30:24,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:30:24,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:30:24,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:30:24,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:30:24,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:30:24,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:30:24" (1/1) ... [2019-09-10 06:30:24,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:24, skipping insertion in model container [2019-09-10 06:30:24,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:30:24" (1/1) ... [2019-09-10 06:30:24,155 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:30:24,331 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:30:25,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:30:25,862 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:30:27,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:30:27,306 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:30:27,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27 WrapperNode [2019-09-10 06:30:27,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:30:27,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:30:27,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:30:27,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:30:27,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (1/1) ... [2019-09-10 06:30:27,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:30:27,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:30:27,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:30:27,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:30:27,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (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:30:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:30:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:30:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:30:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:30:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:30:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:30:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:30:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:30:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:30:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:30:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:30:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:30:27,738 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:30:27,738 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:30:27,738 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:30:27,738 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:30:27,739 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:30:27,739 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:30:27,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:30:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:30:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:30:31,905 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:30:31,905 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:30:31,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:30:31 BoogieIcfgContainer [2019-09-10 06:30:31,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:30:31,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:30:31,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:30:31,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:30:31,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:30:24" (1/3) ... [2019-09-10 06:30:31,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7783c9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:30:31, skipping insertion in model container [2019-09-10 06:30:31,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:30:27" (2/3) ... [2019-09-10 06:30:31,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7783c9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:30:31, skipping insertion in model container [2019-09-10 06:30:31,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:30:31" (3/3) ... [2019-09-10 06:30:31,924 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:30:31,936 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:30:31,962 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:30:31,981 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:30:32,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:30:32,017 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:30:32,017 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:30:32,017 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:30:32,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:30:32,018 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:30:32,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:30:32,018 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:30:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states. [2019-09-10 06:30:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-10 06:30:32,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:32,130 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:32,134 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1122091667, now seen corresponding path program 1 times [2019-09-10 06:30:32,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:32,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:32,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:32,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:34,887 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:34,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:34,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:34,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:34,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:34,915 INFO L87 Difference]: Start difference. First operand 1393 states. Second operand 4 states. [2019-09-10 06:30:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:35,479 INFO L93 Difference]: Finished difference Result 2749 states and 4951 transitions. [2019-09-10 06:30:35,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:30:35,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2019-09-10 06:30:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:35,525 INFO L225 Difference]: With dead ends: 2749 [2019-09-10 06:30:35,525 INFO L226 Difference]: Without dead ends: 2741 [2019-09-10 06:30:35,530 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:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2019-09-10 06:30:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2688. [2019-09-10 06:30:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2019-09-10 06:30:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4398 transitions. [2019-09-10 06:30:35,686 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4398 transitions. Word has length 473 [2019-09-10 06:30:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:35,687 INFO L475 AbstractCegarLoop]: Abstraction has 2688 states and 4398 transitions. [2019-09-10 06:30:35,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4398 transitions. [2019-09-10 06:30:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-10 06:30:35,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:35,703 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] [2019-09-10 06:30:35,704 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1084658380, now seen corresponding path program 1 times [2019-09-10 06:30:35,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:35,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:35,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:36,464 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:36,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:36,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:36,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:36,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:36,477 INFO L87 Difference]: Start difference. First operand 2688 states and 4398 transitions. Second operand 3 states. [2019-09-10 06:30:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:36,757 INFO L93 Difference]: Finished difference Result 5319 states and 8673 transitions. [2019-09-10 06:30:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:36,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-10 06:30:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:36,796 INFO L225 Difference]: With dead ends: 5319 [2019-09-10 06:30:36,796 INFO L226 Difference]: Without dead ends: 5319 [2019-09-10 06:30:36,797 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:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2019-09-10 06:30:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5268. [2019-09-10 06:30:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-09-10 06:30:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 8596 transitions. [2019-09-10 06:30:37,012 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 8596 transitions. Word has length 475 [2019-09-10 06:30:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:37,015 INFO L475 AbstractCegarLoop]: Abstraction has 5268 states and 8596 transitions. [2019-09-10 06:30:37,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 8596 transitions. [2019-09-10 06:30:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:30:37,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:37,040 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:37,042 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1269879540, now seen corresponding path program 1 times [2019-09-10 06:30:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:37,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:37,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:37,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:37,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:37,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:37,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:37,317 INFO L87 Difference]: Start difference. First operand 5268 states and 8596 transitions. Second operand 3 states. [2019-09-10 06:30:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:37,446 INFO L93 Difference]: Finished difference Result 10491 states and 17104 transitions. [2019-09-10 06:30:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:37,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-10 06:30:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:37,498 INFO L225 Difference]: With dead ends: 10491 [2019-09-10 06:30:37,498 INFO L226 Difference]: Without dead ends: 10491 [2019-09-10 06:30:37,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:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10491 states. [2019-09-10 06:30:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10491 to 5315. [2019-09-10 06:30:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5315 states. [2019-09-10 06:30:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 8670 transitions. [2019-09-10 06:30:37,796 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 8670 transitions. Word has length 476 [2019-09-10 06:30:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:37,797 INFO L475 AbstractCegarLoop]: Abstraction has 5315 states and 8670 transitions. [2019-09-10 06:30:37,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 8670 transitions. [2019-09-10 06:30:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-10 06:30:37,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:37,831 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:37,832 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1081134361, now seen corresponding path program 1 times [2019-09-10 06:30:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:37,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:37,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:38,502 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:38,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:38,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:38,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:38,506 INFO L87 Difference]: Start difference. First operand 5315 states and 8670 transitions. Second operand 3 states. [2019-09-10 06:30:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:38,764 INFO L93 Difference]: Finished difference Result 10369 states and 16825 transitions. [2019-09-10 06:30:38,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:38,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 477 [2019-09-10 06:30:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:38,826 INFO L225 Difference]: With dead ends: 10369 [2019-09-10 06:30:38,826 INFO L226 Difference]: Without dead ends: 10369 [2019-09-10 06:30:38,827 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:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10369 states. [2019-09-10 06:30:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10369 to 10320. [2019-09-10 06:30:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10320 states. [2019-09-10 06:30:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10320 states to 10320 states and 16752 transitions. [2019-09-10 06:30:39,058 INFO L78 Accepts]: Start accepts. Automaton has 10320 states and 16752 transitions. Word has length 477 [2019-09-10 06:30:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:39,059 INFO L475 AbstractCegarLoop]: Abstraction has 10320 states and 16752 transitions. [2019-09-10 06:30:39,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10320 states and 16752 transitions. [2019-09-10 06:30:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-10 06:30:39,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:39,093 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:39,093 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:39,094 INFO L82 PathProgramCache]: Analyzing trace with hash 156018356, now seen corresponding path program 1 times [2019-09-10 06:30:39,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:39,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:39,350 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:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:39,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:39,354 INFO L87 Difference]: Start difference. First operand 10320 states and 16752 transitions. Second operand 3 states. [2019-09-10 06:30:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:39,469 INFO L93 Difference]: Finished difference Result 20528 states and 33294 transitions. [2019-09-10 06:30:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:39,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 477 [2019-09-10 06:30:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:39,514 INFO L225 Difference]: With dead ends: 20528 [2019-09-10 06:30:39,514 INFO L226 Difference]: Without dead ends: 20528 [2019-09-10 06:30:39,514 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:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20528 states. [2019-09-10 06:30:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20528 to 10418. [2019-09-10 06:30:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10418 states. [2019-09-10 06:30:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 16903 transitions. [2019-09-10 06:30:39,845 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 16903 transitions. Word has length 477 [2019-09-10 06:30:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:39,846 INFO L475 AbstractCegarLoop]: Abstraction has 10418 states and 16903 transitions. [2019-09-10 06:30:39,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 16903 transitions. [2019-09-10 06:30:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-10 06:30:39,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:39,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,875 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 729654203, now seen corresponding path program 1 times [2019-09-10 06:30:39,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:39,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:39,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:40,135 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:40,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:40,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:40,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:40,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:40,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:40,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:40,137 INFO L87 Difference]: Start difference. First operand 10418 states and 16903 transitions. Second operand 3 states. [2019-09-10 06:30:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:40,229 INFO L93 Difference]: Finished difference Result 20645 states and 33440 transitions. [2019-09-10 06:30:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:40,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-10 06:30:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:40,274 INFO L225 Difference]: With dead ends: 20645 [2019-09-10 06:30:40,274 INFO L226 Difference]: Without dead ends: 20645 [2019-09-10 06:30:40,274 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:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20645 states. [2019-09-10 06:30:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20645 to 10535. [2019-09-10 06:30:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10535 states. [2019-09-10 06:30:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 17049 transitions. [2019-09-10 06:30:40,512 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 17049 transitions. Word has length 478 [2019-09-10 06:30:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:40,514 INFO L475 AbstractCegarLoop]: Abstraction has 10535 states and 17049 transitions. [2019-09-10 06:30:40,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 17049 transitions. [2019-09-10 06:30:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-10 06:30:40,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:40,544 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:40,552 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash 291290657, now seen corresponding path program 1 times [2019-09-10 06:30:40,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:40,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:40,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:41,366 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:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:41,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:41,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:41,369 INFO L87 Difference]: Start difference. First operand 10535 states and 17049 transitions. Second operand 4 states. [2019-09-10 06:30:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:41,595 INFO L93 Difference]: Finished difference Result 20428 states and 32965 transitions. [2019-09-10 06:30:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:41,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2019-09-10 06:30:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:41,663 INFO L225 Difference]: With dead ends: 20428 [2019-09-10 06:30:41,663 INFO L226 Difference]: Without dead ends: 20428 [2019-09-10 06:30:41,664 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:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20428 states. [2019-09-10 06:30:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20428 to 11470. [2019-09-10 06:30:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11470 states. [2019-09-10 06:30:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11470 states to 11470 states and 18697 transitions. [2019-09-10 06:30:41,975 INFO L78 Accepts]: Start accepts. Automaton has 11470 states and 18697 transitions. Word has length 479 [2019-09-10 06:30:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:41,976 INFO L475 AbstractCegarLoop]: Abstraction has 11470 states and 18697 transitions. [2019-09-10 06:30:41,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11470 states and 18697 transitions. [2019-09-10 06:30:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-10 06:30:42,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:42,002 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:42,002 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:42,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1919860958, now seen corresponding path program 1 times [2019-09-10 06:30:42,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:42,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:42,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:42,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:42,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:43,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:43,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:43,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:43,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:43,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:43,066 INFO L87 Difference]: Start difference. First operand 11470 states and 18697 transitions. Second operand 3 states. [2019-09-10 06:30:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:43,315 INFO L93 Difference]: Finished difference Result 21648 states and 35062 transitions. [2019-09-10 06:30:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:43,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-09-10 06:30:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:43,383 INFO L225 Difference]: With dead ends: 21648 [2019-09-10 06:30:43,384 INFO L226 Difference]: Without dead ends: 21648 [2019-09-10 06:30:43,385 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:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21648 states. [2019-09-10 06:30:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21648 to 21601. [2019-09-10 06:30:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21601 states. [2019-09-10 06:30:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21601 states to 21601 states and 34993 transitions. [2019-09-10 06:30:43,735 INFO L78 Accepts]: Start accepts. Automaton has 21601 states and 34993 transitions. Word has length 479 [2019-09-10 06:30:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:43,736 INFO L475 AbstractCegarLoop]: Abstraction has 21601 states and 34993 transitions. [2019-09-10 06:30:43,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 21601 states and 34993 transitions. [2019-09-10 06:30:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-10 06:30:43,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:43,782 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] [2019-09-10 06:30:43,782 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:43,783 INFO L82 PathProgramCache]: Analyzing trace with hash -548860705, now seen corresponding path program 1 times [2019-09-10 06:30:43,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:43,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:43,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:44,124 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,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:44,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:44,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:44,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:44,126 INFO L87 Difference]: Start difference. First operand 21601 states and 34993 transitions. Second operand 3 states. [2019-09-10 06:30:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:44,303 INFO L93 Difference]: Finished difference Result 39724 states and 63708 transitions. [2019-09-10 06:30:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:44,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2019-09-10 06:30:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:44,495 INFO L225 Difference]: With dead ends: 39724 [2019-09-10 06:30:44,496 INFO L226 Difference]: Without dead ends: 39724 [2019-09-10 06:30:44,497 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:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39724 states. [2019-09-10 06:30:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39724 to 22048. [2019-09-10 06:30:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2019-09-10 06:30:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 35668 transitions. [2019-09-10 06:30:44,933 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 35668 transitions. Word has length 482 [2019-09-10 06:30:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:44,933 INFO L475 AbstractCegarLoop]: Abstraction has 22048 states and 35668 transitions. [2019-09-10 06:30:44,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 35668 transitions. [2019-09-10 06:30:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-10 06:30:44,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:44,971 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,971 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash -129185720, now seen corresponding path program 1 times [2019-09-10 06:30:44,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:44,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:44,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:44,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:44,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:45,313 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:45,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:45,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:45,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:45,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:45,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:45,319 INFO L87 Difference]: Start difference. First operand 22048 states and 35668 transitions. Second operand 3 states. [2019-09-10 06:30:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:45,519 INFO L93 Difference]: Finished difference Result 40339 states and 64584 transitions. [2019-09-10 06:30:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:45,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2019-09-10 06:30:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:45,586 INFO L225 Difference]: With dead ends: 40339 [2019-09-10 06:30:45,587 INFO L226 Difference]: Without dead ends: 40339 [2019-09-10 06:30:45,587 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:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40339 states. [2019-09-10 06:30:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40339 to 22695. [2019-09-10 06:30:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22695 states. [2019-09-10 06:30:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22695 states to 22695 states and 36608 transitions. [2019-09-10 06:30:46,942 INFO L78 Accepts]: Start accepts. Automaton has 22695 states and 36608 transitions. Word has length 483 [2019-09-10 06:30:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:46,943 INFO L475 AbstractCegarLoop]: Abstraction has 22695 states and 36608 transitions. [2019-09-10 06:30:46,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 22695 states and 36608 transitions. [2019-09-10 06:30:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-10 06:30:46,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:46,977 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] [2019-09-10 06:30:46,978 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1709794957, now seen corresponding path program 1 times [2019-09-10 06:30:46,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:46,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:47,276 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:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:47,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:47,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:47,279 INFO L87 Difference]: Start difference. First operand 22695 states and 36608 transitions. Second operand 3 states. [2019-09-10 06:30:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:47,439 INFO L93 Difference]: Finished difference Result 41193 states and 65646 transitions. [2019-09-10 06:30:47,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:47,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2019-09-10 06:30:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:47,510 INFO L225 Difference]: With dead ends: 41193 [2019-09-10 06:30:47,511 INFO L226 Difference]: Without dead ends: 41193 [2019-09-10 06:30:47,514 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:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41193 states. [2019-09-10 06:30:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41193 to 23549. [2019-09-10 06:30:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23549 states. [2019-09-10 06:30:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23549 states to 23549 states and 37670 transitions. [2019-09-10 06:30:47,984 INFO L78 Accepts]: Start accepts. Automaton has 23549 states and 37670 transitions. Word has length 484 [2019-09-10 06:30:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:47,984 INFO L475 AbstractCegarLoop]: Abstraction has 23549 states and 37670 transitions. [2019-09-10 06:30:47,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 23549 states and 37670 transitions. [2019-09-10 06:30:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-10 06:30:48,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:48,023 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:30:48,024 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1829044870, now seen corresponding path program 1 times [2019-09-10 06:30:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:48,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:48,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:48,557 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:48,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:48,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:48,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:48,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:48,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:48,560 INFO L87 Difference]: Start difference. First operand 23549 states and 37670 transitions. Second operand 3 states. [2019-09-10 06:30:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:49,651 INFO L93 Difference]: Finished difference Result 35297 states and 55422 transitions. [2019-09-10 06:30:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:49,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 485 [2019-09-10 06:30:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:49,704 INFO L225 Difference]: With dead ends: 35297 [2019-09-10 06:30:49,704 INFO L226 Difference]: Without dead ends: 35297 [2019-09-10 06:30:49,704 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:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35297 states. [2019-09-10 06:30:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35297 to 35173. [2019-09-10 06:30:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35173 states. [2019-09-10 06:30:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35173 states to 35173 states and 55246 transitions. [2019-09-10 06:30:50,185 INFO L78 Accepts]: Start accepts. Automaton has 35173 states and 55246 transitions. Word has length 485 [2019-09-10 06:30:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:50,186 INFO L475 AbstractCegarLoop]: Abstraction has 35173 states and 55246 transitions. [2019-09-10 06:30:50,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35173 states and 55246 transitions. [2019-09-10 06:30:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-10 06:30:50,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:50,267 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:30:50,267 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2064605616, now seen corresponding path program 1 times [2019-09-10 06:30:50,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:50,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:50,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:50,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:50,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:51,958 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:51,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:51,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:30:51,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:51,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:30:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:30:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:30:51,961 INFO L87 Difference]: Start difference. First operand 35173 states and 55246 transitions. Second operand 4 states. [2019-09-10 06:30:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:52,274 INFO L93 Difference]: Finished difference Result 68678 states and 107423 transitions. [2019-09-10 06:30:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:30:52,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-09-10 06:30:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:52,373 INFO L225 Difference]: With dead ends: 68678 [2019-09-10 06:30:52,373 INFO L226 Difference]: Without dead ends: 68678 [2019-09-10 06:30:52,374 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:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68678 states. [2019-09-10 06:30:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68678 to 68636. [2019-09-10 06:30:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68636 states. [2019-09-10 06:30:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68636 states to 68636 states and 107361 transitions. [2019-09-10 06:30:53,147 INFO L78 Accepts]: Start accepts. Automaton has 68636 states and 107361 transitions. Word has length 485 [2019-09-10 06:30:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:53,148 INFO L475 AbstractCegarLoop]: Abstraction has 68636 states and 107361 transitions. [2019-09-10 06:30:53,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 68636 states and 107361 transitions. [2019-09-10 06:30:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 06:30:53,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:53,217 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] [2019-09-10 06:30:53,218 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1990395407, now seen corresponding path program 1 times [2019-09-10 06:30:53,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:53,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:53,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:53,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:53,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:53,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:53,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:53,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:53,740 INFO L87 Difference]: Start difference. First operand 68636 states and 107361 transitions. Second operand 3 states. [2019-09-10 06:30:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:55,214 INFO L93 Difference]: Finished difference Result 134295 states and 208839 transitions. [2019-09-10 06:30:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:55,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-10 06:30:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:55,348 INFO L225 Difference]: With dead ends: 134295 [2019-09-10 06:30:55,349 INFO L226 Difference]: Without dead ends: 134295 [2019-09-10 06:30:55,349 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:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134295 states. [2019-09-10 06:30:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134295 to 134255. [2019-09-10 06:30:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134255 states. [2019-09-10 06:30:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134255 states to 134255 states and 208781 transitions. [2019-09-10 06:30:56,454 INFO L78 Accepts]: Start accepts. Automaton has 134255 states and 208781 transitions. Word has length 487 [2019-09-10 06:30:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:56,454 INFO L475 AbstractCegarLoop]: Abstraction has 134255 states and 208781 transitions. [2019-09-10 06:30:56,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:30:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 134255 states and 208781 transitions. [2019-09-10 06:30:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 06:30:56,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:56,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,555 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2035879528, now seen corresponding path program 1 times [2019-09-10 06:30:56,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:56,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:59,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:59,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:30:59,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:59,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:30:59,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:30:59,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:30:59,177 INFO L87 Difference]: Start difference. First operand 134255 states and 208781 transitions. Second operand 3 states. [2019-09-10 06:30:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:59,784 INFO L93 Difference]: Finished difference Result 264211 states and 408981 transitions. [2019-09-10 06:30:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:30:59,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-10 06:30:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:00,042 INFO L225 Difference]: With dead ends: 264211 [2019-09-10 06:31:00,043 INFO L226 Difference]: Without dead ends: 264211 [2019-09-10 06:31:00,043 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:31:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264211 states. [2019-09-10 06:31:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264211 to 264173. [2019-09-10 06:31:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264173 states. [2019-09-10 06:31:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264173 states to 264173 states and 408927 transitions. [2019-09-10 06:31:02,670 INFO L78 Accepts]: Start accepts. Automaton has 264173 states and 408927 transitions. Word has length 487 [2019-09-10 06:31:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:02,671 INFO L475 AbstractCegarLoop]: Abstraction has 264173 states and 408927 transitions. [2019-09-10 06:31:02,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:31:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 264173 states and 408927 transitions. [2019-09-10 06:31:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-10 06:31:06,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:06,730 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] [2019-09-10 06:31:06,730 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 316687101, now seen corresponding path program 1 times [2019-09-10 06:31:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:06,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:07,287 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:07,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:07,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:31:07,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:07,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:31:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:31:07,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:31:07,290 INFO L87 Difference]: Start difference. First operand 264173 states and 408927 transitions. Second operand 3 states. [2019-09-10 06:31:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:08,547 INFO L93 Difference]: Finished difference Result 519228 states and 799552 transitions. [2019-09-10 06:31:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:31:08,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 489 [2019-09-10 06:31:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:09,223 INFO L225 Difference]: With dead ends: 519228 [2019-09-10 06:31:09,223 INFO L226 Difference]: Without dead ends: 519228 [2019-09-10 06:31:09,224 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:31:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519228 states. [2019-09-10 06:31:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519228 to 519192. [2019-09-10 06:31:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519192 states. [2019-09-10 06:31:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519192 states to 519192 states and 799502 transitions. [2019-09-10 06:31:20,647 INFO L78 Accepts]: Start accepts. Automaton has 519192 states and 799502 transitions. Word has length 489 [2019-09-10 06:31:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:20,648 INFO L475 AbstractCegarLoop]: Abstraction has 519192 states and 799502 transitions. [2019-09-10 06:31:20,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:31:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 519192 states and 799502 transitions. [2019-09-10 06:31:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-10 06:31:21,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:21,083 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] [2019-09-10 06:31:21,083 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1681385152, now seen corresponding path program 1 times [2019-09-10 06:31:21,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:21,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:21,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:21,794 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:21,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:21,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:31:21,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:21,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:31:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:31:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:31:21,796 INFO L87 Difference]: Start difference. First operand 519192 states and 799502 transitions. Second operand 4 states. [2019-09-10 06:31:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:30,676 INFO L93 Difference]: Finished difference Result 964270 states and 1480364 transitions. [2019-09-10 06:31:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:31:30,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-09-10 06:31:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:31,732 INFO L225 Difference]: With dead ends: 964270 [2019-09-10 06:31:31,733 INFO L226 Difference]: Without dead ends: 964270 [2019-09-10 06:31:31,733 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:31:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964270 states. [2019-09-10 06:31:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964270 to 533556. [2019-09-10 06:31:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533556 states. [2019-09-10 06:31:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533556 states to 533556 states and 825063 transitions. [2019-09-10 06:31:49,778 INFO L78 Accepts]: Start accepts. Automaton has 533556 states and 825063 transitions. Word has length 489 [2019-09-10 06:31:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:49,779 INFO L475 AbstractCegarLoop]: Abstraction has 533556 states and 825063 transitions. [2019-09-10 06:31:49,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:31:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 533556 states and 825063 transitions. [2019-09-10 06:31:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 06:31:52,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:52,132 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, 1, 1] [2019-09-10 06:31:52,132 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash 668997163, now seen corresponding path program 1 times [2019-09-10 06:31:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:52,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:52,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:52,781 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:52,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:52,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:31:52,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:52,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:31:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:31:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:31:52,784 INFO L87 Difference]: Start difference. First operand 533556 states and 825063 transitions. Second operand 4 states. [2019-09-10 06:32:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:01,889 INFO L93 Difference]: Finished difference Result 960472 states and 1475702 transitions. [2019-09-10 06:32:01,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:32:01,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-10 06:32:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:03,029 INFO L225 Difference]: With dead ends: 960472 [2019-09-10 06:32:03,030 INFO L226 Difference]: Without dead ends: 960472 [2019-09-10 06:32:03,030 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:32:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960472 states. [2019-09-10 06:32:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960472 to 579945. [2019-09-10 06:32:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579945 states. [2019-09-10 06:32:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579945 states to 579945 states and 903165 transitions. [2019-09-10 06:32:17,155 INFO L78 Accepts]: Start accepts. Automaton has 579945 states and 903165 transitions. Word has length 493 [2019-09-10 06:32:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:17,155 INFO L475 AbstractCegarLoop]: Abstraction has 579945 states and 903165 transitions. [2019-09-10 06:32:17,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:32:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 579945 states and 903165 transitions. [2019-09-10 06:32:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 06:32:25,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:25,548 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, 1, 1, 1, 1, 1] [2019-09-10 06:32:25,549 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:25,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1605487766, now seen corresponding path program 1 times [2019-09-10 06:32:25,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:25,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:25,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:25,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:25,790 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:25,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:25,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:25,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:25,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:25,792 INFO L87 Difference]: Start difference. First operand 579945 states and 903165 transitions. Second operand 3 states. [2019-09-10 06:32:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:29,620 INFO L93 Difference]: Finished difference Result 1036700 states and 1606472 transitions. [2019-09-10 06:32:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:29,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 06:32:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:30,646 INFO L225 Difference]: With dead ends: 1036700 [2019-09-10 06:32:30,646 INFO L226 Difference]: Without dead ends: 1036700 [2019-09-10 06:32:30,647 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:31,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036700 states. [2019-09-10 06:32:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036700 to 593484. [2019-09-10 06:32:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593484 states. [2019-09-10 06:32:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593484 states to 593484 states and 920756 transitions. [2019-09-10 06:32:48,024 INFO L78 Accepts]: Start accepts. Automaton has 593484 states and 920756 transitions. Word has length 496 [2019-09-10 06:32:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:48,025 INFO L475 AbstractCegarLoop]: Abstraction has 593484 states and 920756 transitions. [2019-09-10 06:32:48,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 593484 states and 920756 transitions. [2019-09-10 06:32:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 06:32:48,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:48,559 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, 1, 1, 1, 1, 1] [2019-09-10 06:32:48,559 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1769549823, now seen corresponding path program 1 times [2019-09-10 06:32:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:48,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:48,837 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:48,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:48,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:48,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:48,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:48,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:48,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:48,839 INFO L87 Difference]: Start difference. First operand 593484 states and 920756 transitions. Second operand 3 states. [2019-09-10 06:33:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:01,381 INFO L93 Difference]: Finished difference Result 1007795 states and 1544535 transitions. [2019-09-10 06:33:01,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:01,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 06:33:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:02,428 INFO L225 Difference]: With dead ends: 1007795 [2019-09-10 06:33:02,429 INFO L226 Difference]: Without dead ends: 1007795 [2019-09-10 06:33:02,429 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:33:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007795 states. [2019-09-10 06:33:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007795 to 600610. [2019-09-10 06:33:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600610 states. [2019-09-10 06:33:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600610 states to 600610 states and 931514 transitions. [2019-09-10 06:33:22,447 INFO L78 Accepts]: Start accepts. Automaton has 600610 states and 931514 transitions. Word has length 496 [2019-09-10 06:33:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:22,448 INFO L475 AbstractCegarLoop]: Abstraction has 600610 states and 931514 transitions. [2019-09-10 06:33:22,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 600610 states and 931514 transitions. [2019-09-10 06:33:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-10 06:33:22,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:22,922 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:22,922 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -641165560, now seen corresponding path program 1 times [2019-09-10 06:33:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:22,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:22,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:24,473 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:24,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:24,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:24,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:24,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:24,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:24,475 INFO L87 Difference]: Start difference. First operand 600610 states and 931514 transitions. Second operand 4 states. [2019-09-10 06:33:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:27,576 INFO L93 Difference]: Finished difference Result 1057279 states and 1633520 transitions. [2019-09-10 06:33:27,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:27,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2019-09-10 06:33:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:28,600 INFO L225 Difference]: With dead ends: 1057279 [2019-09-10 06:33:28,601 INFO L226 Difference]: Without dead ends: 1057279 [2019-09-10 06:33:28,601 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:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057279 states. [2019-09-10 06:33:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057279 to 666643. [2019-09-10 06:33:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666643 states. [2019-09-10 06:33:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666643 states to 666643 states and 1045580 transitions. [2019-09-10 06:33:48,744 INFO L78 Accepts]: Start accepts. Automaton has 666643 states and 1045580 transitions. Word has length 497 [2019-09-10 06:33:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:48,744 INFO L475 AbstractCegarLoop]: Abstraction has 666643 states and 1045580 transitions. [2019-09-10 06:33:48,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 666643 states and 1045580 transitions. [2019-09-10 06:33:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-10 06:33:49,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:49,334 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:49,334 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash -378650643, now seen corresponding path program 1 times [2019-09-10 06:33:49,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:49,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:49,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:52,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:33:52,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:52,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:33:52,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:52,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:33:52,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:33:52,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:33:52,417 INFO L87 Difference]: Start difference. First operand 666643 states and 1045580 transitions. Second operand 17 states. [2019-09-10 06:34:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:08,689 INFO L93 Difference]: Finished difference Result 1512415 states and 2351869 transitions. [2019-09-10 06:34:08,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:34:08,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 497 [2019-09-10 06:34:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:11,468 INFO L225 Difference]: With dead ends: 1512415 [2019-09-10 06:34:11,468 INFO L226 Difference]: Without dead ends: 1512415 [2019-09-10 06:34:11,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:34:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512415 states. [2019-09-10 06:34:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512415 to 959459. [2019-09-10 06:34:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959459 states. [2019-09-10 06:34:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959459 states to 959459 states and 1487628 transitions. [2019-09-10 06:34:50,973 INFO L78 Accepts]: Start accepts. Automaton has 959459 states and 1487628 transitions. Word has length 497 [2019-09-10 06:34:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:50,974 INFO L475 AbstractCegarLoop]: Abstraction has 959459 states and 1487628 transitions. [2019-09-10 06:34:50,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:34:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 959459 states and 1487628 transitions. [2019-09-10 06:34:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-10 06:34:51,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:51,897 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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:51,897 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1768551210, now seen corresponding path program 1 times [2019-09-10 06:34:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:51,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:51,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:51,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:54,585 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:54,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:54,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:34:54,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:54,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:34:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:34:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:34:54,587 INFO L87 Difference]: Start difference. First operand 959459 states and 1487628 transitions. Second operand 4 states. [2019-09-10 06:35:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:13,188 INFO L93 Difference]: Finished difference Result 1886113 states and 2913005 transitions. [2019-09-10 06:35:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:35:13,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2019-09-10 06:35:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:15,731 INFO L225 Difference]: With dead ends: 1886113 [2019-09-10 06:35:15,731 INFO L226 Difference]: Without dead ends: 1886113 [2019-09-10 06:35:15,731 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:35:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886113 states. [2019-09-10 06:35:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886113 to 1886082. [2019-09-10 06:35:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886082 states.