java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:02:49,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:02:49,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:02:49,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:02:49,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:02:49,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:02:49,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:02:49,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:02:49,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:02:49,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:02:49,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:02:49,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:02:49,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:02:49,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:02:49,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:02:49,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:02:49,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:02:49,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:02:49,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:02:49,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:02:49,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:02:49,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:02:49,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:02:49,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:02:49,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:02:49,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:02:49,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:02:49,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:02:49,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:02:49,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:02:49,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:02:49,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:02:49,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:02:49,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:02:49,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:02:49,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:02:49,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:02:49,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:02:49,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:02:49,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:02:49,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:02:49,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:02:49,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:02:49,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:02:49,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:02:49,247 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:02:49,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:02:49,248 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:02:49,248 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:02:49,248 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:02:49,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:02:49,248 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:02:49,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:02:49,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:02:49,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:02:49,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:02:49,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:02:49,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:02:49,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:02:49,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:02:49,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:02:49,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:02:49,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:02:49,251 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:02:49,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:02:49,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:02:49,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:02:49,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:02:49,252 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:02:49,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:02:49,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:02:49,253 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:02:49,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:02:49,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:02:49,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:02:49,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:02:49,308 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:02:49,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:02:49,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2524a9f8/6f55701ddfba4098a7ff21192947f3e2/FLAGf3747b559 [2019-09-10 09:02:50,133 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:02:50,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:02:50,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2524a9f8/6f55701ddfba4098a7ff21192947f3e2/FLAGf3747b559 [2019-09-10 09:02:50,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2524a9f8/6f55701ddfba4098a7ff21192947f3e2 [2019-09-10 09:02:50,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:02:50,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:02:50,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:02:50,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:02:50,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:02:50,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:02:50" (1/1) ... [2019-09-10 09:02:50,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6587aaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:50, skipping insertion in model container [2019-09-10 09:02:50,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:02:50" (1/1) ... [2019-09-10 09:02:50,251 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:02:50,429 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:02:51,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:02:52,009 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:02:53,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:02:53,320 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:02:53,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53 WrapperNode [2019-09-10 09:02:53,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:02:53,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:02:53,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:02:53,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:02:53,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... [2019-09-10 09:02:53,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:02:53,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:02:53,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:02:53,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:02:53,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:02:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:02:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:02:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:02:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:02:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:02:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:02:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:02:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:02:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:02:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:02:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:02:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:02:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:02:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:02:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:02:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:02:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:02:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:02:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:02:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:02:58,805 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:02:58,805 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:02:58,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:02:58 BoogieIcfgContainer [2019-09-10 09:02:58,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:02:58,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:02:58,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:02:58,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:02:58,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:02:50" (1/3) ... [2019-09-10 09:02:58,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293b34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:02:58, skipping insertion in model container [2019-09-10 09:02:58,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:53" (2/3) ... [2019-09-10 09:02:58,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293b34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:02:58, skipping insertion in model container [2019-09-10 09:02:58,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:02:58" (3/3) ... [2019-09-10 09:02:58,817 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:02:58,828 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:02:58,839 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 09:02:58,857 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 09:02:58,886 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:02:58,886 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:02:58,886 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:02:58,887 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:02:58,887 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:02:58,887 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:02:58,887 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:02:58,887 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:02:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states. [2019-09-10 09:02:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-10 09:02:59,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:59,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, 1, 1, 1, 1, 1] [2019-09-10 09:02:59,004 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1482850524, now seen corresponding path program 1 times [2019-09-10 09:02:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:59,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:59,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:02,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:02,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:03:02,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:02,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:03:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:03:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:03:02,187 INFO L87 Difference]: Start difference. First operand 1484 states. Second operand 4 states. [2019-09-10 09:03:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:02,558 INFO L93 Difference]: Finished difference Result 2927 states and 5261 transitions. [2019-09-10 09:03:02,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:03:02,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 484 [2019-09-10 09:03:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:02,606 INFO L225 Difference]: With dead ends: 2927 [2019-09-10 09:03:02,607 INFO L226 Difference]: Without dead ends: 2919 [2019-09-10 09:03:02,610 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 09:03:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2019-09-10 09:03:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2865. [2019-09-10 09:03:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 09:03:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4721 transitions. [2019-09-10 09:03:02,806 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4721 transitions. Word has length 484 [2019-09-10 09:03:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:02,811 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4721 transitions. [2019-09-10 09:03:02,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:03:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4721 transitions. [2019-09-10 09:03:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-09-10 09:03:02,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:02,828 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] [2019-09-10 09:03:02,828 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1582947656, now seen corresponding path program 1 times [2019-09-10 09:03:02,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:02,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:02,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:03,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:03,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:03,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:03,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:03,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:03,545 INFO L87 Difference]: Start difference. First operand 2865 states and 4721 transitions. Second operand 3 states. [2019-09-10 09:03:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:03,765 INFO L93 Difference]: Finished difference Result 5665 states and 9303 transitions. [2019-09-10 09:03:03,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:03,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 486 [2019-09-10 09:03:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:03,794 INFO L225 Difference]: With dead ends: 5665 [2019-09-10 09:03:03,794 INFO L226 Difference]: Without dead ends: 5665 [2019-09-10 09:03:03,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2019-09-10 09:03:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5613. [2019-09-10 09:03:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-10 09:03:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 9225 transitions. [2019-09-10 09:03:03,924 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 9225 transitions. Word has length 486 [2019-09-10 09:03:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:03,925 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 9225 transitions. [2019-09-10 09:03:03,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 9225 transitions. [2019-09-10 09:03:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 09:03:03,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:03,946 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 09:03:03,946 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:03,947 INFO L82 PathProgramCache]: Analyzing trace with hash 318518103, now seen corresponding path program 1 times [2019-09-10 09:03:03,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:03,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:03,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:03,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:04,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:04,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:04,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:04,274 INFO L87 Difference]: Start difference. First operand 5613 states and 9225 transitions. Second operand 3 states. [2019-09-10 09:03:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:04,445 INFO L93 Difference]: Finished difference Result 11181 states and 18362 transitions. [2019-09-10 09:03:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:04,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-10 09:03:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:04,512 INFO L225 Difference]: With dead ends: 11181 [2019-09-10 09:03:04,513 INFO L226 Difference]: Without dead ends: 11181 [2019-09-10 09:03:04,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11181 states. [2019-09-10 09:03:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11181 to 5660. [2019-09-10 09:03:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5660 states. [2019-09-10 09:03:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5660 states to 5660 states and 9299 transitions. [2019-09-10 09:03:04,769 INFO L78 Accepts]: Start accepts. Automaton has 5660 states and 9299 transitions. Word has length 487 [2019-09-10 09:03:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:04,769 INFO L475 AbstractCegarLoop]: Abstraction has 5660 states and 9299 transitions. [2019-09-10 09:03:04,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5660 states and 9299 transitions. [2019-09-10 09:03:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 09:03:04,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:04,794 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] [2019-09-10 09:03:04,794 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1969727779, now seen corresponding path program 1 times [2019-09-10 09:03:04,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:04,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:05,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:05,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:05,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:05,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:05,525 INFO L87 Difference]: Start difference. First operand 5660 states and 9299 transitions. Second operand 3 states. [2019-09-10 09:03:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:05,735 INFO L93 Difference]: Finished difference Result 11043 states and 18051 transitions. [2019-09-10 09:03:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:05,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2019-09-10 09:03:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:05,773 INFO L225 Difference]: With dead ends: 11043 [2019-09-10 09:03:05,773 INFO L226 Difference]: Without dead ends: 11043 [2019-09-10 09:03:05,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2019-09-10 09:03:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 10993. [2019-09-10 09:03:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10993 states. [2019-09-10 09:03:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10993 states to 10993 states and 17977 transitions. [2019-09-10 09:03:06,003 INFO L78 Accepts]: Start accepts. Automaton has 10993 states and 17977 transitions. Word has length 488 [2019-09-10 09:03:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:06,004 INFO L475 AbstractCegarLoop]: Abstraction has 10993 states and 17977 transitions. [2019-09-10 09:03:06,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10993 states and 17977 transitions. [2019-09-10 09:03:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 09:03:06,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:06,033 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] [2019-09-10 09:03:06,034 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1667846312, now seen corresponding path program 1 times [2019-09-10 09:03:06,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:06,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:06,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:06,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:06,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:06,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:06,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:06,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:06,818 INFO L87 Difference]: Start difference. First operand 10993 states and 17977 transitions. Second operand 3 states. [2019-09-10 09:03:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:06,951 INFO L93 Difference]: Finished difference Result 21874 states and 35744 transitions. [2019-09-10 09:03:06,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:06,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2019-09-10 09:03:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:07,002 INFO L225 Difference]: With dead ends: 21874 [2019-09-10 09:03:07,003 INFO L226 Difference]: Without dead ends: 21874 [2019-09-10 09:03:07,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21874 states. [2019-09-10 09:03:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21874 to 11091. [2019-09-10 09:03:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11091 states. [2019-09-10 09:03:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11091 states to 11091 states and 18128 transitions. [2019-09-10 09:03:07,290 INFO L78 Accepts]: Start accepts. Automaton has 11091 states and 18128 transitions. Word has length 488 [2019-09-10 09:03:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:07,290 INFO L475 AbstractCegarLoop]: Abstraction has 11091 states and 18128 transitions. [2019-09-10 09:03:07,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11091 states and 18128 transitions. [2019-09-10 09:03:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-10 09:03:07,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:07,326 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 09:03:07,326 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1361971304, now seen corresponding path program 1 times [2019-09-10 09:03:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:07,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:07,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:07,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:07,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:07,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:07,730 INFO L87 Difference]: Start difference. First operand 11091 states and 18128 transitions. Second operand 3 states. [2019-09-10 09:03:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:07,878 INFO L93 Difference]: Finished difference Result 21991 states and 35890 transitions. [2019-09-10 09:03:07,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:07,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 489 [2019-09-10 09:03:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:07,951 INFO L225 Difference]: With dead ends: 21991 [2019-09-10 09:03:07,951 INFO L226 Difference]: Without dead ends: 21991 [2019-09-10 09:03:07,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21991 states. [2019-09-10 09:03:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21991 to 11208. [2019-09-10 09:03:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11208 states. [2019-09-10 09:03:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11208 states to 11208 states and 18274 transitions. [2019-09-10 09:03:08,307 INFO L78 Accepts]: Start accepts. Automaton has 11208 states and 18274 transitions. Word has length 489 [2019-09-10 09:03:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:08,307 INFO L475 AbstractCegarLoop]: Abstraction has 11208 states and 18274 transitions. [2019-09-10 09:03:08,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 11208 states and 18274 transitions. [2019-09-10 09:03:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 09:03:08,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:08,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:08,360 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash -27739360, now seen corresponding path program 1 times [2019-09-10 09:03:08,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:08,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:08,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:08,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:08,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:08,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:08,855 INFO L87 Difference]: Start difference. First operand 11208 states and 18274 transitions. Second operand 3 states. [2019-09-10 09:03:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:09,026 INFO L93 Difference]: Finished difference Result 14874 states and 24107 transitions. [2019-09-10 09:03:09,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:09,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 09:03:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:09,064 INFO L225 Difference]: With dead ends: 14874 [2019-09-10 09:03:09,064 INFO L226 Difference]: Without dead ends: 14874 [2019-09-10 09:03:09,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14874 states. [2019-09-10 09:03:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14874 to 12752. [2019-09-10 09:03:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-09-10 09:03:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 20834 transitions. [2019-09-10 09:03:09,315 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 20834 transitions. Word has length 490 [2019-09-10 09:03:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:09,316 INFO L475 AbstractCegarLoop]: Abstraction has 12752 states and 20834 transitions. [2019-09-10 09:03:09,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 20834 transitions. [2019-09-10 09:03:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 09:03:09,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:09,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:09,343 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1807614690, now seen corresponding path program 1 times [2019-09-10 09:03:09,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:09,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:09,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:09,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:10,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:10,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:10,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:10,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:10,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:10,037 INFO L87 Difference]: Start difference. First operand 12752 states and 20834 transitions. Second operand 3 states. [2019-09-10 09:03:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:10,304 INFO L93 Difference]: Finished difference Result 24709 states and 40193 transitions. [2019-09-10 09:03:10,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:10,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 09:03:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:10,370 INFO L225 Difference]: With dead ends: 24709 [2019-09-10 09:03:10,370 INFO L226 Difference]: Without dead ends: 24709 [2019-09-10 09:03:10,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24709 states. [2019-09-10 09:03:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24709 to 24661. [2019-09-10 09:03:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24661 states. [2019-09-10 09:03:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24661 states to 24661 states and 40123 transitions. [2019-09-10 09:03:10,912 INFO L78 Accepts]: Start accepts. Automaton has 24661 states and 40123 transitions. Word has length 490 [2019-09-10 09:03:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:10,913 INFO L475 AbstractCegarLoop]: Abstraction has 24661 states and 40123 transitions. [2019-09-10 09:03:10,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 24661 states and 40123 transitions. [2019-09-10 09:03:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 09:03:10,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:10,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:10,962 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -484300805, now seen corresponding path program 1 times [2019-09-10 09:03:10,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:10,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:10,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:11,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:11,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:03:11,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:11,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:03:11,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:03:11,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:03:11,676 INFO L87 Difference]: Start difference. First operand 24661 states and 40123 transitions. Second operand 4 states. [2019-09-10 09:03:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:11,934 INFO L93 Difference]: Finished difference Result 46701 states and 75771 transitions. [2019-09-10 09:03:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:03:11,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 490 [2019-09-10 09:03:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:12,021 INFO L225 Difference]: With dead ends: 46701 [2019-09-10 09:03:12,021 INFO L226 Difference]: Without dead ends: 46701 [2019-09-10 09:03:12,022 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 09:03:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46701 states. [2019-09-10 09:03:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46701 to 25954. [2019-09-10 09:03:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25954 states. [2019-09-10 09:03:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25954 states to 25954 states and 42402 transitions. [2019-09-10 09:03:13,351 INFO L78 Accepts]: Start accepts. Automaton has 25954 states and 42402 transitions. Word has length 490 [2019-09-10 09:03:13,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:13,352 INFO L475 AbstractCegarLoop]: Abstraction has 25954 states and 42402 transitions. [2019-09-10 09:03:13,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:03:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25954 states and 42402 transitions. [2019-09-10 09:03:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-10 09:03:13,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:13,384 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] [2019-09-10 09:03:13,384 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -560777755, now seen corresponding path program 1 times [2019-09-10 09:03:13,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:13,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:13,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:13,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:13,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:13,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:13,765 INFO L87 Difference]: Start difference. First operand 25954 states and 42402 transitions. Second operand 3 states. [2019-09-10 09:03:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:13,973 INFO L93 Difference]: Finished difference Result 34861 states and 56770 transitions. [2019-09-10 09:03:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:13,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2019-09-10 09:03:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:14,053 INFO L225 Difference]: With dead ends: 34861 [2019-09-10 09:03:14,054 INFO L226 Difference]: Without dead ends: 34861 [2019-09-10 09:03:14,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34861 states. [2019-09-10 09:03:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34861 to 31474. [2019-09-10 09:03:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31474 states. [2019-09-10 09:03:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31474 states to 31474 states and 51538 transitions. [2019-09-10 09:03:14,445 INFO L78 Accepts]: Start accepts. Automaton has 31474 states and 51538 transitions. Word has length 492 [2019-09-10 09:03:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:14,446 INFO L475 AbstractCegarLoop]: Abstraction has 31474 states and 51538 transitions. [2019-09-10 09:03:14,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 31474 states and 51538 transitions. [2019-09-10 09:03:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 09:03:14,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:14,474 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 09:03:14,474 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1153218066, now seen corresponding path program 1 times [2019-09-10 09:03:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:14,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:15,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:15,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:03:15,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:15,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:03:15,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:03:15,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:03:15,787 INFO L87 Difference]: Start difference. First operand 31474 states and 51538 transitions. Second operand 9 states. [2019-09-10 09:03:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:19,672 INFO L93 Difference]: Finished difference Result 61266 states and 98928 transitions. [2019-09-10 09:03:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 09:03:19,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 493 [2019-09-10 09:03:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:19,816 INFO L225 Difference]: With dead ends: 61266 [2019-09-10 09:03:19,816 INFO L226 Difference]: Without dead ends: 61266 [2019-09-10 09:03:19,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:03:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61266 states. [2019-09-10 09:03:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61266 to 37546. [2019-09-10 09:03:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37546 states. [2019-09-10 09:03:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37546 states to 37546 states and 60518 transitions. [2019-09-10 09:03:20,460 INFO L78 Accepts]: Start accepts. Automaton has 37546 states and 60518 transitions. Word has length 493 [2019-09-10 09:03:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:20,462 INFO L475 AbstractCegarLoop]: Abstraction has 37546 states and 60518 transitions. [2019-09-10 09:03:20,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 09:03:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 37546 states and 60518 transitions. [2019-09-10 09:03:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 09:03:20,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:20,492 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 09:03:20,492 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash 706747481, now seen corresponding path program 1 times [2019-09-10 09:03:20,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:20,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:20,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:21,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:21,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:03:21,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:21,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:03:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:03:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:03:21,589 INFO L87 Difference]: Start difference. First operand 37546 states and 60518 transitions. Second operand 4 states. [2019-09-10 09:03:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:21,983 INFO L93 Difference]: Finished difference Result 73227 states and 117623 transitions. [2019-09-10 09:03:21,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:03:21,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-10 09:03:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:22,126 INFO L225 Difference]: With dead ends: 73227 [2019-09-10 09:03:22,126 INFO L226 Difference]: Without dead ends: 73227 [2019-09-10 09:03:22,127 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 09:03:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73227 states. [2019-09-10 09:03:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73227 to 73184. [2019-09-10 09:03:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73184 states. [2019-09-10 09:03:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73184 states to 73184 states and 117560 transitions. [2019-09-10 09:03:23,103 INFO L78 Accepts]: Start accepts. Automaton has 73184 states and 117560 transitions. Word has length 493 [2019-09-10 09:03:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:23,104 INFO L475 AbstractCegarLoop]: Abstraction has 73184 states and 117560 transitions. [2019-09-10 09:03:23,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:03:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 73184 states and 117560 transitions. [2019-09-10 09:03:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-10 09:03:23,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:23,153 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] [2019-09-10 09:03:23,153 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash -852505819, now seen corresponding path program 1 times [2019-09-10 09:03:23,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:23,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:23,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:23,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:23,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:23,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:23,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:23,685 INFO L87 Difference]: Start difference. First operand 73184 states and 117560 transitions. Second operand 3 states. [2019-09-10 09:03:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:25,821 INFO L93 Difference]: Finished difference Result 143055 states and 229036 transitions. [2019-09-10 09:03:25,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:25,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-10 09:03:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:25,943 INFO L225 Difference]: With dead ends: 143055 [2019-09-10 09:03:25,943 INFO L226 Difference]: Without dead ends: 143055 [2019-09-10 09:03:25,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143055 states. [2019-09-10 09:03:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143055 to 143014. [2019-09-10 09:03:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143014 states. [2019-09-10 09:03:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143014 states to 143014 states and 228977 transitions. [2019-09-10 09:03:27,246 INFO L78 Accepts]: Start accepts. Automaton has 143014 states and 228977 transitions. Word has length 495 [2019-09-10 09:03:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:27,246 INFO L475 AbstractCegarLoop]: Abstraction has 143014 states and 228977 transitions. [2019-09-10 09:03:27,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 143014 states and 228977 transitions. [2019-09-10 09:03:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-10 09:03:27,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:27,322 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] [2019-09-10 09:03:27,322 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash -661080985, now seen corresponding path program 1 times [2019-09-10 09:03:27,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:27,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:28,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:28,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:28,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:28,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:28,247 INFO L87 Difference]: Start difference. First operand 143014 states and 228977 transitions. Second operand 3 states. [2019-09-10 09:03:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:28,824 INFO L93 Difference]: Finished difference Result 275834 states and 439461 transitions. [2019-09-10 09:03:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:28,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-10 09:03:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:29,135 INFO L225 Difference]: With dead ends: 275834 [2019-09-10 09:03:29,135 INFO L226 Difference]: Without dead ends: 275834 [2019-09-10 09:03:29,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275834 states. [2019-09-10 09:03:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275834 to 144776. [2019-09-10 09:03:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144776 states. [2019-09-10 09:03:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144776 states to 144776 states and 231635 transitions. [2019-09-10 09:03:34,383 INFO L78 Accepts]: Start accepts. Automaton has 144776 states and 231635 transitions. Word has length 495 [2019-09-10 09:03:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:34,383 INFO L475 AbstractCegarLoop]: Abstraction has 144776 states and 231635 transitions. [2019-09-10 09:03:34,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 144776 states and 231635 transitions. [2019-09-10 09:03:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:03:34,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:34,454 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 09:03:34,455 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1789173245, now seen corresponding path program 1 times [2019-09-10 09:03:34,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:34,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:34,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:34,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:34,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:34,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:34,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:34,782 INFO L87 Difference]: Start difference. First operand 144776 states and 231635 transitions. Second operand 3 states. [2019-09-10 09:03:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:35,492 INFO L93 Difference]: Finished difference Result 213315 states and 340967 transitions. [2019-09-10 09:03:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:35,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 09:03:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:35,786 INFO L225 Difference]: With dead ends: 213315 [2019-09-10 09:03:35,786 INFO L226 Difference]: Without dead ends: 213315 [2019-09-10 09:03:35,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213315 states. [2019-09-10 09:03:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213315 to 196360. [2019-09-10 09:03:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196360 states. [2019-09-10 09:03:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196360 states to 196360 states and 314691 transitions. [2019-09-10 09:03:38,810 INFO L78 Accepts]: Start accepts. Automaton has 196360 states and 314691 transitions. Word has length 496 [2019-09-10 09:03:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:38,810 INFO L475 AbstractCegarLoop]: Abstraction has 196360 states and 314691 transitions. [2019-09-10 09:03:38,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 196360 states and 314691 transitions. [2019-09-10 09:03:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:03:38,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:38,898 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 09:03:38,898 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1067056945, now seen corresponding path program 1 times [2019-09-10 09:03:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:38,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:38,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:43,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:43,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:43,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:43,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:43,114 INFO L87 Difference]: Start difference. First operand 196360 states and 314691 transitions. Second operand 3 states. [2019-09-10 09:03:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:43,853 INFO L93 Difference]: Finished difference Result 381424 states and 608986 transitions. [2019-09-10 09:03:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:43,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 09:03:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:44,232 INFO L225 Difference]: With dead ends: 381424 [2019-09-10 09:03:44,232 INFO L226 Difference]: Without dead ends: 381424 [2019-09-10 09:03:44,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381424 states. [2019-09-10 09:03:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381424 to 198910. [2019-09-10 09:03:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198910 states. [2019-09-10 09:03:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198910 states to 198910 states and 318360 transitions. [2019-09-10 09:03:47,243 INFO L78 Accepts]: Start accepts. Automaton has 198910 states and 318360 transitions. Word has length 496 [2019-09-10 09:03:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:47,243 INFO L475 AbstractCegarLoop]: Abstraction has 198910 states and 318360 transitions. [2019-09-10 09:03:47,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 198910 states and 318360 transitions. [2019-09-10 09:03:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-10 09:03:47,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:47,318 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 09:03:47,318 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1294873546, now seen corresponding path program 1 times [2019-09-10 09:03:47,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:47,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:47,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:47,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:47,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:47,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:47,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:47,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:47,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:47,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:47,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:47,821 INFO L87 Difference]: Start difference. First operand 198910 states and 318360 transitions. Second operand 3 states. [2019-09-10 09:03:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:49,671 INFO L93 Difference]: Finished difference Result 392491 states and 626015 transitions. [2019-09-10 09:03:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:49,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-09-10 09:03:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:50,087 INFO L225 Difference]: With dead ends: 392491 [2019-09-10 09:03:50,087 INFO L226 Difference]: Without dead ends: 392491 [2019-09-10 09:03:50,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392491 states. [2019-09-10 09:03:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392491 to 392452. [2019-09-10 09:03:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392452 states. [2019-09-10 09:03:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392452 states to 392452 states and 625960 transitions. [2019-09-10 09:03:58,163 INFO L78 Accepts]: Start accepts. Automaton has 392452 states and 625960 transitions. Word has length 497 [2019-09-10 09:03:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:58,164 INFO L475 AbstractCegarLoop]: Abstraction has 392452 states and 625960 transitions. [2019-09-10 09:03:58,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 392452 states and 625960 transitions. [2019-09-10 09:03:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:03:59,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:59,404 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, 1, 1] [2019-09-10 09:03:59,404 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 995358799, now seen corresponding path program 1 times [2019-09-10 09:03:59,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:59,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:59,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:59,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:59,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:59,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:59,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:59,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:59,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:59,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:59,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:59,907 INFO L87 Difference]: Start difference. First operand 392452 states and 625960 transitions. Second operand 3 states. [2019-09-10 09:04:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:08,228 INFO L93 Difference]: Finished difference Result 770922 states and 1224658 transitions. [2019-09-10 09:04:08,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:08,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 09:04:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:09,194 INFO L225 Difference]: With dead ends: 770922 [2019-09-10 09:04:09,195 INFO L226 Difference]: Without dead ends: 770922 [2019-09-10 09:04:09,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770922 states. [2019-09-10 09:04:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770922 to 770885. [2019-09-10 09:04:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770885 states. [2019-09-10 09:04:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770885 states to 770885 states and 1224607 transitions. [2019-09-10 09:04:27,361 INFO L78 Accepts]: Start accepts. Automaton has 770885 states and 1224607 transitions. Word has length 499 [2019-09-10 09:04:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:27,361 INFO L475 AbstractCegarLoop]: Abstraction has 770885 states and 1224607 transitions. [2019-09-10 09:04:27,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 770885 states and 1224607 transitions. [2019-09-10 09:04:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:04:27,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:27,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:04:27,688 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash 255085266, now seen corresponding path program 1 times [2019-09-10 09:04:27,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:27,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:27,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:04:30,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:30,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:30,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:30,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:30,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:30,288 INFO L87 Difference]: Start difference. First operand 770885 states and 1224607 transitions. Second operand 4 states. [2019-09-10 09:04:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:44,558 INFO L93 Difference]: Finished difference Result 1453874 states and 2304700 transitions. [2019-09-10 09:04:44,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:44,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-09-10 09:04:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:46,321 INFO L225 Difference]: With dead ends: 1453874 [2019-09-10 09:04:46,322 INFO L226 Difference]: Without dead ends: 1453874 [2019-09-10 09:04:46,322 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 09:04:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453874 states. [2019-09-10 09:05:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453874 to 785583. [2019-09-10 09:05:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785583 states. [2019-09-10 09:05:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785583 states to 785583 states and 1250608 transitions. [2019-09-10 09:05:18,348 INFO L78 Accepts]: Start accepts. Automaton has 785583 states and 1250608 transitions. Word has length 499 [2019-09-10 09:05:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:18,348 INFO L475 AbstractCegarLoop]: Abstraction has 785583 states and 1250608 transitions. [2019-09-10 09:05:18,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:05:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 785583 states and 1250608 transitions. [2019-09-10 09:05:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-10 09:05:18,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:18,686 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, 1, 1, 1, 1] [2019-09-10 09:05:18,687 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1053902861, now seen corresponding path program 1 times [2019-09-10 09:05:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:18,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:18,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:05:20,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:20,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:20,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:20,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:20,685 INFO L87 Difference]: Start difference. First operand 785583 states and 1250608 transitions. Second operand 3 states. [2019-09-10 09:05:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:24,555 INFO L93 Difference]: Finished difference Result 1259537 states and 2009329 transitions. [2019-09-10 09:05:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:24,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-09-10 09:05:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:27,809 INFO L225 Difference]: With dead ends: 1259537 [2019-09-10 09:05:27,809 INFO L226 Difference]: Without dead ends: 1259537 [2019-09-10 09:05:27,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259537 states. [2019-09-10 09:05:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259537 to 1151023. [2019-09-10 09:05:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151023 states. [2019-09-10 09:06:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151023 states to 1151023 states and 1848880 transitions. [2019-09-10 09:06:09,047 INFO L78 Accepts]: Start accepts. Automaton has 1151023 states and 1848880 transitions. Word has length 501 [2019-09-10 09:06:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:09,047 INFO L475 AbstractCegarLoop]: Abstraction has 1151023 states and 1848880 transitions. [2019-09-10 09:06:09,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1151023 states and 1848880 transitions. [2019-09-10 09:06:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:06:12,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:12,222 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, 1, 1, 1, 1, 1] [2019-09-10 09:06:12,222 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1806254769, now seen corresponding path program 1 times [2019-09-10 09:06:12,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:12,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:06:13,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:13,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:06:13,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:13,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:06:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:06:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:06:13,170 INFO L87 Difference]: Start difference. First operand 1151023 states and 1848880 transitions. Second operand 9 states. [2019-09-10 09:06:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:46,336 INFO L93 Difference]: Finished difference Result 2704806 states and 4300426 transitions. [2019-09-10 09:06:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 09:06:46,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 502 [2019-09-10 09:06:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:51,504 INFO L225 Difference]: With dead ends: 2704806 [2019-09-10 09:06:51,504 INFO L226 Difference]: Without dead ends: 2704806 [2019-09-10 09:06:51,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:06:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704806 states.