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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:00:30,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:00:30,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:00:30,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:00:30,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:00:30,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:00:30,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:00:30,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:00:30,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:00:30,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:00:30,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:00:30,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:00:30,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:00:30,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:00:30,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:00:30,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:00:30,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:00:30,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:00:30,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:00:30,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:00:30,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:00:30,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:00:30,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:00:30,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:00:30,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:00:30,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:00:30,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:00:30,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:00:30,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:00:30,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:00:30,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:00:30,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:00:30,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:00:30,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:00:30,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:00:30,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:00:30,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:00:30,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:00:30,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:00:30,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:00:30,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:00:30,219 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:00:30,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:00:30,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:00:30,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:00:30,245 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:00:30,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:00:30,246 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:00:30,247 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:00:30,247 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:00:30,247 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:00:30,247 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:00:30,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:00:30,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:00:30,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:00:30,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:00:30,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:00:30,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:00:30,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:00:30,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:00:30,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:00:30,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:00:30,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:00:30,253 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:00:30,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:00:30,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:00:30,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:00:30,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:00:30,254 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:00:30,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:00:30,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:00:30,254 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:00:30,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:00:30,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:00:30,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:00:30,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:00:30,327 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:00:30,328 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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 09:00:30,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82cb99357/980149a0cb2c4c67ae04235d931ad407/FLAG2179fbfa3 [2019-09-10 09:00:31,131 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:00:31,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 09:00:31,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82cb99357/980149a0cb2c4c67ae04235d931ad407/FLAG2179fbfa3 [2019-09-10 09:00:31,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82cb99357/980149a0cb2c4c67ae04235d931ad407 [2019-09-10 09:00:31,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:00:31,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:00:31,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:31,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:00:31,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:00:31,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:31" (1/1) ... [2019-09-10 09:00:31,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:31, skipping insertion in model container [2019-09-10 09:00:31,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:31" (1/1) ... [2019-09-10 09:00:31,259 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:00:31,395 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:00:32,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:32,509 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:00:32,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:32,985 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:00:32,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32 WrapperNode [2019-09-10 09:00:32,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:32,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:00:32,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:00:32,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:00:33,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (1/1) ... [2019-09-10 09:00:33,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:00:33,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:00:33,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:00:33,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:00:33,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (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:00:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:00:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:00:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:00:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:00:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:00:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:00:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:00:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:00:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:00:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:00:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:00:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:00:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:00:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:00:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:00:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:00:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:00:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:00:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:00:36,302 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:00:36,302 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:00:36,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:36 BoogieIcfgContainer [2019-09-10 09:00:36,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:00:36,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:00:36,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:00:36,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:00:36,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:00:31" (1/3) ... [2019-09-10 09:00:36,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a1c978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:36, skipping insertion in model container [2019-09-10 09:00:36,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:32" (2/3) ... [2019-09-10 09:00:36,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a1c978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:36, skipping insertion in model container [2019-09-10 09:00:36,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:36" (3/3) ... [2019-09-10 09:00:36,319 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 09:00:36,331 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:00:36,360 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:00:36,382 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:00:36,420 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:00:36,420 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:00:36,420 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:00:36,420 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:00:36,421 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:00:36,421 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:00:36,421 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:00:36,421 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:00:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states. [2019-09-10 09:00:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 09:00:36,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:36,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:36,525 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash 143397951, now seen corresponding path program 1 times [2019-09-10 09:00:36,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:36,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:36,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:37,541 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:00:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:37,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:37,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:37,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:37,570 INFO L87 Difference]: Start difference. First operand 795 states. Second operand 3 states. [2019-09-10 09:00:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:37,909 INFO L93 Difference]: Finished difference Result 1292 states and 2278 transitions. [2019-09-10 09:00:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:37,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 09:00:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:37,939 INFO L225 Difference]: With dead ends: 1292 [2019-09-10 09:00:37,939 INFO L226 Difference]: Without dead ends: 1284 [2019-09-10 09:00:37,941 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:00:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-10 09:00:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2019-09-10 09:00:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-09-10 09:00:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2005 transitions. [2019-09-10 09:00:38,094 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2005 transitions. Word has length 324 [2019-09-10 09:00:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:38,100 INFO L475 AbstractCegarLoop]: Abstraction has 1282 states and 2005 transitions. [2019-09-10 09:00:38,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2005 transitions. [2019-09-10 09:00:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 09:00:38,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:38,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:38,116 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1854541179, now seen corresponding path program 1 times [2019-09-10 09:00:38,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:38,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:38,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:38,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:00:38,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:38,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:38,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:38,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:38,648 INFO L87 Difference]: Start difference. First operand 1282 states and 2005 transitions. Second operand 3 states. [2019-09-10 09:00:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:38,934 INFO L93 Difference]: Finished difference Result 2248 states and 3508 transitions. [2019-09-10 09:00:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:38,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 09:00:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:38,953 INFO L225 Difference]: With dead ends: 2248 [2019-09-10 09:00:38,953 INFO L226 Difference]: Without dead ends: 2248 [2019-09-10 09:00:38,954 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:00:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-10 09:00:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2019-09-10 09:00:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-09-10 09:00:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3507 transitions. [2019-09-10 09:00:39,032 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3507 transitions. Word has length 324 [2019-09-10 09:00:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:39,034 INFO L475 AbstractCegarLoop]: Abstraction has 2246 states and 3507 transitions. [2019-09-10 09:00:39,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3507 transitions. [2019-09-10 09:00:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 09:00:39,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:39,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:39,049 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1626065980, now seen corresponding path program 1 times [2019-09-10 09:00:39,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:39,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:39,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:39,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:00:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:39,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:39,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:39,475 INFO L87 Difference]: Start difference. First operand 2246 states and 3507 transitions. Second operand 3 states. [2019-09-10 09:00:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:39,697 INFO L93 Difference]: Finished difference Result 4140 states and 6448 transitions. [2019-09-10 09:00:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:39,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 09:00:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:39,718 INFO L225 Difference]: With dead ends: 4140 [2019-09-10 09:00:39,718 INFO L226 Difference]: Without dead ends: 4140 [2019-09-10 09:00:39,719 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:00:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2019-09-10 09:00:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4138. [2019-09-10 09:00:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4138 states. [2019-09-10 09:00:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 6447 transitions. [2019-09-10 09:00:39,826 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 6447 transitions. Word has length 324 [2019-09-10 09:00:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:39,827 INFO L475 AbstractCegarLoop]: Abstraction has 4138 states and 6447 transitions. [2019-09-10 09:00:39,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6447 transitions. [2019-09-10 09:00:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 09:00:39,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:39,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:39,840 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash -654990492, now seen corresponding path program 1 times [2019-09-10 09:00:39,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:39,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:39,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:40,832 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:00:40,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:40,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:40,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:40,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:40,834 INFO L87 Difference]: Start difference. First operand 4138 states and 6447 transitions. Second operand 4 states. [2019-09-10 09:00:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:41,040 INFO L93 Difference]: Finished difference Result 8108 states and 12557 transitions. [2019-09-10 09:00:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:41,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 09:00:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:41,081 INFO L225 Difference]: With dead ends: 8108 [2019-09-10 09:00:41,081 INFO L226 Difference]: Without dead ends: 8108 [2019-09-10 09:00:41,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:00:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2019-09-10 09:00:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 8106. [2019-09-10 09:00:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8106 states. [2019-09-10 09:00:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8106 states to 8106 states and 12556 transitions. [2019-09-10 09:00:41,331 INFO L78 Accepts]: Start accepts. Automaton has 8106 states and 12556 transitions. Word has length 324 [2019-09-10 09:00:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:41,332 INFO L475 AbstractCegarLoop]: Abstraction has 8106 states and 12556 transitions. [2019-09-10 09:00:41,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8106 states and 12556 transitions. [2019-09-10 09:00:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 09:00:41,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:41,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:41,352 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:41,352 INFO L82 PathProgramCache]: Analyzing trace with hash -840226377, now seen corresponding path program 1 times [2019-09-10 09:00:41,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:41,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:41,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:41,650 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:00:41,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:41,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:41,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:41,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:41,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:41,652 INFO L87 Difference]: Start difference. First operand 8106 states and 12556 transitions. Second operand 3 states. [2019-09-10 09:00:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:41,876 INFO L93 Difference]: Finished difference Result 15890 states and 24466 transitions. [2019-09-10 09:00:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:41,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 09:00:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:41,944 INFO L225 Difference]: With dead ends: 15890 [2019-09-10 09:00:41,945 INFO L226 Difference]: Without dead ends: 15890 [2019-09-10 09:00:41,945 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:00:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15890 states. [2019-09-10 09:00:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15890 to 15888. [2019-09-10 09:00:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15888 states. [2019-09-10 09:00:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 24465 transitions. [2019-09-10 09:00:42,322 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 24465 transitions. Word has length 326 [2019-09-10 09:00:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:42,322 INFO L475 AbstractCegarLoop]: Abstraction has 15888 states and 24465 transitions. [2019-09-10 09:00:42,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 24465 transitions. [2019-09-10 09:00:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 09:00:42,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:42,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:42,356 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1392604476, now seen corresponding path program 1 times [2019-09-10 09:00:42,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:42,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:42,504 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:00:42,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:42,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:42,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:42,506 INFO L87 Difference]: Start difference. First operand 15888 states and 24465 transitions. Second operand 3 states. [2019-09-10 09:00:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:42,653 INFO L93 Difference]: Finished difference Result 31743 states and 48870 transitions. [2019-09-10 09:00:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:42,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 09:00:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:42,739 INFO L225 Difference]: With dead ends: 31743 [2019-09-10 09:00:42,740 INFO L226 Difference]: Without dead ends: 31743 [2019-09-10 09:00:42,740 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:00:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31743 states. [2019-09-10 09:00:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31743 to 15907. [2019-09-10 09:00:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15907 states. [2019-09-10 09:00:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 24493 transitions. [2019-09-10 09:00:44,011 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 24493 transitions. Word has length 326 [2019-09-10 09:00:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:44,013 INFO L475 AbstractCegarLoop]: Abstraction has 15907 states and 24493 transitions. [2019-09-10 09:00:44,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 24493 transitions. [2019-09-10 09:00:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:44,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:44,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:44,047 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -483333520, now seen corresponding path program 1 times [2019-09-10 09:00:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:44,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:44,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:44,202 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:00:44,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:44,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:44,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:44,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:44,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:44,205 INFO L87 Difference]: Start difference. First operand 15907 states and 24493 transitions. Second operand 3 states. [2019-09-10 09:00:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:44,334 INFO L93 Difference]: Finished difference Result 31761 states and 48891 transitions. [2019-09-10 09:00:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:44,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 09:00:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:44,406 INFO L225 Difference]: With dead ends: 31761 [2019-09-10 09:00:44,407 INFO L226 Difference]: Without dead ends: 31761 [2019-09-10 09:00:44,407 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:00:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31761 states. [2019-09-10 09:00:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31761 to 15925. [2019-09-10 09:00:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15925 states. [2019-09-10 09:00:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15925 states to 15925 states and 24514 transitions. [2019-09-10 09:00:44,901 INFO L78 Accepts]: Start accepts. Automaton has 15925 states and 24514 transitions. Word has length 327 [2019-09-10 09:00:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:44,902 INFO L475 AbstractCegarLoop]: Abstraction has 15925 states and 24514 transitions. [2019-09-10 09:00:44,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 15925 states and 24514 transitions. [2019-09-10 09:00:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 09:00:45,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:45,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:45,046 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1336838194, now seen corresponding path program 1 times [2019-09-10 09:00:45,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:45,311 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:00:45,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:45,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:45,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:45,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:45,313 INFO L87 Difference]: Start difference. First operand 15925 states and 24514 transitions. Second operand 3 states. [2019-09-10 09:00:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:45,490 INFO L93 Difference]: Finished difference Result 29436 states and 44989 transitions. [2019-09-10 09:00:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:45,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 09:00:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:45,556 INFO L225 Difference]: With dead ends: 29436 [2019-09-10 09:00:45,557 INFO L226 Difference]: Without dead ends: 29436 [2019-09-10 09:00:45,557 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:00:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29436 states. [2019-09-10 09:00:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29436 to 29434. [2019-09-10 09:00:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29434 states. [2019-09-10 09:00:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29434 states to 29434 states and 44988 transitions. [2019-09-10 09:00:46,178 INFO L78 Accepts]: Start accepts. Automaton has 29434 states and 44988 transitions. Word has length 328 [2019-09-10 09:00:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:46,178 INFO L475 AbstractCegarLoop]: Abstraction has 29434 states and 44988 transitions. [2019-09-10 09:00:46,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 29434 states and 44988 transitions. [2019-09-10 09:00:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 09:00:46,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:46,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:46,275 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1152108785, now seen corresponding path program 1 times [2019-09-10 09:00:46,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:46,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:46,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:47,552 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:00:47,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:47,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:47,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:47,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:47,555 INFO L87 Difference]: Start difference. First operand 29434 states and 44988 transitions. Second operand 4 states. [2019-09-10 09:00:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:47,797 INFO L93 Difference]: Finished difference Result 56587 states and 86379 transitions. [2019-09-10 09:00:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:47,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 09:00:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:47,886 INFO L225 Difference]: With dead ends: 56587 [2019-09-10 09:00:47,886 INFO L226 Difference]: Without dead ends: 56587 [2019-09-10 09:00:47,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:00:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56587 states. [2019-09-10 09:00:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56587 to 29669. [2019-09-10 09:00:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29669 states. [2019-09-10 09:00:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29669 states to 29669 states and 45376 transitions. [2019-09-10 09:00:48,684 INFO L78 Accepts]: Start accepts. Automaton has 29669 states and 45376 transitions. Word has length 328 [2019-09-10 09:00:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:48,684 INFO L475 AbstractCegarLoop]: Abstraction has 29669 states and 45376 transitions. [2019-09-10 09:00:48,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 29669 states and 45376 transitions. [2019-09-10 09:00:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 09:00:48,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:48,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:48,750 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash -453644434, now seen corresponding path program 1 times [2019-09-10 09:00:48,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:48,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:48,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:48,921 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:00:48,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:48,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:48,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:48,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:48,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:48,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:48,924 INFO L87 Difference]: Start difference. First operand 29669 states and 45376 transitions. Second operand 3 states. [2019-09-10 09:00:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:49,242 INFO L93 Difference]: Finished difference Result 47087 states and 72487 transitions. [2019-09-10 09:00:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:49,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 09:00:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:49,305 INFO L225 Difference]: With dead ends: 47087 [2019-09-10 09:00:49,306 INFO L226 Difference]: Without dead ends: 47087 [2019-09-10 09:00:49,308 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:00:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47087 states. [2019-09-10 09:00:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47087 to 37025. [2019-09-10 09:00:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37025 states. [2019-09-10 09:00:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37025 states to 37025 states and 57490 transitions. [2019-09-10 09:00:49,919 INFO L78 Accepts]: Start accepts. Automaton has 37025 states and 57490 transitions. Word has length 330 [2019-09-10 09:00:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:49,919 INFO L475 AbstractCegarLoop]: Abstraction has 37025 states and 57490 transitions. [2019-09-10 09:00:49,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37025 states and 57490 transitions. [2019-09-10 09:00:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 09:00:49,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:49,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:49,951 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1877340163, now seen corresponding path program 1 times [2019-09-10 09:00:49,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:49,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:49,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:49,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:50,120 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:00:50,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:50,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:50,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:50,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:50,122 INFO L87 Difference]: Start difference. First operand 37025 states and 57490 transitions. Second operand 3 states. [2019-09-10 09:00:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:50,365 INFO L93 Difference]: Finished difference Result 73283 states and 113624 transitions. [2019-09-10 09:00:50,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:50,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 09:00:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:50,466 INFO L225 Difference]: With dead ends: 73283 [2019-09-10 09:00:50,467 INFO L226 Difference]: Without dead ends: 73283 [2019-09-10 09:00:50,468 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:00:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73283 states. [2019-09-10 09:00:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73283 to 37129. [2019-09-10 09:00:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37129 states. [2019-09-10 09:00:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37129 states to 37129 states and 57633 transitions. [2019-09-10 09:00:51,613 INFO L78 Accepts]: Start accepts. Automaton has 37129 states and 57633 transitions. Word has length 330 [2019-09-10 09:00:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:51,614 INFO L475 AbstractCegarLoop]: Abstraction has 37129 states and 57633 transitions. [2019-09-10 09:00:51,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37129 states and 57633 transitions. [2019-09-10 09:00:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 09:00:51,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:51,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:51,643 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -804422415, now seen corresponding path program 1 times [2019-09-10 09:00:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:51,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:00:51,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:51,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:51,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:51,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:51,792 INFO L87 Difference]: Start difference. First operand 37129 states and 57633 transitions. Second operand 3 states. [2019-09-10 09:00:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:52,012 INFO L93 Difference]: Finished difference Result 73408 states and 113770 transitions. [2019-09-10 09:00:52,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:52,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 09:00:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:52,119 INFO L225 Difference]: With dead ends: 73408 [2019-09-10 09:00:52,120 INFO L226 Difference]: Without dead ends: 73408 [2019-09-10 09:00:52,124 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:00:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73408 states. [2019-09-10 09:00:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73408 to 37254. [2019-09-10 09:00:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37254 states. [2019-09-10 09:00:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37254 states to 37254 states and 57779 transitions. [2019-09-10 09:00:53,965 INFO L78 Accepts]: Start accepts. Automaton has 37254 states and 57779 transitions. Word has length 331 [2019-09-10 09:00:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:53,966 INFO L475 AbstractCegarLoop]: Abstraction has 37254 states and 57779 transitions. [2019-09-10 09:00:53,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 37254 states and 57779 transitions. [2019-09-10 09:00:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 09:00:53,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:53,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:53,998 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:53,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:53,998 INFO L82 PathProgramCache]: Analyzing trace with hash 536139505, now seen corresponding path program 1 times [2019-09-10 09:00:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:54,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:54,174 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:00:54,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:54,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:54,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:54,177 INFO L87 Difference]: Start difference. First operand 37254 states and 57779 transitions. Second operand 3 states. [2019-09-10 09:00:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:54,443 INFO L93 Difference]: Finished difference Result 58400 states and 91148 transitions. [2019-09-10 09:00:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:54,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 09:00:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:54,536 INFO L225 Difference]: With dead ends: 58400 [2019-09-10 09:00:54,536 INFO L226 Difference]: Without dead ends: 58400 [2019-09-10 09:00:54,537 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:00:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58400 states. [2019-09-10 09:00:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58400 to 50446. [2019-09-10 09:00:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50446 states. [2019-09-10 09:00:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50446 states to 50446 states and 79409 transitions. [2019-09-10 09:00:55,169 INFO L78 Accepts]: Start accepts. Automaton has 50446 states and 79409 transitions. Word has length 332 [2019-09-10 09:00:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:55,169 INFO L475 AbstractCegarLoop]: Abstraction has 50446 states and 79409 transitions. [2019-09-10 09:00:55,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 50446 states and 79409 transitions. [2019-09-10 09:00:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 09:00:55,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:55,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:55,201 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1245793770, now seen corresponding path program 1 times [2019-09-10 09:00:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:55,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:55,558 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:00:55,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:55,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:55,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:55,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:55,561 INFO L87 Difference]: Start difference. First operand 50446 states and 79409 transitions. Second operand 4 states. [2019-09-10 09:00:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:56,068 INFO L93 Difference]: Finished difference Result 47935 states and 75415 transitions. [2019-09-10 09:00:56,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:56,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 09:00:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:56,168 INFO L225 Difference]: With dead ends: 47935 [2019-09-10 09:00:56,168 INFO L226 Difference]: Without dead ends: 47138 [2019-09-10 09:00:56,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:00:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47138 states. [2019-09-10 09:00:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47138 to 47118. [2019-09-10 09:00:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47118 states. [2019-09-10 09:00:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 74148 transitions. [2019-09-10 09:00:56,760 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 74148 transitions. Word has length 332 [2019-09-10 09:00:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:56,760 INFO L475 AbstractCegarLoop]: Abstraction has 47118 states and 74148 transitions. [2019-09-10 09:00:56,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 74148 transitions. [2019-09-10 09:00:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 09:00:56,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:56,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:56,781 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:56,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1110227113, now seen corresponding path program 1 times [2019-09-10 09:00:56,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:56,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:56,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:56,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:56,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:57,407 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:00:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:57,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 09:00:57,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:57,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 09:00:57,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 09:00:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 09:00:57,410 INFO L87 Difference]: Start difference. First operand 47118 states and 74148 transitions. Second operand 10 states. [2019-09-10 09:01:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:00,479 INFO L93 Difference]: Finished difference Result 156054 states and 246753 transitions. [2019-09-10 09:01:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 09:01:00,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-10 09:01:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:00,673 INFO L225 Difference]: With dead ends: 156054 [2019-09-10 09:01:00,673 INFO L226 Difference]: Without dead ends: 156054 [2019-09-10 09:01:00,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 09:01:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156054 states. [2019-09-10 09:01:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156054 to 90862. [2019-09-10 09:01:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90862 states. [2019-09-10 09:01:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90862 states to 90862 states and 143417 transitions. [2019-09-10 09:01:02,132 INFO L78 Accepts]: Start accepts. Automaton has 90862 states and 143417 transitions. Word has length 333 [2019-09-10 09:01:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:02,133 INFO L475 AbstractCegarLoop]: Abstraction has 90862 states and 143417 transitions. [2019-09-10 09:01:02,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 09:01:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 90862 states and 143417 transitions. [2019-09-10 09:01:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 09:01:02,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:02,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:02,158 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1551200824, now seen corresponding path program 1 times [2019-09-10 09:01:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:04,298 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:01:04,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:04,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:04,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:04,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:04,303 INFO L87 Difference]: Start difference. First operand 90862 states and 143417 transitions. Second operand 4 states. [2019-09-10 09:01:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:04,908 INFO L93 Difference]: Finished difference Result 177459 states and 278792 transitions. [2019-09-10 09:01:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:04,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-09-10 09:01:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:05,269 INFO L225 Difference]: With dead ends: 177459 [2019-09-10 09:01:05,269 INFO L226 Difference]: Without dead ends: 177459 [2019-09-10 09:01:05,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:01:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177459 states. [2019-09-10 09:01:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177459 to 177457. [2019-09-10 09:01:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177457 states. [2019-09-10 09:01:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177457 states to 177457 states and 278791 transitions. [2019-09-10 09:01:07,249 INFO L78 Accepts]: Start accepts. Automaton has 177457 states and 278791 transitions. Word has length 333 [2019-09-10 09:01:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:07,250 INFO L475 AbstractCegarLoop]: Abstraction has 177457 states and 278791 transitions. [2019-09-10 09:01:07,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 177457 states and 278791 transitions. [2019-09-10 09:01:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 09:01:07,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:07,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:07,293 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1328429672, now seen corresponding path program 1 times [2019-09-10 09:01:07,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:07,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:07,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:07,520 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:01:07,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:07,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:07,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:07,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:07,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:07,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:07,523 INFO L87 Difference]: Start difference. First operand 177457 states and 278791 transitions. Second operand 3 states. [2019-09-10 09:01:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:08,395 INFO L93 Difference]: Finished difference Result 347741 states and 544513 transitions. [2019-09-10 09:01:08,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:08,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 09:01:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:08,830 INFO L225 Difference]: With dead ends: 347741 [2019-09-10 09:01:08,830 INFO L226 Difference]: Without dead ends: 347741 [2019-09-10 09:01:08,831 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:01:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347741 states. [2019-09-10 09:01:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347741 to 347739. [2019-09-10 09:01:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347739 states. [2019-09-10 09:01:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347739 states to 347739 states and 544512 transitions. [2019-09-10 09:01:16,860 INFO L78 Accepts]: Start accepts. Automaton has 347739 states and 544512 transitions. Word has length 335 [2019-09-10 09:01:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:16,860 INFO L475 AbstractCegarLoop]: Abstraction has 347739 states and 544512 transitions. [2019-09-10 09:01:16,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 347739 states and 544512 transitions. [2019-09-10 09:01:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 09:01:16,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:16,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:16,961 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash 519055583, now seen corresponding path program 1 times [2019-09-10 09:01:16,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:16,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:16,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:17,136 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:01:17,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:17,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:17,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:17,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:17,138 INFO L87 Difference]: Start difference. First operand 347739 states and 544512 transitions. Second operand 3 states. [2019-09-10 09:01:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:24,727 INFO L93 Difference]: Finished difference Result 597229 states and 938337 transitions. [2019-09-10 09:01:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:24,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 09:01:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:25,480 INFO L225 Difference]: With dead ends: 597229 [2019-09-10 09:01:25,481 INFO L226 Difference]: Without dead ends: 597229 [2019-09-10 09:01:25,481 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:01:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597229 states. [2019-09-10 09:01:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597229 to 548859. [2019-09-10 09:01:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548859 states. [2019-09-10 09:01:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548859 states to 548859 states and 863080 transitions. [2019-09-10 09:01:40,970 INFO L78 Accepts]: Start accepts. Automaton has 548859 states and 863080 transitions. Word has length 336 [2019-09-10 09:01:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:40,970 INFO L475 AbstractCegarLoop]: Abstraction has 548859 states and 863080 transitions. [2019-09-10 09:01:40,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 548859 states and 863080 transitions. [2019-09-10 09:01:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 09:01:41,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:41,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:41,082 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1402597133, now seen corresponding path program 1 times [2019-09-10 09:01:41,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:41,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:41,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:41,324 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:01:41,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:41,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:41,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:41,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:41,326 INFO L87 Difference]: Start difference. First operand 548859 states and 863080 transitions. Second operand 3 states. [2019-09-10 09:01:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:55,798 INFO L93 Difference]: Finished difference Result 1015186 states and 1585894 transitions. [2019-09-10 09:01:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:55,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-10 09:01:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:57,443 INFO L225 Difference]: With dead ends: 1015186 [2019-09-10 09:01:57,444 INFO L226 Difference]: Without dead ends: 1015186 [2019-09-10 09:01:57,444 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:01:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015186 states. [2019-09-10 09:02:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015186 to 1015184. [2019-09-10 09:02:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015184 states. [2019-09-10 09:02:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015184 states to 1015184 states and 1585893 transitions. [2019-09-10 09:02:28,466 INFO L78 Accepts]: Start accepts. Automaton has 1015184 states and 1585893 transitions. Word has length 337 [2019-09-10 09:02:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:28,466 INFO L475 AbstractCegarLoop]: Abstraction has 1015184 states and 1585893 transitions. [2019-09-10 09:02:28,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1015184 states and 1585893 transitions. [2019-09-10 09:02:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 09:02:40,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:40,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:40,174 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:40,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 775437712, now seen corresponding path program 1 times [2019-09-10 09:02:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:40,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:40,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:40,632 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:40,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:40,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:40,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:40,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:40,635 INFO L87 Difference]: Start difference. First operand 1015184 states and 1585893 transitions. Second operand 4 states. [2019-09-10 09:02:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:47,932 INFO L93 Difference]: Finished difference Result 1781562 states and 2776675 transitions. [2019-09-10 09:02:47,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:47,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-09-10 09:02:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:53,234 INFO L225 Difference]: With dead ends: 1781562 [2019-09-10 09:02:53,235 INFO L226 Difference]: Without dead ends: 1781562 [2019-09-10 09:02:53,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:02:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781562 states. [2019-09-10 09:03:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781562 to 990398. [2019-09-10 09:03:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990398 states. [2019-09-10 09:03:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990398 states to 990398 states and 1546185 transitions. [2019-09-10 09:03:58,522 INFO L78 Accepts]: Start accepts. Automaton has 990398 states and 1546185 transitions. Word has length 337 [2019-09-10 09:03:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:58,522 INFO L475 AbstractCegarLoop]: Abstraction has 990398 states and 1546185 transitions. [2019-09-10 09:03:58,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:03:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 990398 states and 1546185 transitions. [2019-09-10 09:03:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 09:03:58,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:58,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:58,701 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -40691692, now seen corresponding path program 1 times [2019-09-10 09:03:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:58,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:58,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:58,891 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:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:58,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:58,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:58,895 INFO L87 Difference]: Start difference. First operand 990398 states and 1546185 transitions. Second operand 3 states. [2019-09-10 09:04:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:14,389 INFO L93 Difference]: Finished difference Result 1784579 states and 2783764 transitions. [2019-09-10 09:04:14,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:14,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 09:04:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:17,307 INFO L225 Difference]: With dead ends: 1784579 [2019-09-10 09:04:17,308 INFO L226 Difference]: Without dead ends: 1784579 [2019-09-10 09:04:17,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784579 states. [2019-09-10 09:04:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784579 to 990879. [2019-09-10 09:04:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990879 states. [2019-09-10 09:05:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990879 states to 990879 states and 1546783 transitions. [2019-09-10 09:05:05,424 INFO L78 Accepts]: Start accepts. Automaton has 990879 states and 1546783 transitions. Word has length 340 [2019-09-10 09:05:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:05,424 INFO L475 AbstractCegarLoop]: Abstraction has 990879 states and 1546783 transitions. [2019-09-10 09:05:05,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 990879 states and 1546783 transitions. [2019-09-10 09:05:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-10 09:05:08,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:08,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:08,286 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:08,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:08,286 INFO L82 PathProgramCache]: Analyzing trace with hash -246055525, now seen corresponding path program 1 times [2019-09-10 09:05:08,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:08,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:08,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:05:08,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:08,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:08,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:08,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:08,458 INFO L87 Difference]: Start difference. First operand 990879 states and 1546783 transitions. Second operand 3 states. [2019-09-10 09:05:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:28,097 INFO L93 Difference]: Finished difference Result 1621105 states and 2537711 transitions. [2019-09-10 09:05:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:28,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2019-09-10 09:05:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:31,139 INFO L225 Difference]: With dead ends: 1621105 [2019-09-10 09:05:31,139 INFO L226 Difference]: Without dead ends: 1621105 [2019-09-10 09:05:31,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621105 states. [2019-09-10 09:06:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621105 to 1501727. [2019-09-10 09:06:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501727 states.