java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:29:10,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:29:10,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:29:10,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:29:10,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:29:10,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:29:10,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:29:10,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:29:10,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:29:10,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:29:10,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:29:10,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:29:10,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:29:10,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:29:10,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:29:10,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:29:10,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:29:10,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:29:10,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:29:10,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:29:10,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:29:10,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:29:10,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:29:10,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:29:10,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:29:10,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:29:10,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:29:10,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:29:10,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:29:10,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:29:10,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:29:10,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:29:10,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:29:10,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:29:10,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:29:10,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:29:10,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:29:10,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:29:10,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:29:10,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:29:10,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:29:10,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:29:10,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:29:10,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:29:10,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:29:10,226 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:29:10,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:29:10,227 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:29:10,228 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:29:10,228 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:29:10,228 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:29:10,228 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:29:10,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:29:10,230 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:29:10,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:29:10,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:29:10,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:29:10,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:29:10,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:29:10,231 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:29:10,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:29:10,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:29:10,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:29:10,232 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:29:10,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:29:10,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:29:10,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:29:10,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:29:10,234 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:29:10,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:29:10,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:29:10,234 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:29:10,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:29:10,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:29:10,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:29:10,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:29:10,304 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:29:10,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:29:10,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077d81835/2c13689b7ee64a70b34508f53fed7424/FLAG7cdd7cb86 [2019-09-10 06:29:10,976 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:29:10,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:29:11,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077d81835/2c13689b7ee64a70b34508f53fed7424/FLAG7cdd7cb86 [2019-09-10 06:29:11,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077d81835/2c13689b7ee64a70b34508f53fed7424 [2019-09-10 06:29:11,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:29:11,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:29:11,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:11,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:29:11,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:29:11,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:11" (1/1) ... [2019-09-10 06:29:11,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa32137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:11, skipping insertion in model container [2019-09-10 06:29:11,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:11" (1/1) ... [2019-09-10 06:29:11,136 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:29:11,234 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:29:11,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:11,999 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:29:12,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:12,353 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:29:12,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12 WrapperNode [2019-09-10 06:29:12,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:12,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:29:12,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:29:12,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:29:12,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... [2019-09-10 06:29:12,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:29:12,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:29:12,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:29:12,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:29:12,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:29:12,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:29:12,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:29:12,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:29:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:29:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:29:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:29:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:29:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:29:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:29:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:29:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:29:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:29:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:29:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:29:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:29:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:29:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:29:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:29:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:29:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:29:15,147 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:29:15,147 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:29:15,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:29:15 BoogieIcfgContainer [2019-09-10 06:29:15,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:29:15,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:29:15,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:29:15,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:29:15,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:29:11" (1/3) ... [2019-09-10 06:29:15,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6e8977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:29:15, skipping insertion in model container [2019-09-10 06:29:15,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:12" (2/3) ... [2019-09-10 06:29:15,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6e8977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:29:15, skipping insertion in model container [2019-09-10 06:29:15,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:29:15" (3/3) ... [2019-09-10 06:29:15,157 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:29:15,166 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:29:15,181 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:29:15,202 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:29:15,232 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:29:15,232 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:29:15,232 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:29:15,233 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:29:15,233 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:29:15,233 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:29:15,233 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:29:15,233 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:29:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-10 06:29:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:29:15,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:15,298 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] [2019-09-10 06:29:15,300 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 326812692, now seen corresponding path program 1 times [2019-09-10 06:29:15,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:15,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:15,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:15,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:15,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:16,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:16,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:16,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:16,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:16,093 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 3 states. [2019-09-10 06:29:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:16,250 INFO L93 Difference]: Finished difference Result 922 states and 1654 transitions. [2019-09-10 06:29:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:16,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 06:29:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:16,286 INFO L225 Difference]: With dead ends: 922 [2019-09-10 06:29:16,287 INFO L226 Difference]: Without dead ends: 914 [2019-09-10 06:29:16,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-10 06:29:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2019-09-10 06:29:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-10 06:29:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1584 transitions. [2019-09-10 06:29:16,382 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1584 transitions. Word has length 208 [2019-09-10 06:29:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:16,383 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1584 transitions. [2019-09-10 06:29:16,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1584 transitions. [2019-09-10 06:29:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 06:29:16,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:16,390 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] [2019-09-10 06:29:16,390 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -749134671, now seen corresponding path program 1 times [2019-09-10 06:29:16,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:16,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:16,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:16,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:16,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:16,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:16,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:16,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:16,775 INFO L87 Difference]: Start difference. First operand 912 states and 1584 transitions. Second operand 3 states. [2019-09-10 06:29:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:16,836 INFO L93 Difference]: Finished difference Result 1255 states and 2157 transitions. [2019-09-10 06:29:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:16,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 06:29:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:16,854 INFO L225 Difference]: With dead ends: 1255 [2019-09-10 06:29:16,854 INFO L226 Difference]: Without dead ends: 1255 [2019-09-10 06:29:16,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-10 06:29:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2019-09-10 06:29:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-09-10 06:29:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2156 transitions. [2019-09-10 06:29:16,927 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2156 transitions. Word has length 212 [2019-09-10 06:29:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:16,930 INFO L475 AbstractCegarLoop]: Abstraction has 1253 states and 2156 transitions. [2019-09-10 06:29:16,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2156 transitions. [2019-09-10 06:29:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:29:16,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:16,942 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] [2019-09-10 06:29:16,943 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1492476271, now seen corresponding path program 1 times [2019-09-10 06:29:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:16,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:16,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:17,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:17,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:17,287 INFO L87 Difference]: Start difference. First operand 1253 states and 2156 transitions. Second operand 3 states. [2019-09-10 06:29:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:17,338 INFO L93 Difference]: Finished difference Result 1589 states and 2719 transitions. [2019-09-10 06:29:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:17,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:29:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:17,350 INFO L225 Difference]: With dead ends: 1589 [2019-09-10 06:29:17,351 INFO L226 Difference]: Without dead ends: 1589 [2019-09-10 06:29:17,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-09-10 06:29:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1587. [2019-09-10 06:29:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-09-10 06:29:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2718 transitions. [2019-09-10 06:29:17,401 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2718 transitions. Word has length 216 [2019-09-10 06:29:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:17,401 INFO L475 AbstractCegarLoop]: Abstraction has 1587 states and 2718 transitions. [2019-09-10 06:29:17,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2718 transitions. [2019-09-10 06:29:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:29:17,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:17,408 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] [2019-09-10 06:29:17,408 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2071522764, now seen corresponding path program 1 times [2019-09-10 06:29:17,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:17,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:17,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:17,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:17,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:17,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:17,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:17,670 INFO L87 Difference]: Start difference. First operand 1587 states and 2718 transitions. Second operand 3 states. [2019-09-10 06:29:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:17,719 INFO L93 Difference]: Finished difference Result 2524 states and 4277 transitions. [2019-09-10 06:29:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:17,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:29:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:17,734 INFO L225 Difference]: With dead ends: 2524 [2019-09-10 06:29:17,734 INFO L226 Difference]: Without dead ends: 2524 [2019-09-10 06:29:17,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-10 06:29:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2522. [2019-09-10 06:29:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2019-09-10 06:29:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4276 transitions. [2019-09-10 06:29:17,802 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4276 transitions. Word has length 216 [2019-09-10 06:29:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:17,802 INFO L475 AbstractCegarLoop]: Abstraction has 2522 states and 4276 transitions. [2019-09-10 06:29:17,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4276 transitions. [2019-09-10 06:29:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 06:29:17,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:17,807 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] [2019-09-10 06:29:17,808 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -108508146, now seen corresponding path program 1 times [2019-09-10 06:29:17,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:17,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:17,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:17,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:17,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:17,980 INFO L87 Difference]: Start difference. First operand 2522 states and 4276 transitions. Second operand 3 states. [2019-09-10 06:29:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:18,032 INFO L93 Difference]: Finished difference Result 3373 states and 5695 transitions. [2019-09-10 06:29:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:18,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-10 06:29:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:18,050 INFO L225 Difference]: With dead ends: 3373 [2019-09-10 06:29:18,050 INFO L226 Difference]: Without dead ends: 3373 [2019-09-10 06:29:18,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-10 06:29:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3371. [2019-09-10 06:29:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2019-09-10 06:29:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 5694 transitions. [2019-09-10 06:29:18,192 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 5694 transitions. Word has length 220 [2019-09-10 06:29:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:18,193 INFO L475 AbstractCegarLoop]: Abstraction has 3371 states and 5694 transitions. [2019-09-10 06:29:18,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 5694 transitions. [2019-09-10 06:29:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 06:29:18,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:18,198 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] [2019-09-10 06:29:18,198 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 959349905, now seen corresponding path program 1 times [2019-09-10 06:29:18,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:18,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:18,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:18,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:18,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:18,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:18,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:18,402 INFO L87 Difference]: Start difference. First operand 3371 states and 5694 transitions. Second operand 3 states. [2019-09-10 06:29:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:18,478 INFO L93 Difference]: Finished difference Result 5914 states and 9895 transitions. [2019-09-10 06:29:18,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:18,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-10 06:29:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:18,508 INFO L225 Difference]: With dead ends: 5914 [2019-09-10 06:29:18,508 INFO L226 Difference]: Without dead ends: 5914 [2019-09-10 06:29:18,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-09-10 06:29:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5912. [2019-09-10 06:29:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-09-10 06:29:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 9894 transitions. [2019-09-10 06:29:18,646 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 9894 transitions. Word has length 220 [2019-09-10 06:29:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:18,646 INFO L475 AbstractCegarLoop]: Abstraction has 5912 states and 9894 transitions. [2019-09-10 06:29:18,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 9894 transitions. [2019-09-10 06:29:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:29:18,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:18,656 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] [2019-09-10 06:29:18,656 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 792658975, now seen corresponding path program 1 times [2019-09-10 06:29:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:18,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:18,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:18,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:18,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:18,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:18,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:18,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:18,866 INFO L87 Difference]: Start difference. First operand 5912 states and 9894 transitions. Second operand 3 states. [2019-09-10 06:29:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:18,940 INFO L93 Difference]: Finished difference Result 8105 states and 13535 transitions. [2019-09-10 06:29:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:18,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:29:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:19,007 INFO L225 Difference]: With dead ends: 8105 [2019-09-10 06:29:19,007 INFO L226 Difference]: Without dead ends: 8105 [2019-09-10 06:29:19,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8105 states. [2019-09-10 06:29:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8105 to 8103. [2019-09-10 06:29:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-09-10 06:29:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13534 transitions. [2019-09-10 06:29:19,256 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13534 transitions. Word has length 224 [2019-09-10 06:29:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:19,257 INFO L475 AbstractCegarLoop]: Abstraction has 8103 states and 13534 transitions. [2019-09-10 06:29:19,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13534 transitions. [2019-09-10 06:29:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:29:19,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:19,262 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] [2019-09-10 06:29:19,262 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1043249236, now seen corresponding path program 1 times [2019-09-10 06:29:19,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:19,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:19,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:19,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:19,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:19,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:19,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:19,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:19,470 INFO L87 Difference]: Start difference. First operand 8103 states and 13534 transitions. Second operand 3 states. [2019-09-10 06:29:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:19,569 INFO L93 Difference]: Finished difference Result 14936 states and 24713 transitions. [2019-09-10 06:29:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:19,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:29:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:19,605 INFO L225 Difference]: With dead ends: 14936 [2019-09-10 06:29:19,605 INFO L226 Difference]: Without dead ends: 14936 [2019-09-10 06:29:19,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14936 states. [2019-09-10 06:29:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14936 to 14934. [2019-09-10 06:29:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14934 states. [2019-09-10 06:29:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14934 states to 14934 states and 24712 transitions. [2019-09-10 06:29:19,867 INFO L78 Accepts]: Start accepts. Automaton has 14934 states and 24712 transitions. Word has length 224 [2019-09-10 06:29:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:19,868 INFO L475 AbstractCegarLoop]: Abstraction has 14934 states and 24712 transitions. [2019-09-10 06:29:19,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 14934 states and 24712 transitions. [2019-09-10 06:29:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 06:29:19,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:19,872 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] [2019-09-10 06:29:19,872 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1254462577, now seen corresponding path program 1 times [2019-09-10 06:29:19,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:19,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:20,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:20,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:20,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:20,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:20,390 INFO L87 Difference]: Start difference. First operand 14934 states and 24712 transitions. Second operand 7 states. [2019-09-10 06:29:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:21,586 INFO L93 Difference]: Finished difference Result 90509 states and 150293 transitions. [2019-09-10 06:29:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:29:21,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-09-10 06:29:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:21,786 INFO L225 Difference]: With dead ends: 90509 [2019-09-10 06:29:21,787 INFO L226 Difference]: Without dead ends: 90509 [2019-09-10 06:29:21,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:29:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90509 states. [2019-09-10 06:29:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90509 to 29107. [2019-09-10 06:29:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29107 states. [2019-09-10 06:29:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29107 states to 29107 states and 47961 transitions. [2019-09-10 06:29:23,788 INFO L78 Accepts]: Start accepts. Automaton has 29107 states and 47961 transitions. Word has length 228 [2019-09-10 06:29:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:23,789 INFO L475 AbstractCegarLoop]: Abstraction has 29107 states and 47961 transitions. [2019-09-10 06:29:23,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 29107 states and 47961 transitions. [2019-09-10 06:29:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:29:23,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:23,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:23,794 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash 162908202, now seen corresponding path program 1 times [2019-09-10 06:29:23,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:23,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:23,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:24,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:24,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:24,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:24,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:24,004 INFO L87 Difference]: Start difference. First operand 29107 states and 47961 transitions. Second operand 4 states. [2019-09-10 06:29:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:24,435 INFO L93 Difference]: Finished difference Result 51308 states and 84989 transitions. [2019-09-10 06:29:24,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:24,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 06:29:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:24,551 INFO L225 Difference]: With dead ends: 51308 [2019-09-10 06:29:24,552 INFO L226 Difference]: Without dead ends: 51308 [2019-09-10 06:29:24,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51308 states. [2019-09-10 06:29:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51308 to 43862. [2019-09-10 06:29:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43862 states. [2019-09-10 06:29:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43862 states to 43862 states and 72426 transitions. [2019-09-10 06:29:25,161 INFO L78 Accepts]: Start accepts. Automaton has 43862 states and 72426 transitions. Word has length 229 [2019-09-10 06:29:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:25,162 INFO L475 AbstractCegarLoop]: Abstraction has 43862 states and 72426 transitions. [2019-09-10 06:29:25,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 43862 states and 72426 transitions. [2019-09-10 06:29:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:29:25,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:25,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:25,167 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1006966476, now seen corresponding path program 1 times [2019-09-10 06:29:25,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:25,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:25,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:25,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:25,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:25,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:25,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:25,375 INFO L87 Difference]: Start difference. First operand 43862 states and 72426 transitions. Second operand 3 states. [2019-09-10 06:29:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:25,593 INFO L93 Difference]: Finished difference Result 61182 states and 100890 transitions. [2019-09-10 06:29:25,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:25,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 06:29:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:26,657 INFO L225 Difference]: With dead ends: 61182 [2019-09-10 06:29:26,658 INFO L226 Difference]: Without dead ends: 61182 [2019-09-10 06:29:26,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61182 states. [2019-09-10 06:29:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61182 to 61180. [2019-09-10 06:29:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61180 states. [2019-09-10 06:29:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61180 states to 61180 states and 100889 transitions. [2019-09-10 06:29:27,338 INFO L78 Accepts]: Start accepts. Automaton has 61180 states and 100889 transitions. Word has length 229 [2019-09-10 06:29:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:27,338 INFO L475 AbstractCegarLoop]: Abstraction has 61180 states and 100889 transitions. [2019-09-10 06:29:27,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61180 states and 100889 transitions. [2019-09-10 06:29:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:29:27,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:27,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:27,344 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 133298612, now seen corresponding path program 1 times [2019-09-10 06:29:27,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:27,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:27,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:27,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:27,504 INFO L87 Difference]: Start difference. First operand 61180 states and 100889 transitions. Second operand 3 states. [2019-09-10 06:29:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:28,114 INFO L93 Difference]: Finished difference Result 92060 states and 151941 transitions. [2019-09-10 06:29:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:28,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 06:29:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:28,333 INFO L225 Difference]: With dead ends: 92060 [2019-09-10 06:29:28,333 INFO L226 Difference]: Without dead ends: 92060 [2019-09-10 06:29:28,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92060 states. [2019-09-10 06:29:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92060 to 92058. [2019-09-10 06:29:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92058 states. [2019-09-10 06:29:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92058 states to 92058 states and 151940 transitions. [2019-09-10 06:29:29,456 INFO L78 Accepts]: Start accepts. Automaton has 92058 states and 151940 transitions. Word has length 229 [2019-09-10 06:29:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:29,457 INFO L475 AbstractCegarLoop]: Abstraction has 92058 states and 151940 transitions. [2019-09-10 06:29:29,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 92058 states and 151940 transitions. [2019-09-10 06:29:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:29:29,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:29,461 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] [2019-09-10 06:29:29,461 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash 689018968, now seen corresponding path program 1 times [2019-09-10 06:29:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:29,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:31,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:31,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:31,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:31,376 INFO L87 Difference]: Start difference. First operand 92058 states and 151940 transitions. Second operand 4 states. [2019-09-10 06:29:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:31,882 INFO L93 Difference]: Finished difference Result 180903 states and 298698 transitions. [2019-09-10 06:29:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:31,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 06:29:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:32,173 INFO L225 Difference]: With dead ends: 180903 [2019-09-10 06:29:32,173 INFO L226 Difference]: Without dead ends: 180903 [2019-09-10 06:29:32,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180903 states. [2019-09-10 06:29:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180903 to 151264. [2019-09-10 06:29:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151264 states. [2019-09-10 06:29:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151264 states to 151264 states and 249210 transitions. [2019-09-10 06:29:33,921 INFO L78 Accepts]: Start accepts. Automaton has 151264 states and 249210 transitions. Word has length 230 [2019-09-10 06:29:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:33,921 INFO L475 AbstractCegarLoop]: Abstraction has 151264 states and 249210 transitions. [2019-09-10 06:29:33,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 151264 states and 249210 transitions. [2019-09-10 06:29:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 06:29:33,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:33,925 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] [2019-09-10 06:29:33,925 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash -176858447, now seen corresponding path program 1 times [2019-09-10 06:29:33,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:33,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:33,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:34,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:34,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:34,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:34,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:34,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:34,109 INFO L87 Difference]: Start difference. First operand 151264 states and 249210 transitions. Second operand 4 states. [2019-09-10 06:29:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:37,156 INFO L93 Difference]: Finished difference Result 296255 states and 488348 transitions. [2019-09-10 06:29:37,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:37,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-10 06:29:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:37,525 INFO L225 Difference]: With dead ends: 296255 [2019-09-10 06:29:37,526 INFO L226 Difference]: Without dead ends: 296255 [2019-09-10 06:29:37,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296255 states. [2019-09-10 06:29:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296255 to 248194. [2019-09-10 06:29:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248194 states. [2019-09-10 06:29:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248194 states to 248194 states and 408192 transitions. [2019-09-10 06:29:44,962 INFO L78 Accepts]: Start accepts. Automaton has 248194 states and 408192 transitions. Word has length 231 [2019-09-10 06:29:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:44,962 INFO L475 AbstractCegarLoop]: Abstraction has 248194 states and 408192 transitions. [2019-09-10 06:29:44,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:29:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 248194 states and 408192 transitions. [2019-09-10 06:29:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 06:29:44,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:44,965 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] [2019-09-10 06:29:44,965 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1244696513, now seen corresponding path program 1 times [2019-09-10 06:29:44,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:44,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:44,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:45,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:29:45,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:45,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:29:45,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:29:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:45,224 INFO L87 Difference]: Start difference. First operand 248194 states and 408192 transitions. Second operand 4 states. [2019-09-10 06:29:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:46,343 INFO L93 Difference]: Finished difference Result 488672 states and 804065 transitions. [2019-09-10 06:29:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:29:46,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 06:29:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:46,966 INFO L225 Difference]: With dead ends: 488672 [2019-09-10 06:29:46,966 INFO L226 Difference]: Without dead ends: 488672 [2019-09-10 06:29:46,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:29:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488672 states. [2019-09-10 06:29:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488672 to 405720. [2019-09-10 06:29:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405720 states. [2019-09-10 06:30:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405720 states to 405720 states and 666142 transitions. [2019-09-10 06:30:02,561 INFO L78 Accepts]: Start accepts. Automaton has 405720 states and 666142 transitions. Word has length 232 [2019-09-10 06:30:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:02,562 INFO L475 AbstractCegarLoop]: Abstraction has 405720 states and 666142 transitions. [2019-09-10 06:30:02,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:30:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 405720 states and 666142 transitions. [2019-09-10 06:30:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 06:30:02,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:02,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:02,565 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash 16619832, now seen corresponding path program 1 times [2019-09-10 06:30:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:02,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:02,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:02,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:30:02,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:02,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:30:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:30:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:30:02,879 INFO L87 Difference]: Start difference. First operand 405720 states and 666142 transitions. Second operand 8 states. [2019-09-10 06:30:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:09,882 INFO L93 Difference]: Finished difference Result 1832147 states and 3010961 transitions. [2019-09-10 06:30:09,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:30:09,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-09-10 06:30:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:24,311 INFO L225 Difference]: With dead ends: 1832147 [2019-09-10 06:30:24,311 INFO L226 Difference]: Without dead ends: 1832147 [2019-09-10 06:30:24,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:30:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832147 states. [2019-09-10 06:30:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832147 to 1110422. [2019-09-10 06:30:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-10 06:31:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1815836 transitions. [2019-09-10 06:31:04,366 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1815836 transitions. Word has length 233 [2019-09-10 06:31:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:04,367 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1815836 transitions. [2019-09-10 06:31:04,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:31:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1815836 transitions. [2019-09-10 06:31:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 06:31:04,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:04,369 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] [2019-09-10 06:31:04,369 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1597136680, now seen corresponding path program 1 times [2019-09-10 06:31:04,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:04,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:31:04,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:04,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:31:04,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:04,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:31:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:31:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:31:04,897 INFO L87 Difference]: Start difference. First operand 1110422 states and 1815836 transitions. Second operand 7 states. [2019-09-10 06:31:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:24,929 INFO L93 Difference]: Finished difference Result 1576882 states and 2580621 transitions. [2019-09-10 06:31:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:31:24,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-10 06:31:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:28,038 INFO L225 Difference]: With dead ends: 1576882 [2019-09-10 06:31:28,038 INFO L226 Difference]: Without dead ends: 1576882 [2019-09-10 06:31:28,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:31:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576882 states. [2019-09-10 06:32:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576882 to 1110422. [2019-09-10 06:32:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-10 06:32:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1812711 transitions. [2019-09-10 06:32:11,893 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1812711 transitions. Word has length 235 [2019-09-10 06:32:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:11,893 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1812711 transitions. [2019-09-10 06:32:11,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:32:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1812711 transitions. [2019-09-10 06:32:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:32:11,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:11,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:32:11,896 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1397893136, now seen corresponding path program 1 times [2019-09-10 06:32:11,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:11,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:11,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:12,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:12,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:32:12,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:12,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:32:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:32:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:32:12,397 INFO L87 Difference]: Start difference. First operand 1110422 states and 1812711 transitions. Second operand 7 states. [2019-09-10 06:32:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:42,865 INFO L93 Difference]: Finished difference Result 2691953 states and 4398360 transitions. [2019-09-10 06:32:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:32:42,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 238 [2019-09-10 06:32:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:48,561 INFO L225 Difference]: With dead ends: 2691953 [2019-09-10 06:32:48,561 INFO L226 Difference]: Without dead ends: 2691953 [2019-09-10 06:32:48,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:32:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691953 states.