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+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:02:05,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:02:05,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:02:05,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:02:05,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:02:05,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:02:05,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:02:05,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:02:05,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:02:05,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:02:05,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:02:05,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:02:05,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:02:05,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:02:05,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:02:05,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:02:05,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:02:05,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:02:05,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:02:05,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:02:05,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:02:05,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:02:05,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:02:05,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:02:05,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:02:05,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:02:05,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:02:05,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:02:05,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:02:05,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:02:05,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:02:05,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:02:05,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:02:05,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:02:05,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:02:05,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:02:05,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:02:05,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:02:05,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:02:05,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:02:05,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:02:05,119 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:05,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:02:05,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:02:05,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:02:05,150 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:02:05,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:02:05,151 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:02:05,151 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:02:05,151 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:02:05,151 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:02:05,151 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:02:05,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:02:05,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:02:05,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:02:05,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:02:05,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:02:05,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:02:05,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:02:05,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:02:05,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:02:05,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:02:05,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:02:05,157 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:02:05,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:02:05,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:02:05,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:02:05,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:02:05,158 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:02:05,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:02:05,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:02:05,159 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:02:05,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:02:05,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:02:05,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:02:05,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:02:05,240 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:02:05,241 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+cfa-reducer.c [2019-09-10 09:02:05,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c314bd91f/b2a62da2826546e69800929aa58c04ef/FLAG9eae696fb [2019-09-10 09:02:05,963 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:02:05,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:02:05,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c314bd91f/b2a62da2826546e69800929aa58c04ef/FLAG9eae696fb [2019-09-10 09:02:06,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c314bd91f/b2a62da2826546e69800929aa58c04ef [2019-09-10 09:02:06,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:02:06,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:02:06,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:02:06,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:02:06,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:02:06,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:02:06" (1/1) ... [2019-09-10 09:02:06,156 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:06, skipping insertion in model container [2019-09-10 09:02:06,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:02:06" (1/1) ... [2019-09-10 09:02:06,164 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:02:06,263 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:02:06,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:02:06,981 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:02:07,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:02:07,311 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:02:07,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:07 WrapperNode [2019-09-10 09:02:07,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:02:07,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:02:07,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:02:07,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:02:07,328 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:07" (1/1) ... [2019-09-10 09:02:07,328 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:07" (1/1) ... [2019-09-10 09:02:07,352 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:07" (1/1) ... [2019-09-10 09:02:07,353 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:07" (1/1) ... [2019-09-10 09:02:07,411 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:07" (1/1) ... [2019-09-10 09:02:07,454 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:07" (1/1) ... [2019-09-10 09:02:07,471 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:07" (1/1) ... [2019-09-10 09:02:07,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:02:07,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:02:07,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:02:07,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:02:07,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:07" (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:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:02:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:02:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:02:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:02:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:02:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:02:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:02:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:02:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:02:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:02:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:02:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:02:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:02:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:02:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:02:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:02:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:02:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:02:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:02:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:02:10,388 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:02:10,389 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:02:10,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:02:10 BoogieIcfgContainer [2019-09-10 09:02:10,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:02:10,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:02:10,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:02:10,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:02:10,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:02:06" (1/3) ... [2019-09-10 09:02:10,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484eaebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:02:10, skipping insertion in model container [2019-09-10 09:02:10,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:02:07" (2/3) ... [2019-09-10 09:02:10,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484eaebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:02:10, skipping insertion in model container [2019-09-10 09:02:10,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:02:10" (3/3) ... [2019-09-10 09:02:10,402 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 09:02:10,413 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:02:10,432 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:02:10,449 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:02:10,473 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:02:10,473 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:02:10,473 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:02:10,474 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:02:10,474 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:02:10,474 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:02:10,474 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:02:10,474 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:02:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-10 09:02:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 09:02:10,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:10,541 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] [2019-09-10 09:02:10,543 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1832108402, now seen corresponding path program 1 times [2019-09-10 09:02:10,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:10,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:02:11,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:11,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:11,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:11,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:11,340 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2019-09-10 09:02:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:11,567 INFO L93 Difference]: Finished difference Result 984 states and 1761 transitions. [2019-09-10 09:02:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:11,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 09:02:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:11,604 INFO L225 Difference]: With dead ends: 984 [2019-09-10 09:02:11,605 INFO L226 Difference]: Without dead ends: 976 [2019-09-10 09:02:11,608 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:02:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-10 09:02:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-09-10 09:02:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-10 09:02:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1686 transitions. [2019-09-10 09:02:11,786 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1686 transitions. Word has length 217 [2019-09-10 09:02:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:11,791 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1686 transitions. [2019-09-10 09:02:11,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1686 transitions. [2019-09-10 09:02:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 09:02:11,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:11,802 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] [2019-09-10 09:02:11,802 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 475136375, now seen corresponding path program 1 times [2019-09-10 09:02:11,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:11,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:11,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:12,122 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:02:12,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:12,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:12,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:12,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:12,126 INFO L87 Difference]: Start difference. First operand 974 states and 1686 transitions. Second operand 3 states. [2019-09-10 09:02:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:12,176 INFO L93 Difference]: Finished difference Result 1372 states and 2354 transitions. [2019-09-10 09:02:12,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:12,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-10 09:02:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:12,188 INFO L225 Difference]: With dead ends: 1372 [2019-09-10 09:02:12,189 INFO L226 Difference]: Without dead ends: 1372 [2019-09-10 09:02:12,190 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:02:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-10 09:02:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2019-09-10 09:02:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-10 09:02:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2353 transitions. [2019-09-10 09:02:12,244 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2353 transitions. Word has length 221 [2019-09-10 09:02:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:12,245 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2353 transitions. [2019-09-10 09:02:12,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2353 transitions. [2019-09-10 09:02:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 09:02:12,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:12,255 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] [2019-09-10 09:02:12,255 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash 172719100, now seen corresponding path program 1 times [2019-09-10 09:02:12,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:12,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:12,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:12,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:12,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:02:12,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:12,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:12,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:12,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:12,577 INFO L87 Difference]: Start difference. First operand 1370 states and 2353 transitions. Second operand 3 states. [2019-09-10 09:02:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:12,649 INFO L93 Difference]: Finished difference Result 2140 states and 3642 transitions. [2019-09-10 09:02:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:12,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 09:02:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:12,667 INFO L225 Difference]: With dead ends: 2140 [2019-09-10 09:02:12,668 INFO L226 Difference]: Without dead ends: 2140 [2019-09-10 09:02:12,668 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:02:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-09-10 09:02:12,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-09-10 09:02:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-09-10 09:02:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3641 transitions. [2019-09-10 09:02:12,744 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3641 transitions. Word has length 225 [2019-09-10 09:02:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:12,745 INFO L475 AbstractCegarLoop]: Abstraction has 2138 states and 3641 transitions. [2019-09-10 09:02:12,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3641 transitions. [2019-09-10 09:02:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 09:02:12,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:12,755 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] [2019-09-10 09:02:12,755 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:12,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 300878849, now seen corresponding path program 1 times [2019-09-10 09:02:12,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:12,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:12,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:13,170 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:02:13,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:13,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:13,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:13,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:13,173 INFO L87 Difference]: Start difference. First operand 2138 states and 3641 transitions. Second operand 3 states. [2019-09-10 09:02:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:13,243 INFO L93 Difference]: Finished difference Result 3628 states and 6126 transitions. [2019-09-10 09:02:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:13,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 09:02:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:13,263 INFO L225 Difference]: With dead ends: 3628 [2019-09-10 09:02:13,263 INFO L226 Difference]: Without dead ends: 3628 [2019-09-10 09:02:13,264 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:02:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-10 09:02:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3626. [2019-09-10 09:02:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3626 states. [2019-09-10 09:02:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 6125 transitions. [2019-09-10 09:02:13,368 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 6125 transitions. Word has length 229 [2019-09-10 09:02:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:13,369 INFO L475 AbstractCegarLoop]: Abstraction has 3626 states and 6125 transitions. [2019-09-10 09:02:13,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 6125 transitions. [2019-09-10 09:02:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 09:02:13,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:13,377 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] [2019-09-10 09:02:13,377 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash 7408774, now seen corresponding path program 1 times [2019-09-10 09:02:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:13,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:13,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:13,708 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:02:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:13,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:13,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:13,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:13,710 INFO L87 Difference]: Start difference. First operand 3626 states and 6125 transitions. Second operand 3 states. [2019-09-10 09:02:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:13,801 INFO L93 Difference]: Finished difference Result 6508 states and 10910 transitions. [2019-09-10 09:02:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:13,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 09:02:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:13,836 INFO L225 Difference]: With dead ends: 6508 [2019-09-10 09:02:13,837 INFO L226 Difference]: Without dead ends: 6508 [2019-09-10 09:02:13,837 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:02:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2019-09-10 09:02:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2019-09-10 09:02:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-10 09:02:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10909 transitions. [2019-09-10 09:02:14,002 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10909 transitions. Word has length 233 [2019-09-10 09:02:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:14,003 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 10909 transitions. [2019-09-10 09:02:14,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10909 transitions. [2019-09-10 09:02:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 09:02:14,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:14,011 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] [2019-09-10 09:02:14,011 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1561634677, now seen corresponding path program 1 times [2019-09-10 09:02:14,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:14,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:14,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:14,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:14,514 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:02:14,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:14,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:02:14,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:14,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:02:14,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:02:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:02:14,517 INFO L87 Difference]: Start difference. First operand 6506 states and 10909 transitions. Second operand 7 states. [2019-09-10 09:02:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:15,638 INFO L93 Difference]: Finished difference Result 33759 states and 56628 transitions. [2019-09-10 09:02:15,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:02:15,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-10 09:02:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:15,888 INFO L225 Difference]: With dead ends: 33759 [2019-09-10 09:02:15,888 INFO L226 Difference]: Without dead ends: 33759 [2019-09-10 09:02:15,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:02:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33759 states. [2019-09-10 09:02:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33759 to 12303. [2019-09-10 09:02:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-10 09:02:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 20548 transitions. [2019-09-10 09:02:16,501 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 20548 transitions. Word has length 237 [2019-09-10 09:02:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:16,503 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 20548 transitions. [2019-09-10 09:02:16,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:02:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 20548 transitions. [2019-09-10 09:02:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 09:02:16,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:16,519 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] [2019-09-10 09:02:16,519 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1236760728, now seen corresponding path program 1 times [2019-09-10 09:02:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:16,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:16,752 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:02:16,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:16,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:16,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:16,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:16,756 INFO L87 Difference]: Start difference. First operand 12303 states and 20548 transitions. Second operand 4 states. [2019-09-10 09:02:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:16,952 INFO L93 Difference]: Finished difference Result 21233 states and 35544 transitions. [2019-09-10 09:02:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:16,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 09:02:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:17,002 INFO L225 Difference]: With dead ends: 21233 [2019-09-10 09:02:17,002 INFO L226 Difference]: Without dead ends: 21233 [2019-09-10 09:02:17,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:02:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-09-10 09:02:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18279. [2019-09-10 09:02:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-09-10 09:02:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 30544 transitions. [2019-09-10 09:02:17,490 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 30544 transitions. Word has length 238 [2019-09-10 09:02:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:17,491 INFO L475 AbstractCegarLoop]: Abstraction has 18279 states and 30544 transitions. [2019-09-10 09:02:17,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:02:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 30544 transitions. [2019-09-10 09:02:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:02:17,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:17,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:17,506 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1598097195, now seen corresponding path program 1 times [2019-09-10 09:02:17,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:17,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:17,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:17,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:02:17,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:17,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:17,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:17,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:17,740 INFO L87 Difference]: Start difference. First operand 18279 states and 30544 transitions. Second operand 3 states. [2019-09-10 09:02:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:17,861 INFO L93 Difference]: Finished difference Result 28072 states and 46878 transitions. [2019-09-10 09:02:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:17,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:02:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:17,927 INFO L225 Difference]: With dead ends: 28072 [2019-09-10 09:02:17,928 INFO L226 Difference]: Without dead ends: 28072 [2019-09-10 09:02:17,928 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:02:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28072 states. [2019-09-10 09:02:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28072 to 28070. [2019-09-10 09:02:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28070 states. [2019-09-10 09:02:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28070 states to 28070 states and 46877 transitions. [2019-09-10 09:02:19,297 INFO L78 Accepts]: Start accepts. Automaton has 28070 states and 46877 transitions. Word has length 239 [2019-09-10 09:02:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:19,298 INFO L475 AbstractCegarLoop]: Abstraction has 28070 states and 46877 transitions. [2019-09-10 09:02:19,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28070 states and 46877 transitions. [2019-09-10 09:02:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:02:19,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:19,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:19,305 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1621339669, now seen corresponding path program 1 times [2019-09-10 09:02:19,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:19,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:19,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:19,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:19,498 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:02:19,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:19,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:19,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:19,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:19,500 INFO L87 Difference]: Start difference. First operand 28070 states and 46877 transitions. Second operand 3 states. [2019-09-10 09:02:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:19,650 INFO L93 Difference]: Finished difference Result 39524 states and 65882 transitions. [2019-09-10 09:02:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:19,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:02:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:19,720 INFO L225 Difference]: With dead ends: 39524 [2019-09-10 09:02:19,720 INFO L226 Difference]: Without dead ends: 39524 [2019-09-10 09:02:19,721 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:02:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39524 states. [2019-09-10 09:02:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39524 to 39522. [2019-09-10 09:02:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-09-10 09:02:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 65881 transitions. [2019-09-10 09:02:20,564 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 65881 transitions. Word has length 239 [2019-09-10 09:02:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:20,565 INFO L475 AbstractCegarLoop]: Abstraction has 39522 states and 65881 transitions. [2019-09-10 09:02:20,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 65881 transitions. [2019-09-10 09:02:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:02:20,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:20,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:20,571 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash -839265151, now seen corresponding path program 1 times [2019-09-10 09:02:20,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:20,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:20,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:20,774 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:02:20,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:20,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:20,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:20,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:20,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:20,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:20,776 INFO L87 Difference]: Start difference. First operand 39522 states and 65881 transitions. Second operand 3 states. [2019-09-10 09:02:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:20,984 INFO L93 Difference]: Finished difference Result 55408 states and 92186 transitions. [2019-09-10 09:02:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:20,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:02:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:21,083 INFO L225 Difference]: With dead ends: 55408 [2019-09-10 09:02:21,083 INFO L226 Difference]: Without dead ends: 55408 [2019-09-10 09:02:21,084 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:02:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55408 states. [2019-09-10 09:02:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55408 to 55406. [2019-09-10 09:02:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55406 states. [2019-09-10 09:02:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55406 states to 55406 states and 92185 transitions. [2019-09-10 09:02:21,905 INFO L78 Accepts]: Start accepts. Automaton has 55406 states and 92185 transitions. Word has length 239 [2019-09-10 09:02:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:21,906 INFO L475 AbstractCegarLoop]: Abstraction has 55406 states and 92185 transitions. [2019-09-10 09:02:21,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 55406 states and 92185 transitions. [2019-09-10 09:02:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:02:21,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:21,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:21,912 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1472495767, now seen corresponding path program 1 times [2019-09-10 09:02:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:21,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:21,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:21,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:23,305 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:02:23,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:23,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:23,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:23,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:23,307 INFO L87 Difference]: Start difference. First operand 55406 states and 92185 transitions. Second operand 3 states. [2019-09-10 09:02:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:23,567 INFO L93 Difference]: Finished difference Result 77300 states and 128350 transitions. [2019-09-10 09:02:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:23,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:02:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:23,672 INFO L225 Difference]: With dead ends: 77300 [2019-09-10 09:02:23,672 INFO L226 Difference]: Without dead ends: 77300 [2019-09-10 09:02:23,674 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:02:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77300 states. [2019-09-10 09:02:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77300 to 77298. [2019-09-10 09:02:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77298 states. [2019-09-10 09:02:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 128349 transitions. [2019-09-10 09:02:24,782 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 128349 transitions. Word has length 239 [2019-09-10 09:02:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:24,783 INFO L475 AbstractCegarLoop]: Abstraction has 77298 states and 128349 transitions. [2019-09-10 09:02:24,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 128349 transitions. [2019-09-10 09:02:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:02:24,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:24,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:24,789 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 141121069, now seen corresponding path program 1 times [2019-09-10 09:02:24,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:24,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:24,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:24,989 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:02:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:24,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:24,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:24,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:24,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:24,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:24,992 INFO L87 Difference]: Start difference. First operand 77298 states and 128349 transitions. Second operand 3 states. [2019-09-10 09:02:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:25,375 INFO L93 Difference]: Finished difference Result 107244 states and 177669 transitions. [2019-09-10 09:02:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:25,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 09:02:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:25,521 INFO L225 Difference]: With dead ends: 107244 [2019-09-10 09:02:25,521 INFO L226 Difference]: Without dead ends: 107244 [2019-09-10 09:02:25,522 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:02:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107244 states. [2019-09-10 09:02:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107244 to 107242. [2019-09-10 09:02:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-10 09:02:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 177668 transitions. [2019-09-10 09:02:28,911 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 177668 transitions. Word has length 239 [2019-09-10 09:02:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:28,911 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 177668 transitions. [2019-09-10 09:02:28,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 177668 transitions. [2019-09-10 09:02:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:02:28,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:28,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:28,916 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:28,916 INFO L82 PathProgramCache]: Analyzing trace with hash 248955122, now seen corresponding path program 1 times [2019-09-10 09:02:28,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:28,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:28,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:28,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:28,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:29,119 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:02:29,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:29,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:29,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:29,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:29,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:29,121 INFO L87 Difference]: Start difference. First operand 107242 states and 177668 transitions. Second operand 4 states. [2019-09-10 09:02:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:29,816 INFO L93 Difference]: Finished difference Result 210652 states and 348835 transitions. [2019-09-10 09:02:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:29,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 09:02:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:30,251 INFO L225 Difference]: With dead ends: 210652 [2019-09-10 09:02:30,252 INFO L226 Difference]: Without dead ends: 210652 [2019-09-10 09:02:30,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:02:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210652 states. [2019-09-10 09:02:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210652 to 176201. [2019-09-10 09:02:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176201 states. [2019-09-10 09:02:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176201 states to 176201 states and 291287 transitions. [2019-09-10 09:02:37,362 INFO L78 Accepts]: Start accepts. Automaton has 176201 states and 291287 transitions. Word has length 239 [2019-09-10 09:02:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:37,365 INFO L475 AbstractCegarLoop]: Abstraction has 176201 states and 291287 transitions. [2019-09-10 09:02:37,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:02:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 176201 states and 291287 transitions. [2019-09-10 09:02:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 09:02:37,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:37,370 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] [2019-09-10 09:02:37,370 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -933935761, now seen corresponding path program 1 times [2019-09-10 09:02:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:37,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:37,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:37,707 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:02:37,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:37,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:37,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:37,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:37,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:37,709 INFO L87 Difference]: Start difference. First operand 176201 states and 291287 transitions. Second operand 4 states. [2019-09-10 09:02:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:38,642 INFO L93 Difference]: Finished difference Result 347397 states and 574048 transitions. [2019-09-10 09:02:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:38,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 09:02:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:39,183 INFO L225 Difference]: With dead ends: 347397 [2019-09-10 09:02:39,184 INFO L226 Difference]: Without dead ends: 347397 [2019-09-10 09:02:39,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347397 states. [2019-09-10 09:02:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347397 to 289052. [2019-09-10 09:02:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289052 states. [2019-09-10 09:02:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289052 states to 289052 states and 476834 transitions. [2019-09-10 09:02:47,725 INFO L78 Accepts]: Start accepts. Automaton has 289052 states and 476834 transitions. Word has length 240 [2019-09-10 09:02:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:47,726 INFO L475 AbstractCegarLoop]: Abstraction has 289052 states and 476834 transitions. [2019-09-10 09:02:47,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:02:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 289052 states and 476834 transitions. [2019-09-10 09:02:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:02:47,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:47,729 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] [2019-09-10 09:02:47,729 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:47,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1055710553, now seen corresponding path program 1 times [2019-09-10 09:02:47,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:47,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:47,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:47,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:47,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:47,935 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:02:47,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:47,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:47,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:47,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:47,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:47,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:47,937 INFO L87 Difference]: Start difference. First operand 289052 states and 476834 transitions. Second operand 4 states. [2019-09-10 09:02:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:49,275 INFO L93 Difference]: Finished difference Result 561498 states and 926029 transitions. [2019-09-10 09:02:49,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:49,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-10 09:02:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:55,946 INFO L225 Difference]: With dead ends: 561498 [2019-09-10 09:02:55,946 INFO L226 Difference]: Without dead ends: 561498 [2019-09-10 09:02:55,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:02:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561498 states. [2019-09-10 09:03:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561498 to 472375. [2019-09-10 09:03:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472375 states. [2019-09-10 09:03:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472375 states to 472375 states and 777625 transitions. [2019-09-10 09:03:01,369 INFO L78 Accepts]: Start accepts. Automaton has 472375 states and 777625 transitions. Word has length 241 [2019-09-10 09:03:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:01,369 INFO L475 AbstractCegarLoop]: Abstraction has 472375 states and 777625 transitions. [2019-09-10 09:03:01,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:03:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 472375 states and 777625 transitions. [2019-09-10 09:03:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 09:03:01,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:01,371 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] [2019-09-10 09:03:01,371 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1685205130, now seen corresponding path program 1 times [2019-09-10 09:03:01,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:01,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:01,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:01,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:01,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:01,669 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:01,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:01,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:03:01,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:01,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:03:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:03:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:03:01,671 INFO L87 Difference]: Start difference. First operand 472375 states and 777625 transitions. Second operand 8 states. [2019-09-10 09:03:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:15,086 INFO L93 Difference]: Finished difference Result 2141251 states and 3523685 transitions. [2019-09-10 09:03:15,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 09:03:15,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-10 09:03:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:29,488 INFO L225 Difference]: With dead ends: 2141251 [2019-09-10 09:03:29,488 INFO L226 Difference]: Without dead ends: 2141251 [2019-09-10 09:03:29,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 09:03:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141251 states. [2019-09-10 09:04:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141251 to 1298082. [2019-09-10 09:04:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states. [2019-09-10 09:04:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298082 states to 1298082 states and 2128136 transitions. [2019-09-10 09:04:31,790 INFO L78 Accepts]: Start accepts. Automaton has 1298082 states and 2128136 transitions. Word has length 242 [2019-09-10 09:04:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:31,790 INFO L475 AbstractCegarLoop]: Abstraction has 1298082 states and 2128136 transitions. [2019-09-10 09:04:31,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:04:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1298082 states and 2128136 transitions. [2019-09-10 09:04:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 09:04:31,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:31,793 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] [2019-09-10 09:04:31,793 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1769078554, now seen corresponding path program 1 times [2019-09-10 09:04:31,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:31,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:31,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:32,396 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:32,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:32,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:04:32,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:32,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:04:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:04:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:04:32,398 INFO L87 Difference]: Start difference. First operand 1298082 states and 2128136 transitions. Second operand 7 states. [2019-09-10 09:04:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:52,252 INFO L93 Difference]: Finished difference Result 1842686 states and 3023033 transitions. [2019-09-10 09:04:52,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:04:52,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-09-10 09:04:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:56,225 INFO L225 Difference]: With dead ends: 1842686 [2019-09-10 09:04:56,225 INFO L226 Difference]: Without dead ends: 1842686 [2019-09-10 09:04:56,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:04:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842686 states. [2019-09-10 09:05:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842686 to 1298082. [2019-09-10 09:05:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states.