./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_net_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_net_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e30af526e16c58deb50a12d2f5da235c49261ec ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:52:15,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:15,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:15,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:15,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:15,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:15,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:15,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:15,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:15,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:15,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:15,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:15,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:15,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:15,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:15,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:15,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:15,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:15,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:15,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:15,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:15,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:15,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:15,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:15,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:15,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:15,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:15,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:15,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:15,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:15,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:15,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:15,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:15,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:15,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:15,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:15,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:15,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:15,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:15,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:15,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:15,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:52:15,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:15,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:15,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:15,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:15,203 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:15,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:15,203 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:52:15,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:15,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:52:15,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:15,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:52:15,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:52:15,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:52:15,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:52:15,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:52:15,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:15,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:52:15,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:15,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:15,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:52:15,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:52:15,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:15,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:15,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:52:15,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:52:15,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:15,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:52:15,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:52:15,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e30af526e16c58deb50a12d2f5da235c49261ec [2019-11-15 23:52:15,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:15,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:15,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:15,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:15,254 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:15,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_net_1.c [2019-11-15 23:52:15,309 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/data/574f89e78/caf8de5a84bb402b84c2e7a0375cec97/FLAGa16961df8 [2019-11-15 23:52:16,299 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:16,301 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/sv-benchmarks/c/psyco/psyco_net_1.c [2019-11-15 23:52:16,442 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/data/574f89e78/caf8de5a84bb402b84c2e7a0375cec97/FLAGa16961df8 [2019-11-15 23:52:16,823 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/data/574f89e78/caf8de5a84bb402b84c2e7a0375cec97 [2019-11-15 23:52:16,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:16,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:52:16,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:16,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:16,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:16,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:16" (1/1) ... [2019-11-15 23:52:16,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3f706d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:16, skipping insertion in model container [2019-11-15 23:52:16,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:16" (1/1) ... [2019-11-15 23:52:16,842 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:17,316 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:19,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:19,135 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:20,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:20,172 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:20,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20 WrapperNode [2019-11-15 23:52:20,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:20,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:20,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:52:20,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:52:20,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:20,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:20,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:20,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:20,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:20,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:20,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:20,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:20,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:20,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:21,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:21,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:21,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... [2019-11-15 23:52:22,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:22,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:22,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:22,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:22,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/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-11-15 23:52:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:22,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:39,546 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:39,547 INFO L284 CfgBuilder]: Removed 1134 assume(true) statements. [2019-11-15 23:52:39,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:39 BoogieIcfgContainer [2019-11-15 23:52:39,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:39,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:52:39,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:52:39,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:52:39,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:52:16" (1/3) ... [2019-11-15 23:52:39,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f46b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:39, skipping insertion in model container [2019-11-15 23:52:39,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:20" (2/3) ... [2019-11-15 23:52:39,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f46b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:39, skipping insertion in model container [2019-11-15 23:52:39,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:39" (3/3) ... [2019-11-15 23:52:39,560 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2019-11-15 23:52:39,566 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:52:39,578 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:52:39,587 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:52:39,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:52:39,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:52:39,668 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:52:39,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:39,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:39,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:52:39,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:39,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:52:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states. [2019-11-15 23:52:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:52:39,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:39,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:39,796 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash 352619045, now seen corresponding path program 1 times [2019-11-15 23:52:39,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:39,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486879021] [2019-11-15 23:52:39,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:39,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:39,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:40,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486879021] [2019-11-15 23:52:40,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:40,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:40,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543475938] [2019-11-15 23:52:40,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:52:40,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:40,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:52:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:52:40,046 INFO L87 Difference]: Start difference. First operand 9211 states. Second operand 2 states. [2019-11-15 23:52:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:40,325 INFO L93 Difference]: Finished difference Result 17698 states and 35380 transitions. [2019-11-15 23:52:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:52:40,327 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-15 23:52:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:40,389 INFO L225 Difference]: With dead ends: 17698 [2019-11-15 23:52:40,389 INFO L226 Difference]: Without dead ends: 8280 [2019-11-15 23:52:40,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:52:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2019-11-15 23:52:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8280. [2019-11-15 23:52:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-11-15 23:52:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 12997 transitions. [2019-11-15 23:52:40,633 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 12997 transitions. Word has length 9 [2019-11-15 23:52:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:40,633 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 12997 transitions. [2019-11-15 23:52:40,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:52:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 12997 transitions. [2019-11-15 23:52:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:52:40,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:40,634 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:40,635 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1422650027, now seen corresponding path program 1 times [2019-11-15 23:52:40,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:40,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297547330] [2019-11-15 23:52:40,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:40,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297547330] [2019-11-15 23:52:40,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:40,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:40,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455822802] [2019-11-15 23:52:40,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:40,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:40,733 INFO L87 Difference]: Start difference. First operand 8280 states and 12997 transitions. Second operand 3 states. [2019-11-15 23:52:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:43,287 INFO L93 Difference]: Finished difference Result 16561 states and 25996 transitions. [2019-11-15 23:52:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:43,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 23:52:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:43,333 INFO L225 Difference]: With dead ends: 16561 [2019-11-15 23:52:43,334 INFO L226 Difference]: Without dead ends: 8283 [2019-11-15 23:52:43,345 INFO L600 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-11-15 23:52:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2019-11-15 23:52:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2019-11-15 23:52:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8283 states. [2019-11-15 23:52:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 13000 transitions. [2019-11-15 23:52:43,548 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 13000 transitions. Word has length 10 [2019-11-15 23:52:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:43,549 INFO L462 AbstractCegarLoop]: Abstraction has 8283 states and 13000 transitions. [2019-11-15 23:52:43,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 13000 transitions. [2019-11-15 23:52:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:52:43,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:43,550 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:43,551 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 658080264, now seen corresponding path program 1 times [2019-11-15 23:52:43,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:43,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98006407] [2019-11-15 23:52:43,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:43,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:43,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:43,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98006407] [2019-11-15 23:52:43,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:43,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:43,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471225712] [2019-11-15 23:52:43,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:43,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:43,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:43,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:43,708 INFO L87 Difference]: Start difference. First operand 8283 states and 13000 transitions. Second operand 3 states. [2019-11-15 23:52:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:45,672 INFO L93 Difference]: Finished difference Result 16456 states and 25845 transitions. [2019-11-15 23:52:45,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:45,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-15 23:52:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:45,732 INFO L225 Difference]: With dead ends: 16456 [2019-11-15 23:52:45,732 INFO L226 Difference]: Without dead ends: 8176 [2019-11-15 23:52:45,743 INFO L600 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-11-15 23:52:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2019-11-15 23:52:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2019-11-15 23:52:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-11-15 23:52:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 12846 transitions. [2019-11-15 23:52:45,945 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 12846 transitions. Word has length 15 [2019-11-15 23:52:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:45,946 INFO L462 AbstractCegarLoop]: Abstraction has 8176 states and 12846 transitions. [2019-11-15 23:52:45,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 12846 transitions. [2019-11-15 23:52:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:52:45,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:45,948 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:45,949 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash 505082677, now seen corresponding path program 1 times [2019-11-15 23:52:45,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:45,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894038105] [2019-11-15 23:52:45,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:45,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:45,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:46,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894038105] [2019-11-15 23:52:46,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:46,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:46,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970246645] [2019-11-15 23:52:46,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:46,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:46,062 INFO L87 Difference]: Start difference. First operand 8176 states and 12846 transitions. Second operand 3 states. [2019-11-15 23:52:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:50,389 INFO L93 Difference]: Finished difference Result 16264 states and 25563 transitions. [2019-11-15 23:52:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:50,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:52:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:50,406 INFO L225 Difference]: With dead ends: 16264 [2019-11-15 23:52:50,406 INFO L226 Difference]: Without dead ends: 8056 [2019-11-15 23:52:50,416 INFO L600 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-11-15 23:52:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2019-11-15 23:52:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 8056. [2019-11-15 23:52:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2019-11-15 23:52:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 12226 transitions. [2019-11-15 23:52:50,565 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 12226 transitions. Word has length 19 [2019-11-15 23:52:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:50,565 INFO L462 AbstractCegarLoop]: Abstraction has 8056 states and 12226 transitions. [2019-11-15 23:52:50,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 12226 transitions. [2019-11-15 23:52:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:52:50,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:50,572 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:50,572 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:50,573 INFO L82 PathProgramCache]: Analyzing trace with hash -945434933, now seen corresponding path program 1 times [2019-11-15 23:52:50,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:50,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488992321] [2019-11-15 23:52:50,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:50,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:50,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488992321] [2019-11-15 23:52:50,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:50,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:50,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560204932] [2019-11-15 23:52:50,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:50,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:50,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:50,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:50,653 INFO L87 Difference]: Start difference. First operand 8056 states and 12226 transitions. Second operand 3 states. [2019-11-15 23:52:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:52,473 INFO L93 Difference]: Finished difference Result 16110 states and 24449 transitions. [2019-11-15 23:52:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:52,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:52:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:52,490 INFO L225 Difference]: With dead ends: 16110 [2019-11-15 23:52:52,490 INFO L226 Difference]: Without dead ends: 8062 [2019-11-15 23:52:52,502 INFO L600 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-11-15 23:52:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2019-11-15 23:52:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 8060. [2019-11-15 23:52:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2019-11-15 23:52:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2019-11-15 23:52:52,629 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 22 [2019-11-15 23:52:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:52,629 INFO L462 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2019-11-15 23:52:52,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2019-11-15 23:52:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:52:52,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:52,631 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:52,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1597993323, now seen corresponding path program 1 times [2019-11-15 23:52:52,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:52,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580120159] [2019-11-15 23:52:52,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:52,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580120159] [2019-11-15 23:52:52,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:52,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:52,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700319575] [2019-11-15 23:52:52,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:52,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:52,714 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2019-11-15 23:52:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:57,324 INFO L93 Difference]: Finished difference Result 24164 states and 36672 transitions. [2019-11-15 23:52:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:57,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:52:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:57,357 INFO L225 Difference]: With dead ends: 24164 [2019-11-15 23:52:57,357 INFO L226 Difference]: Without dead ends: 16064 [2019-11-15 23:52:57,367 INFO L600 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-11-15 23:52:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2019-11-15 23:52:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 14806. [2019-11-15 23:52:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14806 states. [2019-11-15 23:52:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14806 states to 14806 states and 23042 transitions. [2019-11-15 23:52:57,604 INFO L78 Accepts]: Start accepts. Automaton has 14806 states and 23042 transitions. Word has length 23 [2019-11-15 23:52:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:57,604 INFO L462 AbstractCegarLoop]: Abstraction has 14806 states and 23042 transitions. [2019-11-15 23:52:57,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14806 states and 23042 transitions. [2019-11-15 23:52:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:52:57,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:57,606 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:57,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2046252058, now seen corresponding path program 1 times [2019-11-15 23:52:57,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:57,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411951045] [2019-11-15 23:52:57,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:57,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411951045] [2019-11-15 23:52:57,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:57,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:57,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826543857] [2019-11-15 23:52:57,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:57,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:57,698 INFO L87 Difference]: Start difference. First operand 14806 states and 23042 transitions. Second operand 3 states. [2019-11-15 23:53:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:02,823 INFO L93 Difference]: Finished difference Result 37336 states and 57904 transitions. [2019-11-15 23:53:02,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:02,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:53:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:02,867 INFO L225 Difference]: With dead ends: 37336 [2019-11-15 23:53:02,868 INFO L226 Difference]: Without dead ends: 22266 [2019-11-15 23:53:02,886 INFO L600 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-11-15 23:53:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22266 states. [2019-11-15 23:53:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22266 to 21072. [2019-11-15 23:53:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21072 states. [2019-11-15 23:53:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21072 states to 21072 states and 32684 transitions. [2019-11-15 23:53:03,240 INFO L78 Accepts]: Start accepts. Automaton has 21072 states and 32684 transitions. Word has length 25 [2019-11-15 23:53:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:03,241 INFO L462 AbstractCegarLoop]: Abstraction has 21072 states and 32684 transitions. [2019-11-15 23:53:03,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21072 states and 32684 transitions. [2019-11-15 23:53:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:53:03,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:03,243 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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-11-15 23:53:03,243 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1701022621, now seen corresponding path program 1 times [2019-11-15 23:53:03,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:03,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092215091] [2019-11-15 23:53:03,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:03,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:03,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:03,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092215091] [2019-11-15 23:53:03,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:03,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:03,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993621593] [2019-11-15 23:53:03,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:03,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:03,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:03,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:03,345 INFO L87 Difference]: Start difference. First operand 21072 states and 32684 transitions. Second operand 3 states. [2019-11-15 23:53:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:09,254 INFO L93 Difference]: Finished difference Result 63170 states and 97974 transitions. [2019-11-15 23:53:09,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:09,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 23:53:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:09,404 INFO L225 Difference]: With dead ends: 63170 [2019-11-15 23:53:09,405 INFO L226 Difference]: Without dead ends: 42106 [2019-11-15 23:53:09,426 INFO L600 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-11-15 23:53:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42106 states. [2019-11-15 23:53:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42106 to 40080. [2019-11-15 23:53:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40080 states. [2019-11-15 23:53:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40080 states to 40080 states and 63058 transitions. [2019-11-15 23:53:10,018 INFO L78 Accepts]: Start accepts. Automaton has 40080 states and 63058 transitions. Word has length 30 [2019-11-15 23:53:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:10,020 INFO L462 AbstractCegarLoop]: Abstraction has 40080 states and 63058 transitions. [2019-11-15 23:53:10,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 40080 states and 63058 transitions. [2019-11-15 23:53:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:53:10,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:10,024 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:10,024 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash -421428809, now seen corresponding path program 1 times [2019-11-15 23:53:10,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:10,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351727689] [2019-11-15 23:53:10,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:10,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:10,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:10,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351727689] [2019-11-15 23:53:10,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:10,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:10,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263853049] [2019-11-15 23:53:10,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:10,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:10,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:10,121 INFO L87 Difference]: Start difference. First operand 40080 states and 63058 transitions. Second operand 3 states. [2019-11-15 23:53:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:13,880 INFO L93 Difference]: Finished difference Result 107942 states and 170044 transitions. [2019-11-15 23:53:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:13,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:53:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:13,964 INFO L225 Difference]: With dead ends: 107942 [2019-11-15 23:53:13,964 INFO L226 Difference]: Without dead ends: 67822 [2019-11-15 23:53:13,992 INFO L600 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-11-15 23:53:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67822 states. [2019-11-15 23:53:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67822 to 66148. [2019-11-15 23:53:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66148 states. [2019-11-15 23:53:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66148 states to 66148 states and 104778 transitions. [2019-11-15 23:53:14,776 INFO L78 Accepts]: Start accepts. Automaton has 66148 states and 104778 transitions. Word has length 39 [2019-11-15 23:53:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:14,777 INFO L462 AbstractCegarLoop]: Abstraction has 66148 states and 104778 transitions. [2019-11-15 23:53:14,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 66148 states and 104778 transitions. [2019-11-15 23:53:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:53:14,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:14,777 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:14,778 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1116669619, now seen corresponding path program 1 times [2019-11-15 23:53:14,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:14,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104241066] [2019-11-15 23:53:14,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:14,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:14,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:53:14,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104241066] [2019-11-15 23:53:14,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:14,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:14,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829776073] [2019-11-15 23:53:14,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:14,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:14,853 INFO L87 Difference]: Start difference. First operand 66148 states and 104778 transitions. Second operand 3 states. [2019-11-15 23:53:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:16,455 INFO L93 Difference]: Finished difference Result 132340 states and 209618 transitions. [2019-11-15 23:53:16,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:16,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 23:53:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:16,541 INFO L225 Difference]: With dead ends: 132340 [2019-11-15 23:53:16,541 INFO L226 Difference]: Without dead ends: 66200 [2019-11-15 23:53:16,589 INFO L600 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-11-15 23:53:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66200 states. [2019-11-15 23:53:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66200 to 66198. [2019-11-15 23:53:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66198 states. [2019-11-15 23:53:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66198 states to 66198 states and 104828 transitions. [2019-11-15 23:53:17,359 INFO L78 Accepts]: Start accepts. Automaton has 66198 states and 104828 transitions. Word has length 43 [2019-11-15 23:53:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:17,359 INFO L462 AbstractCegarLoop]: Abstraction has 66198 states and 104828 transitions. [2019-11-15 23:53:17,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66198 states and 104828 transitions. [2019-11-15 23:53:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:53:17,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:17,360 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:17,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1299656225, now seen corresponding path program 1 times [2019-11-15 23:53:17,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:17,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496503005] [2019-11-15 23:53:17,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:17,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:17,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:17,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496503005] [2019-11-15 23:53:17,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:17,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:17,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723022834] [2019-11-15 23:53:17,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:17,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:17,535 INFO L87 Difference]: Start difference. First operand 66198 states and 104828 transitions. Second operand 4 states. [2019-11-15 23:53:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:24,010 INFO L93 Difference]: Finished difference Result 126785 states and 200685 transitions. [2019-11-15 23:53:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:24,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:53:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:24,095 INFO L225 Difference]: With dead ends: 126785 [2019-11-15 23:53:24,096 INFO L226 Difference]: Without dead ends: 66492 [2019-11-15 23:53:24,121 INFO L600 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-11-15 23:53:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66492 states. [2019-11-15 23:53:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66492 to 63918. [2019-11-15 23:53:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63918 states. [2019-11-15 23:53:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63918 states to 63918 states and 99848 transitions. [2019-11-15 23:53:24,772 INFO L78 Accepts]: Start accepts. Automaton has 63918 states and 99848 transitions. Word has length 52 [2019-11-15 23:53:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:24,772 INFO L462 AbstractCegarLoop]: Abstraction has 63918 states and 99848 transitions. [2019-11-15 23:53:24,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 63918 states and 99848 transitions. [2019-11-15 23:53:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:53:24,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:24,774 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:24,774 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1610447069, now seen corresponding path program 1 times [2019-11-15 23:53:24,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:24,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478792816] [2019-11-15 23:53:24,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:24,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:24,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:53:24,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478792816] [2019-11-15 23:53:24,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:24,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:24,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52035104] [2019-11-15 23:53:24,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:24,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:24,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:24,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:24,856 INFO L87 Difference]: Start difference. First operand 63918 states and 99848 transitions. Second operand 3 states. [2019-11-15 23:53:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:26,224 INFO L93 Difference]: Finished difference Result 127890 states and 199778 transitions. [2019-11-15 23:53:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:26,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 23:53:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:26,302 INFO L225 Difference]: With dead ends: 127890 [2019-11-15 23:53:26,302 INFO L226 Difference]: Without dead ends: 63980 [2019-11-15 23:53:26,332 INFO L600 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-11-15 23:53:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63980 states. [2019-11-15 23:53:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63980 to 63978. [2019-11-15 23:53:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63978 states. [2019-11-15 23:53:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63978 states to 63978 states and 99908 transitions. [2019-11-15 23:53:26,943 INFO L78 Accepts]: Start accepts. Automaton has 63978 states and 99908 transitions. Word has length 53 [2019-11-15 23:53:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:26,943 INFO L462 AbstractCegarLoop]: Abstraction has 63978 states and 99908 transitions. [2019-11-15 23:53:26,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 63978 states and 99908 transitions. [2019-11-15 23:53:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:53:26,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:26,945 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:26,945 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2089054241, now seen corresponding path program 1 times [2019-11-15 23:53:26,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:26,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124143122] [2019-11-15 23:53:26,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:26,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:26,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:53:27,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124143122] [2019-11-15 23:53:27,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:27,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:27,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369347178] [2019-11-15 23:53:27,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:27,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:27,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:27,032 INFO L87 Difference]: Start difference. First operand 63978 states and 99908 transitions. Second operand 4 states. [2019-11-15 23:53:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:31,526 INFO L93 Difference]: Finished difference Result 116798 states and 181838 transitions. [2019-11-15 23:53:31,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:31,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 23:53:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:31,593 INFO L225 Difference]: With dead ends: 116798 [2019-11-15 23:53:31,593 INFO L226 Difference]: Without dead ends: 64988 [2019-11-15 23:53:31,611 INFO L600 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-11-15 23:53:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64988 states. [2019-11-15 23:53:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64988 to 63722. [2019-11-15 23:53:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63722 states. [2019-11-15 23:53:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63722 states to 63722 states and 98884 transitions. [2019-11-15 23:53:32,170 INFO L78 Accepts]: Start accepts. Automaton has 63722 states and 98884 transitions. Word has length 58 [2019-11-15 23:53:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:32,171 INFO L462 AbstractCegarLoop]: Abstraction has 63722 states and 98884 transitions. [2019-11-15 23:53:32,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 63722 states and 98884 transitions. [2019-11-15 23:53:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:53:32,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:32,172 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:32,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1311774324, now seen corresponding path program 1 times [2019-11-15 23:53:32,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:32,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818492903] [2019-11-15 23:53:32,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:32,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:32,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:32,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818492903] [2019-11-15 23:53:32,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:32,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:32,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313198774] [2019-11-15 23:53:32,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:32,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:32,274 INFO L87 Difference]: Start difference. First operand 63722 states and 98884 transitions. Second operand 3 states. [2019-11-15 23:53:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:36,730 INFO L93 Difference]: Finished difference Result 129850 states and 200364 transitions. [2019-11-15 23:53:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:36,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 23:53:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:36,809 INFO L225 Difference]: With dead ends: 129850 [2019-11-15 23:53:36,809 INFO L226 Difference]: Without dead ends: 66096 [2019-11-15 23:53:36,838 INFO L600 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-11-15 23:53:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66096 states. [2019-11-15 23:53:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66096 to 63402. [2019-11-15 23:53:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63402 states. [2019-11-15 23:53:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63402 states to 63402 states and 98164 transitions. [2019-11-15 23:53:37,421 INFO L78 Accepts]: Start accepts. Automaton has 63402 states and 98164 transitions. Word has length 64 [2019-11-15 23:53:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 63402 states and 98164 transitions. [2019-11-15 23:53:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 63402 states and 98164 transitions. [2019-11-15 23:53:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:53:37,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:37,422 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:37,423 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1468274043, now seen corresponding path program 1 times [2019-11-15 23:53:37,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:37,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756755121] [2019-11-15 23:53:37,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:37,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:37,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:37,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756755121] [2019-11-15 23:53:37,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:37,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:37,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499886728] [2019-11-15 23:53:37,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:37,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:37,547 INFO L87 Difference]: Start difference. First operand 63402 states and 98164 transitions. Second operand 3 states. [2019-11-15 23:53:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:43,087 INFO L93 Difference]: Finished difference Result 103470 states and 158960 transitions. [2019-11-15 23:53:43,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:43,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-15 23:53:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:43,160 INFO L225 Difference]: With dead ends: 103470 [2019-11-15 23:53:43,160 INFO L226 Difference]: Without dead ends: 76820 [2019-11-15 23:53:43,175 INFO L600 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-11-15 23:53:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76820 states. [2019-11-15 23:53:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76820 to 74946. [2019-11-15 23:53:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74946 states. [2019-11-15 23:53:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74946 states to 74946 states and 116158 transitions. [2019-11-15 23:53:43,789 INFO L78 Accepts]: Start accepts. Automaton has 74946 states and 116158 transitions. Word has length 74 [2019-11-15 23:53:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:43,790 INFO L462 AbstractCegarLoop]: Abstraction has 74946 states and 116158 transitions. [2019-11-15 23:53:43,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 74946 states and 116158 transitions. [2019-11-15 23:53:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:53:43,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:43,791 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:43,792 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1736777499, now seen corresponding path program 1 times [2019-11-15 23:53:43,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:43,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417195263] [2019-11-15 23:53:43,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:43,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:43,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:53:43,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417195263] [2019-11-15 23:53:43,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:43,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:43,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687705869] [2019-11-15 23:53:43,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:43,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:43,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:43,885 INFO L87 Difference]: Start difference. First operand 74946 states and 116158 transitions. Second operand 3 states. [2019-11-15 23:53:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:45,351 INFO L93 Difference]: Finished difference Result 143371 states and 222219 transitions. [2019-11-15 23:53:45,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:45,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-15 23:53:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:45,426 INFO L225 Difference]: With dead ends: 143371 [2019-11-15 23:53:45,426 INFO L226 Difference]: Without dead ends: 68433 [2019-11-15 23:53:45,458 INFO L600 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-11-15 23:53:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68433 states. [2019-11-15 23:53:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68433 to 68431. [2019-11-15 23:53:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68431 states. [2019-11-15 23:53:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68431 states to 68431 states and 106021 transitions. [2019-11-15 23:53:46,049 INFO L78 Accepts]: Start accepts. Automaton has 68431 states and 106021 transitions. Word has length 81 [2019-11-15 23:53:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:46,049 INFO L462 AbstractCegarLoop]: Abstraction has 68431 states and 106021 transitions. [2019-11-15 23:53:46,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 68431 states and 106021 transitions. [2019-11-15 23:53:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:53:46,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:46,052 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:46,052 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1749163296, now seen corresponding path program 1 times [2019-11-15 23:53:46,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:46,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434125419] [2019-11-15 23:53:46,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:46,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:46,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:53:46,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434125419] [2019-11-15 23:53:46,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:46,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:53:46,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784632118] [2019-11-15 23:53:46,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:53:46,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:53:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:53:46,132 INFO L87 Difference]: Start difference. First operand 68431 states and 106021 transitions. Second operand 3 states. [2019-11-15 23:53:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:47,431 INFO L93 Difference]: Finished difference Result 136168 states and 210970 transitions. [2019-11-15 23:53:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:53:47,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 23:53:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:47,507 INFO L225 Difference]: With dead ends: 136168 [2019-11-15 23:53:47,507 INFO L226 Difference]: Without dead ends: 68529 [2019-11-15 23:53:47,537 INFO L600 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-11-15 23:53:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68529 states. [2019-11-15 23:53:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68529 to 68527. [2019-11-15 23:53:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68527 states. [2019-11-15 23:53:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68527 states to 68527 states and 106117 transitions. [2019-11-15 23:53:48,164 INFO L78 Accepts]: Start accepts. Automaton has 68527 states and 106117 transitions. Word has length 84 [2019-11-15 23:53:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:48,165 INFO L462 AbstractCegarLoop]: Abstraction has 68527 states and 106117 transitions. [2019-11-15 23:53:48,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:53:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 68527 states and 106117 transitions. [2019-11-15 23:53:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:53:48,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:48,166 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:48,167 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:48,167 INFO L82 PathProgramCache]: Analyzing trace with hash 668432337, now seen corresponding path program 1 times [2019-11-15 23:53:48,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:48,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982019773] [2019-11-15 23:53:48,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:48,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:48,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:48,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982019773] [2019-11-15 23:53:48,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:48,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:48,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669828919] [2019-11-15 23:53:48,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:48,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:48,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:48,359 INFO L87 Difference]: Start difference. First operand 68527 states and 106117 transitions. Second operand 4 states. [2019-11-15 23:53:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:53,585 INFO L93 Difference]: Finished difference Result 93509 states and 143768 transitions. [2019-11-15 23:53:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:53,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:53:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:53,633 INFO L225 Difference]: With dead ends: 93509 [2019-11-15 23:53:53,634 INFO L226 Difference]: Without dead ends: 47150 [2019-11-15 23:53:53,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47150 states. [2019-11-15 23:53:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47150 to 45905. [2019-11-15 23:53:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45905 states. [2019-11-15 23:53:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45905 states to 45905 states and 70582 transitions. [2019-11-15 23:53:54,118 INFO L78 Accepts]: Start accepts. Automaton has 45905 states and 70582 transitions. Word has length 88 [2019-11-15 23:53:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:54,119 INFO L462 AbstractCegarLoop]: Abstraction has 45905 states and 70582 transitions. [2019-11-15 23:53:54,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45905 states and 70582 transitions. [2019-11-15 23:53:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:53:54,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:54,120 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:53:54,120 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1526878815, now seen corresponding path program 1 times [2019-11-15 23:53:54,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:54,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830804182] [2019-11-15 23:53:54,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:54,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:54,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:54,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830804182] [2019-11-15 23:53:54,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:54,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:54,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8802462] [2019-11-15 23:53:54,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:54,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:54,301 INFO L87 Difference]: Start difference. First operand 45905 states and 70582 transitions. Second operand 4 states. [2019-11-15 23:53:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:59,826 INFO L93 Difference]: Finished difference Result 59587 states and 90513 transitions. [2019-11-15 23:53:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:59,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:53:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:59,866 INFO L225 Difference]: With dead ends: 59587 [2019-11-15 23:53:59,867 INFO L226 Difference]: Without dead ends: 35850 [2019-11-15 23:53:59,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-11-15 23:54:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 34605. [2019-11-15 23:54:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34605 states. [2019-11-15 23:54:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34605 states to 34605 states and 52922 transitions. [2019-11-15 23:54:00,207 INFO L78 Accepts]: Start accepts. Automaton has 34605 states and 52922 transitions. Word has length 90 [2019-11-15 23:54:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:00,207 INFO L462 AbstractCegarLoop]: Abstraction has 34605 states and 52922 transitions. [2019-11-15 23:54:00,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34605 states and 52922 transitions. [2019-11-15 23:54:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:54:00,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:00,209 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:00,210 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash -447066393, now seen corresponding path program 1 times [2019-11-15 23:54:00,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:00,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809689696] [2019-11-15 23:54:00,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:00,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:00,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:00,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809689696] [2019-11-15 23:54:00,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:00,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:00,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383509793] [2019-11-15 23:54:00,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:00,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:00,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:00,288 INFO L87 Difference]: Start difference. First operand 34605 states and 52922 transitions. Second operand 3 states. [2019-11-15 23:54:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:01,659 INFO L93 Difference]: Finished difference Result 35778 states and 54653 transitions. [2019-11-15 23:54:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:01,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 23:54:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:01,696 INFO L225 Difference]: With dead ends: 35778 [2019-11-15 23:54:01,696 INFO L226 Difference]: Without dead ends: 35776 [2019-11-15 23:54:01,703 INFO L600 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-11-15 23:54:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35776 states. [2019-11-15 23:54:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35776 to 35770. [2019-11-15 23:54:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35770 states. [2019-11-15 23:54:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35770 states to 35770 states and 54635 transitions. [2019-11-15 23:54:02,020 INFO L78 Accepts]: Start accepts. Automaton has 35770 states and 54635 transitions. Word has length 98 [2019-11-15 23:54:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:02,020 INFO L462 AbstractCegarLoop]: Abstraction has 35770 states and 54635 transitions. [2019-11-15 23:54:02,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 35770 states and 54635 transitions. [2019-11-15 23:54:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:54:02,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:02,023 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:02,023 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash 42027815, now seen corresponding path program 1 times [2019-11-15 23:54:02,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:02,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137956482] [2019-11-15 23:54:02,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:02,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:02,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:02,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137956482] [2019-11-15 23:54:02,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:02,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:02,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434189046] [2019-11-15 23:54:02,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:02,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:02,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:02,098 INFO L87 Difference]: Start difference. First operand 35770 states and 54635 transitions. Second operand 3 states. [2019-11-15 23:54:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:03,549 INFO L93 Difference]: Finished difference Result 60064 states and 91592 transitions. [2019-11-15 23:54:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:03,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 23:54:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:03,585 INFO L225 Difference]: With dead ends: 60064 [2019-11-15 23:54:03,585 INFO L226 Difference]: Without dead ends: 35466 [2019-11-15 23:54:03,597 INFO L600 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-11-15 23:54:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35466 states. [2019-11-15 23:54:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35466 to 35466. [2019-11-15 23:54:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2019-11-15 23:54:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 53873 transitions. [2019-11-15 23:54:03,918 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 53873 transitions. Word has length 99 [2019-11-15 23:54:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:03,918 INFO L462 AbstractCegarLoop]: Abstraction has 35466 states and 53873 transitions. [2019-11-15 23:54:03,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 53873 transitions. [2019-11-15 23:54:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 23:54:03,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:03,921 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:03,922 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -602210607, now seen corresponding path program 1 times [2019-11-15 23:54:03,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:03,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605768793] [2019-11-15 23:54:03,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:03,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:03,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:04,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605768793] [2019-11-15 23:54:04,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:04,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:04,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866738496] [2019-11-15 23:54:04,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:04,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:04,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:04,107 INFO L87 Difference]: Start difference. First operand 35466 states and 53873 transitions. Second operand 4 states. [2019-11-15 23:54:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:08,973 INFO L93 Difference]: Finished difference Result 42478 states and 64025 transitions. [2019-11-15 23:54:08,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:08,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-15 23:54:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:09,019 INFO L225 Difference]: With dead ends: 42478 [2019-11-15 23:54:09,019 INFO L226 Difference]: Without dead ends: 42406 [2019-11-15 23:54:09,026 INFO L600 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-11-15 23:54:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42406 states. [2019-11-15 23:54:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42406 to 41267. [2019-11-15 23:54:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41267 states. [2019-11-15 23:54:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41267 states to 41267 states and 62728 transitions. [2019-11-15 23:54:09,389 INFO L78 Accepts]: Start accepts. Automaton has 41267 states and 62728 transitions. Word has length 112 [2019-11-15 23:54:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:09,390 INFO L462 AbstractCegarLoop]: Abstraction has 41267 states and 62728 transitions. [2019-11-15 23:54:09,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41267 states and 62728 transitions. [2019-11-15 23:54:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 23:54:09,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:09,393 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:09,393 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash -930949646, now seen corresponding path program 1 times [2019-11-15 23:54:09,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:09,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125468426] [2019-11-15 23:54:09,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:09,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:09,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:54:09,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125468426] [2019-11-15 23:54:09,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:09,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:09,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582315411] [2019-11-15 23:54:09,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:09,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:09,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:09,471 INFO L87 Difference]: Start difference. First operand 41267 states and 62728 transitions. Second operand 3 states. [2019-11-15 23:54:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:10,449 INFO L93 Difference]: Finished difference Result 70593 states and 107045 transitions. [2019-11-15 23:54:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:10,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-15 23:54:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:10,482 INFO L225 Difference]: With dead ends: 70593 [2019-11-15 23:54:10,482 INFO L226 Difference]: Without dead ends: 31456 [2019-11-15 23:54:10,498 INFO L600 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-11-15 23:54:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31456 states. [2019-11-15 23:54:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31456 to 31454. [2019-11-15 23:54:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31454 states. [2019-11-15 23:54:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31454 states to 31454 states and 47429 transitions. [2019-11-15 23:54:10,780 INFO L78 Accepts]: Start accepts. Automaton has 31454 states and 47429 transitions. Word has length 114 [2019-11-15 23:54:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:10,780 INFO L462 AbstractCegarLoop]: Abstraction has 31454 states and 47429 transitions. [2019-11-15 23:54:10,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 31454 states and 47429 transitions. [2019-11-15 23:54:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 23:54:10,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:10,783 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:10,783 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:10,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1870082462, now seen corresponding path program 1 times [2019-11-15 23:54:10,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:10,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553285998] [2019-11-15 23:54:10,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:11,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553285998] [2019-11-15 23:54:11,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:11,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:11,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089750437] [2019-11-15 23:54:11,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:11,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:11,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:11,076 INFO L87 Difference]: Start difference. First operand 31454 states and 47429 transitions. Second operand 4 states. [2019-11-15 23:54:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:18,652 INFO L93 Difference]: Finished difference Result 46689 states and 68857 transitions. [2019-11-15 23:54:18,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:18,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-15 23:54:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:18,689 INFO L225 Difference]: With dead ends: 46689 [2019-11-15 23:54:18,689 INFO L226 Difference]: Without dead ends: 33800 [2019-11-15 23:54:18,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33800 states. [2019-11-15 23:54:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33800 to 25127. [2019-11-15 23:54:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25127 states. [2019-11-15 23:54:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25127 states to 25127 states and 37661 transitions. [2019-11-15 23:54:18,980 INFO L78 Accepts]: Start accepts. Automaton has 25127 states and 37661 transitions. Word has length 118 [2019-11-15 23:54:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:18,980 INFO L462 AbstractCegarLoop]: Abstraction has 25127 states and 37661 transitions. [2019-11-15 23:54:18,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 25127 states and 37661 transitions. [2019-11-15 23:54:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-15 23:54:18,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:18,984 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:18,984 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:18,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1991972653, now seen corresponding path program 1 times [2019-11-15 23:54:18,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:18,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591440485] [2019-11-15 23:54:18,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:18,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:18,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:19,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591440485] [2019-11-15 23:54:19,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:19,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:19,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217384613] [2019-11-15 23:54:19,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:19,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:19,234 INFO L87 Difference]: Start difference. First operand 25127 states and 37661 transitions. Second operand 3 states. [2019-11-15 23:54:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:20,123 INFO L93 Difference]: Finished difference Result 46628 states and 70013 transitions. [2019-11-15 23:54:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:20,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-15 23:54:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:20,145 INFO L225 Difference]: With dead ends: 46628 [2019-11-15 23:54:20,145 INFO L226 Difference]: Without dead ends: 23023 [2019-11-15 23:54:20,156 INFO L600 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-11-15 23:54:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23023 states. [2019-11-15 23:54:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23023 to 23021. [2019-11-15 23:54:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23021 states. [2019-11-15 23:54:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23021 states to 23021 states and 34510 transitions. [2019-11-15 23:54:20,343 INFO L78 Accepts]: Start accepts. Automaton has 23021 states and 34510 transitions. Word has length 136 [2019-11-15 23:54:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:20,343 INFO L462 AbstractCegarLoop]: Abstraction has 23021 states and 34510 transitions. [2019-11-15 23:54:20,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23021 states and 34510 transitions. [2019-11-15 23:54:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 23:54:20,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:20,345 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:20,346 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1587573456, now seen corresponding path program 1 times [2019-11-15 23:54:20,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:20,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282714567] [2019-11-15 23:54:20,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:20,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:20,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:20,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282714567] [2019-11-15 23:54:20,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:20,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:20,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014837369] [2019-11-15 23:54:20,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:20,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:20,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:20,431 INFO L87 Difference]: Start difference. First operand 23021 states and 34510 transitions. Second operand 3 states. [2019-11-15 23:54:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:21,299 INFO L93 Difference]: Finished difference Result 39201 states and 58798 transitions. [2019-11-15 23:54:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:21,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-15 23:54:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:21,317 INFO L225 Difference]: With dead ends: 39201 [2019-11-15 23:54:21,317 INFO L226 Difference]: Without dead ends: 18276 [2019-11-15 23:54:21,327 INFO L600 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-11-15 23:54:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-11-15 23:54:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 18274. [2019-11-15 23:54:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-11-15 23:54:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 27278 transitions. [2019-11-15 23:54:21,474 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 27278 transitions. Word has length 138 [2019-11-15 23:54:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:21,474 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 27278 transitions. [2019-11-15 23:54:21,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 27278 transitions. [2019-11-15 23:54:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-15 23:54:21,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:21,481 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:21,481 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash -986919862, now seen corresponding path program 1 times [2019-11-15 23:54:21,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:21,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884210942] [2019-11-15 23:54:21,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:21,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:21,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884210942] [2019-11-15 23:54:21,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:21,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:21,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113345035] [2019-11-15 23:54:21,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:21,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:21,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:21,738 INFO L87 Difference]: Start difference. First operand 18274 states and 27278 transitions. Second operand 4 states. [2019-11-15 23:54:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:26,164 INFO L93 Difference]: Finished difference Result 31236 states and 46451 transitions. [2019-11-15 23:54:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:26,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-15 23:54:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:26,198 INFO L225 Difference]: With dead ends: 31236 [2019-11-15 23:54:26,198 INFO L226 Difference]: Without dead ends: 31166 [2019-11-15 23:54:26,204 INFO L600 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-11-15 23:54:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31166 states. [2019-11-15 23:54:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31166 to 29812. [2019-11-15 23:54:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29812 states. [2019-11-15 23:54:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29812 states to 29812 states and 44886 transitions. [2019-11-15 23:54:26,493 INFO L78 Accepts]: Start accepts. Automaton has 29812 states and 44886 transitions. Word has length 142 [2019-11-15 23:54:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:26,494 INFO L462 AbstractCegarLoop]: Abstraction has 29812 states and 44886 transitions. [2019-11-15 23:54:26,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 29812 states and 44886 transitions. [2019-11-15 23:54:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-15 23:54:26,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:26,497 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:26,497 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 119023117, now seen corresponding path program 1 times [2019-11-15 23:54:26,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:26,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995645171] [2019-11-15 23:54:26,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:26,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:26,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995645171] [2019-11-15 23:54:26,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:26,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:26,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404236513] [2019-11-15 23:54:26,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:26,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:26,592 INFO L87 Difference]: Start difference. First operand 29812 states and 44886 transitions. Second operand 3 states. [2019-11-15 23:54:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:27,496 INFO L93 Difference]: Finished difference Result 54280 states and 82053 transitions. [2019-11-15 23:54:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:27,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-15 23:54:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:27,526 INFO L225 Difference]: With dead ends: 54280 [2019-11-15 23:54:27,526 INFO L226 Difference]: Without dead ends: 28620 [2019-11-15 23:54:27,539 INFO L600 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-11-15 23:54:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28620 states. [2019-11-15 23:54:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28620 to 28618. [2019-11-15 23:54:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28618 states. [2019-11-15 23:54:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28618 states to 28618 states and 43085 transitions. [2019-11-15 23:54:27,803 INFO L78 Accepts]: Start accepts. Automaton has 28618 states and 43085 transitions. Word has length 144 [2019-11-15 23:54:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:27,803 INFO L462 AbstractCegarLoop]: Abstraction has 28618 states and 43085 transitions. [2019-11-15 23:54:27,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28618 states and 43085 transitions. [2019-11-15 23:54:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 23:54:27,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:27,806 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:27,806 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1059270226, now seen corresponding path program 1 times [2019-11-15 23:54:27,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:27,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017342702] [2019-11-15 23:54:27,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:27,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:27,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:27,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017342702] [2019-11-15 23:54:27,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:27,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:27,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904337915] [2019-11-15 23:54:27,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:27,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:27,888 INFO L87 Difference]: Start difference. First operand 28618 states and 43085 transitions. Second operand 3 states. [2019-11-15 23:54:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:28,808 INFO L93 Difference]: Finished difference Result 53161 states and 80312 transitions. [2019-11-15 23:54:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:28,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-15 23:54:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:28,837 INFO L225 Difference]: With dead ends: 53161 [2019-11-15 23:54:28,837 INFO L226 Difference]: Without dead ends: 28695 [2019-11-15 23:54:28,849 INFO L600 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-11-15 23:54:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-11-15 23:54:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 28693. [2019-11-15 23:54:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28693 states. [2019-11-15 23:54:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28693 states to 28693 states and 43160 transitions. [2019-11-15 23:54:29,098 INFO L78 Accepts]: Start accepts. Automaton has 28693 states and 43160 transitions. Word has length 148 [2019-11-15 23:54:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:29,099 INFO L462 AbstractCegarLoop]: Abstraction has 28693 states and 43160 transitions. [2019-11-15 23:54:29,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states and 43160 transitions. [2019-11-15 23:54:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 23:54:29,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:29,102 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:29,102 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1097377653, now seen corresponding path program 1 times [2019-11-15 23:54:29,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:29,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585427273] [2019-11-15 23:54:29,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:29,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:29,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:29,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585427273] [2019-11-15 23:54:29,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:29,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:29,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345787251] [2019-11-15 23:54:29,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:29,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:29,196 INFO L87 Difference]: Start difference. First operand 28693 states and 43160 transitions. Second operand 3 states. [2019-11-15 23:54:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:29,962 INFO L93 Difference]: Finished difference Result 47539 states and 71811 transitions. [2019-11-15 23:54:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:29,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-15 23:54:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:29,985 INFO L225 Difference]: With dead ends: 47539 [2019-11-15 23:54:29,985 INFO L226 Difference]: Without dead ends: 22998 [2019-11-15 23:54:29,995 INFO L600 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-11-15 23:54:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22998 states. [2019-11-15 23:54:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22998 to 22996. [2019-11-15 23:54:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22996 states. [2019-11-15 23:54:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22996 states to 22996 states and 34564 transitions. [2019-11-15 23:54:30,198 INFO L78 Accepts]: Start accepts. Automaton has 22996 states and 34564 transitions. Word has length 178 [2019-11-15 23:54:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:30,198 INFO L462 AbstractCegarLoop]: Abstraction has 22996 states and 34564 transitions. [2019-11-15 23:54:30,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22996 states and 34564 transitions. [2019-11-15 23:54:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 23:54:30,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:30,201 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:30,202 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:30,202 INFO L82 PathProgramCache]: Analyzing trace with hash -73762474, now seen corresponding path program 1 times [2019-11-15 23:54:30,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:30,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764233755] [2019-11-15 23:54:30,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:30,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:30,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:30,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764233755] [2019-11-15 23:54:30,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:30,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:30,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086246380] [2019-11-15 23:54:30,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:30,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:30,302 INFO L87 Difference]: Start difference. First operand 22996 states and 34564 transitions. Second operand 3 states. [2019-11-15 23:54:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:30,627 INFO L93 Difference]: Finished difference Result 23980 states and 35952 transitions. [2019-11-15 23:54:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:30,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-15 23:54:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:30,632 INFO L225 Difference]: With dead ends: 23980 [2019-11-15 23:54:30,632 INFO L226 Difference]: Without dead ends: 5144 [2019-11-15 23:54:30,638 INFO L600 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-11-15 23:54:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2019-11-15 23:54:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 5142. [2019-11-15 23:54:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5142 states. [2019-11-15 23:54:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 7332 transitions. [2019-11-15 23:54:30,693 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 7332 transitions. Word has length 183 [2019-11-15 23:54:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:30,694 INFO L462 AbstractCegarLoop]: Abstraction has 5142 states and 7332 transitions. [2019-11-15 23:54:30,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 7332 transitions. [2019-11-15 23:54:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:54:30,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:30,699 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:54:30,699 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash 216076711, now seen corresponding path program 1 times [2019-11-15 23:54:30,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:30,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804889810] [2019-11-15 23:54:30,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:30,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:30,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:31,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804889810] [2019-11-15 23:54:31,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:31,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:31,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270012883] [2019-11-15 23:54:31,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:31,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:31,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:31,098 INFO L87 Difference]: Start difference. First operand 5142 states and 7332 transitions. Second operand 5 states. [2019-11-15 23:54:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:32,714 INFO L93 Difference]: Finished difference Result 6364 states and 9047 transitions. [2019-11-15 23:54:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:54:32,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-11-15 23:54:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:32,719 INFO L225 Difference]: With dead ends: 6364 [2019-11-15 23:54:32,719 INFO L226 Difference]: Without dead ends: 6354 [2019-11-15 23:54:32,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2019-11-15 23:54:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 5704. [2019-11-15 23:54:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-11-15 23:54:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8136 transitions. [2019-11-15 23:54:32,770 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8136 transitions. Word has length 186 [2019-11-15 23:54:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:32,770 INFO L462 AbstractCegarLoop]: Abstraction has 5704 states and 8136 transitions. [2019-11-15 23:54:32,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8136 transitions. [2019-11-15 23:54:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 23:54:32,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:32,774 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:32,774 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:32,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:32,775 INFO L82 PathProgramCache]: Analyzing trace with hash -621968245, now seen corresponding path program 1 times [2019-11-15 23:54:32,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:32,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920368332] [2019-11-15 23:54:32,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:32,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:32,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:33,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:33,115 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:54:33,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:54:33 BoogieIcfgContainer [2019-11-15 23:54:33,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:54:33,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:54:33,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:54:33,327 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:54:33,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:39" (3/4) ... [2019-11-15 23:54:33,330 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:54:33,532 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a6dd024-c434-4e6e-bb3f-8d8dbe6b8764/bin/uautomizer/witness.graphml [2019-11-15 23:54:33,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:54:33,535 INFO L168 Benchmark]: Toolchain (without parser) took 136705.00 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 885.7 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,535 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:33,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3344.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 885.7 MB in the beginning and 929.4 MB in the end (delta: -43.8 MB). Peak memory consumption was 448.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 596.85 ms. Allocated memory is still 1.2 GB. Free memory was 929.4 MB in the beginning and 761.8 MB in the end (delta: 167.7 MB). Peak memory consumption was 167.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,536 INFO L168 Benchmark]: Boogie Preprocessor took 1457.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 242.7 MB). Free memory was 761.8 MB in the beginning and 1.2 GB in the end (delta: -392.4 MB). Peak memory consumption was 299.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,537 INFO L168 Benchmark]: RCFGBuilder took 17323.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 961.0 MB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -697.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,537 INFO L168 Benchmark]: TraceAbstraction took 113773.66 ms. Allocated memory was 2.4 GB in the beginning and 4.8 GB in the end (delta: 2.3 GB). Free memory was 1.9 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 513.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,538 INFO L168 Benchmark]: Witness Printer took 205.33 ms. Allocated memory is still 4.8 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:33,540 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 3344.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 885.7 MB in the beginning and 929.4 MB in the end (delta: -43.8 MB). Peak memory consumption was 448.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 596.85 ms. Allocated memory is still 1.2 GB. Free memory was 929.4 MB in the beginning and 761.8 MB in the end (delta: 167.7 MB). Peak memory consumption was 167.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 1457.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 242.7 MB). Free memory was 761.8 MB in the beginning and 1.2 GB in the end (delta: -392.4 MB). Peak memory consumption was 299.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17323.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 961.0 MB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -697.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * TraceAbstraction took 113773.66 ms. Allocated memory was 2.4 GB in the beginning and 4.8 GB in the end (delta: 2.3 GB). Free memory was 1.9 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 513.7 MB. Max. memory is 11.5 GB. * Witness Printer took 205.33 ms. Allocated memory is still 4.8 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49138]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_getInetAddress = 1; [L6] int m_getOOBInline = 2; [L7] int m_getLocalPort = 3; [L8] int m_isInputShutdown = 4; [L9] int m_setTcpNoDelay = 5; [L10] int m_isConnected = 6; [L11] int m_getKeepAlive = 7; [L12] int m_getLocalAddress = 8; [L13] int m_bind = 9; [L14] int m_getChannel = 10; [L15] int m_getSoLinger = 11; [L16] int m_getImpl = 12; [L17] int m_getTcpNoDelay = 13; [L18] int m_getSoTimeout = 14; [L19] int m_isOutputShutdown = 15; [L20] int m_postAccept = 16; [L21] int m_close = 17; [L22] int m_setOOBInline = 18; [L23] int m_getLocalSocketAddress = 19; [L24] int m_getReceiveBufferSize = 20; [L25] int m_setReuseAddress = 21; [L26] int m_getTrafficClass = 22; [L27] int m_getReuseAddress = 23; [L28] int m_createImpl = 24; [L29] int m_setCreated = 25; [L30] int m_setKeepAlive = 26; [L31] int m_getInputStream = 27; [L32] int m_shutdownOutput = 28; [L33] int m_shutdownInput = 29; [L34] int m_setPerformancePreferences = 30; [L35] int m_getPort = 31; [L36] int m_sendUrgentData = 32; [L37] int m_isClosed = 33; [L38] int m_isBound = 34; [L39] int m_setBound = 35; [L40] int m_getSendBufferSize = 36; [L41] int m_getOutputStream = 37; [L42] int m_setConnected = 38; [L43] int m_Socket = 39; [L44] int m_getRemoteSocketAddress = 40; [L45] int m_setReceiveBufferSize_1 = 41; [L46] int m_setReceiveBufferSize_2 = 42; [L47] int m_connect2_1 = 43; [L48] int m_connect2_2 = 44; [L49] int m_setSoLinger_1 = 45; [L50] int m_setSoLinger_2 = 46; [L51] int m_connect1_1 = 47; [L52] int m_connect1_2 = 48; [L53] int m_setTrafficClass_1 = 49; [L54] int m_setTrafficClass_2 = 50; [L55] int m_setSoTimeout_1 = 51; [L56] int m_setSoTimeout_2 = 52; [L57] int m_setSendBufferSize_1 = 53; [L58] int m_setSendBufferSize_2 = 54; [L59] int m_setSocketImplFactory_1 = 55; [L60] int m_setSocketImplFactory_2 = 56; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L65] int q = 0; [L66] int method_id; [L69] int this_oldImpl = 0; [L70] int this_factory = 0; [L71] int this_shutOut = 0; [L72] int this_created = 0; [L73] int this_shutIn = 0; [L74] int this_closed = 0; [L75] int this_bound = 0; [L76] int this_impl = 1; [L77] int this_connected = 0; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND TRUE q == 0 [L117] COND TRUE __VERIFIER_nondet_int() [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND TRUE __VERIFIER_nondet_int() [L2063] COND TRUE (P1 != 0) [L2065] method_id = 55 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2067] COND TRUE ((this_factory != 0) && (P29 != 0)) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L49138] __VERIFIER_error() VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9211 locations, 1 error locations. Result: UNSAFE, OverallTime: 113.6s, OverallIterations: 33, TraceHistogramMax: 4, AutomataDifference: 96.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 376273 SDtfs, 265731 SDslu, 249271 SDs, 0 SdLazy, 75777 SolverSat, 25856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74946occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 28896 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2863 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2643 ConstructedInterpolants, 0 QuantifiedInterpolants, 1771431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 359/359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...