./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label53.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_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label53.c -s /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/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 197209881b4fe70c7fe468e7084aa1de2f7c6240 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:28:49,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:28:49,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:28:49,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:28:49,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:28:49,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:28:49,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:28:49,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:28:49,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:28:49,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:28:49,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:28:49,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:28:49,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:28:49,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:28:49,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:28:49,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:28:49,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:28:49,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:28:49,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:28:49,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:28:49,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:28:49,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:28:49,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:28:49,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:28:49,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:28:49,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:28:49,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:28:49,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:28:49,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:28:49,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:28:49,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:28:49,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:28:49,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:28:49,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:28:49,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:28:49,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:28:49,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:28:49,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:28:49,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:28:49,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:28:49,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:28:49,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:28:49,169 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:28:49,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:28:49,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:28:49,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:28:49,171 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:28:49,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:28:49,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:28:49,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:28:49,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:28:49,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:28:49,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:28:49,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:28:49,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:28:49,173 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:28:49,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:28:49,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:28:49,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:28:49,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:28:49,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:28:49,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:28:49,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:28:49,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:28:49,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:28:49,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:28:49,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:28:49,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:28:49,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:28:49,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:28:49,177 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_532cc261-f449-4ba7-9b07-835b3562dfa6/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 -> 197209881b4fe70c7fe468e7084aa1de2f7c6240 [2019-11-15 22:28:49,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:28:49,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:28:49,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:28:49,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:28:49,223 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:28:49,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2019-11-15 22:28:49,283 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/data/de2f938c4/8e9dee1af5044380861622b076cdf275/FLAG669d45a5d [2019-11-15 22:28:49,798 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:28:49,799 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2019-11-15 22:28:49,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/data/de2f938c4/8e9dee1af5044380861622b076cdf275/FLAG669d45a5d [2019-11-15 22:28:50,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/data/de2f938c4/8e9dee1af5044380861622b076cdf275 [2019-11-15 22:28:50,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:28:50,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:28:50,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:28:50,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:28:50,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:28:50,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:28:50" (1/1) ... [2019-11-15 22:28:50,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327f337b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:50, skipping insertion in model container [2019-11-15 22:28:50,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:28:50" (1/1) ... [2019-11-15 22:28:50,139 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:28:50,227 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:28:50,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:28:50,857 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:28:51,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:28:51,133 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:28:51,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51 WrapperNode [2019-11-15 22:28:51,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:28:51,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:28:51,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:28:51,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:28:51,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:28:51,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:28:51,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:28:51,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:28:51,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... [2019-11-15 22:28:51,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:28:51,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:28:51,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:28:51,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:28:51,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/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 22:28:51,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:28:51,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:28:52,757 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:28:52,758 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:28:52,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:28:52 BoogieIcfgContainer [2019-11-15 22:28:52,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:28:52,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:28:52,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:28:52,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:28:52,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:28:50" (1/3) ... [2019-11-15 22:28:52,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:28:52, skipping insertion in model container [2019-11-15 22:28:52,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:28:51" (2/3) ... [2019-11-15 22:28:52,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:28:52, skipping insertion in model container [2019-11-15 22:28:52,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:28:52" (3/3) ... [2019-11-15 22:28:52,766 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2019-11-15 22:28:52,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:28:52,790 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:28:52,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:28:52,825 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:28:52,826 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:28:52,826 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:28:52,826 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:28:52,826 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:28:52,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:28:52,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:28:52,827 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:28:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 22:28:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:28:52,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:52,857 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:52,859 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2019-11-15 22:28:52,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:52,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337819127] [2019-11-15 22:28:52,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:52,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:52,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:53,207 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 22:28:53,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337819127] [2019-11-15 22:28:53,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:53,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:28:53,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603882587] [2019-11-15 22:28:53,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:28:53,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:28:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:53,231 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-11-15 22:28:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:55,729 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-11-15 22:28:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:28:55,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-15 22:28:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:55,754 INFO L225 Difference]: With dead ends: 852 [2019-11-15 22:28:55,754 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 22:28:55,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:28:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 22:28:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 22:28:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 22:28:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-11-15 22:28:55,843 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 49 [2019-11-15 22:28:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:55,844 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-11-15 22:28:55,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:28:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-11-15 22:28:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 22:28:55,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:55,861 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:28:55,861 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash -265131167, now seen corresponding path program 1 times [2019-11-15 22:28:55,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:55,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324437100] [2019-11-15 22:28:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:55,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-15 22:28:56,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324437100] [2019-11-15 22:28:56,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:56,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:28:56,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673330253] [2019-11-15 22:28:56,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:56,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:56,105 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-11-15 22:28:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:57,288 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-11-15 22:28:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:57,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 22:28:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:57,295 INFO L225 Difference]: With dead ends: 1252 [2019-11-15 22:28:57,295 INFO L226 Difference]: Without dead ends: 894 [2019-11-15 22:28:57,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 22:28:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-15 22:28:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-11-15 22:28:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-15 22:28:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-11-15 22:28:57,334 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 197 [2019-11-15 22:28:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:57,334 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-11-15 22:28:57,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-11-15 22:28:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-15 22:28:57,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:57,342 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:57,342 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1568066862, now seen corresponding path program 1 times [2019-11-15 22:28:57,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:57,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363830955] [2019-11-15 22:28:57,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:57,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:57,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 150 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:28:57,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363830955] [2019-11-15 22:28:57,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781117040] [2019-11-15 22:28:57,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:57,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:28:57,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:28:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:28:57,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:28:57,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:28:57,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942850371] [2019-11-15 22:28:57,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:57,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:57,876 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 4 states. [2019-11-15 22:28:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:58,800 INFO L93 Difference]: Finished difference Result 1815 states and 2499 transitions. [2019-11-15 22:28:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:58,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-15 22:28:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:58,808 INFO L225 Difference]: With dead ends: 1815 [2019-11-15 22:28:58,808 INFO L226 Difference]: Without dead ends: 1072 [2019-11-15 22:28:58,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-11-15 22:28:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2019-11-15 22:28:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-15 22:28:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1018 transitions. [2019-11-15 22:28:58,838 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1018 transitions. Word has length 220 [2019-11-15 22:28:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:58,839 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1018 transitions. [2019-11-15 22:28:58,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1018 transitions. [2019-11-15 22:28:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-15 22:28:58,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:58,845 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:28:59,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:59,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1442108356, now seen corresponding path program 1 times [2019-11-15 22:28:59,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:59,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337852969] [2019-11-15 22:28:59,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:59,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:59,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 255 proven. 65 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-15 22:28:59,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337852969] [2019-11-15 22:28:59,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565575474] [2019-11-15 22:28:59,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:59,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:28:59,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:28:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-15 22:28:59,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:28:59,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 22:28:59,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56218077] [2019-11-15 22:28:59,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:28:59,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:59,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:28:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:28:59,856 INFO L87 Difference]: Start difference. First operand 894 states and 1018 transitions. Second operand 3 states. [2019-11-15 22:29:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:00,502 INFO L93 Difference]: Finished difference Result 2320 states and 2691 transitions. [2019-11-15 22:29:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:29:00,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-15 22:29:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:00,517 INFO L225 Difference]: With dead ends: 2320 [2019-11-15 22:29:00,518 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 22:29:00,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:29:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 22:29:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-15 22:29:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 22:29:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1598 transitions. [2019-11-15 22:29:00,555 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1598 transitions. Word has length 315 [2019-11-15 22:29:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:00,558 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1598 transitions. [2019-11-15 22:29:00,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:29:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1598 transitions. [2019-11-15 22:29:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-15 22:29:00,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:00,567 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:00,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:00,771 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:00,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1954253435, now seen corresponding path program 1 times [2019-11-15 22:29:00,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:00,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152631307] [2019-11-15 22:29:00,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:00,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:00,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-15 22:29:01,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152631307] [2019-11-15 22:29:01,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264276340] [2019-11-15 22:29:01,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:01,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:01,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-15 22:29:01,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:29:01,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-11-15 22:29:01,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916622028] [2019-11-15 22:29:01,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:29:01,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:29:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:29:01,522 INFO L87 Difference]: Start difference. First operand 1428 states and 1598 transitions. Second operand 3 states. [2019-11-15 22:29:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:02,264 INFO L93 Difference]: Finished difference Result 3388 states and 3839 transitions. [2019-11-15 22:29:02,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:29:02,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-15 22:29:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:02,278 INFO L225 Difference]: With dead ends: 3388 [2019-11-15 22:29:02,278 INFO L226 Difference]: Without dead ends: 2140 [2019-11-15 22:29:02,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 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 22:29:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-15 22:29:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2019-11-15 22:29:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-11-15 22:29:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2352 transitions. [2019-11-15 22:29:02,327 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2352 transitions. Word has length 412 [2019-11-15 22:29:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:02,328 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 2352 transitions. [2019-11-15 22:29:02,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:29:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2352 transitions. [2019-11-15 22:29:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-11-15 22:29:02,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:02,341 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:02,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:02,548 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1169353227, now seen corresponding path program 1 times [2019-11-15 22:29:02,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:02,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673041733] [2019-11-15 22:29:02,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:02,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:02,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 420 proven. 65 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-15 22:29:03,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673041733] [2019-11-15 22:29:03,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031871122] [2019-11-15 22:29:03,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:03,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:29:03,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-15 22:29:03,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:29:03,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-15 22:29:03,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679310879] [2019-11-15 22:29:03,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:29:03,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:29:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:29:03,624 INFO L87 Difference]: Start difference. First operand 2140 states and 2352 transitions. Second operand 7 states. [2019-11-15 22:29:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:04,464 INFO L93 Difference]: Finished difference Result 4378 states and 4811 transitions. [2019-11-15 22:29:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:29:04,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 414 [2019-11-15 22:29:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:04,479 INFO L225 Difference]: With dead ends: 4378 [2019-11-15 22:29:04,479 INFO L226 Difference]: Without dead ends: 2318 [2019-11-15 22:29:04,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:29:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-15 22:29:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2019-11-15 22:29:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-11-15 22:29:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2302 transitions. [2019-11-15 22:29:04,544 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2302 transitions. Word has length 414 [2019-11-15 22:29:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:04,544 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 2302 transitions. [2019-11-15 22:29:04,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:29:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2302 transitions. [2019-11-15 22:29:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-15 22:29:04,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:04,559 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:29:04,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:04,764 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2096484788, now seen corresponding path program 1 times [2019-11-15 22:29:04,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:04,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136809109] [2019-11-15 22:29:04,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:04,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:04,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-15 22:29:05,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136809109] [2019-11-15 22:29:05,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:05,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:29:05,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626147535] [2019-11-15 22:29:05,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:29:05,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:29:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:29:05,806 INFO L87 Difference]: Start difference. First operand 2140 states and 2302 transitions. Second operand 8 states. [2019-11-15 22:29:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:07,154 INFO L93 Difference]: Finished difference Result 4290 states and 4624 transitions. [2019-11-15 22:29:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:29:07,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 517 [2019-11-15 22:29:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:07,168 INFO L225 Difference]: With dead ends: 4290 [2019-11-15 22:29:07,168 INFO L226 Difference]: Without dead ends: 2330 [2019-11-15 22:29:07,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:29:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2019-11-15 22:29:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2318. [2019-11-15 22:29:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 22:29:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2484 transitions. [2019-11-15 22:29:07,224 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2484 transitions. Word has length 517 [2019-11-15 22:29:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:07,225 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2484 transitions. [2019-11-15 22:29:07,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:29:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2484 transitions. [2019-11-15 22:29:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-11-15 22:29:07,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:07,232 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:07,232 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -111934088, now seen corresponding path program 1 times [2019-11-15 22:29:07,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:07,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070499619] [2019-11-15 22:29:07,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:07,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:07,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 591 proven. 4 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-15 22:29:08,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070499619] [2019-11-15 22:29:08,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702353178] [2019-11-15 22:29:08,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:08,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:29:08,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:08,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 572 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-15 22:29:08,891 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:29:08,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 22:29:08,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794843659] [2019-11-15 22:29:08,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:29:08,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:29:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:29:08,895 INFO L87 Difference]: Start difference. First operand 2318 states and 2484 transitions. Second operand 8 states. [2019-11-15 22:29:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:10,907 INFO L93 Difference]: Finished difference Result 4670 states and 5004 transitions. [2019-11-15 22:29:10,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:29:10,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 541 [2019-11-15 22:29:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:10,919 INFO L225 Difference]: With dead ends: 4670 [2019-11-15 22:29:10,919 INFO L226 Difference]: Without dead ends: 2532 [2019-11-15 22:29:10,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 538 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:29:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2019-11-15 22:29:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2318. [2019-11-15 22:29:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 22:29:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2482 transitions. [2019-11-15 22:29:10,968 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2482 transitions. Word has length 541 [2019-11-15 22:29:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:10,969 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2482 transitions. [2019-11-15 22:29:10,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:29:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2482 transitions. [2019-11-15 22:29:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-11-15 22:29:10,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:10,975 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-15 22:29:11,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:11,191 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 186723207, now seen corresponding path program 1 times [2019-11-15 22:29:11,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:11,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571768646] [2019-11-15 22:29:11,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:11,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:11,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-15 22:29:11,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571768646] [2019-11-15 22:29:11,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:11,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:29:11,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194544434] [2019-11-15 22:29:11,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:29:11,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:29:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:29:11,613 INFO L87 Difference]: Start difference. First operand 2318 states and 2482 transitions. Second operand 3 states. [2019-11-15 22:29:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:12,086 INFO L93 Difference]: Finished difference Result 5346 states and 5778 transitions. [2019-11-15 22:29:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:29:12,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 630 [2019-11-15 22:29:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:12,101 INFO L225 Difference]: With dead ends: 5346 [2019-11-15 22:29:12,101 INFO L226 Difference]: Without dead ends: 3208 [2019-11-15 22:29:12,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:29:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-15 22:29:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2019-11-15 22:29:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-15 22:29:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3273 transitions. [2019-11-15 22:29:12,157 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3273 transitions. Word has length 630 [2019-11-15 22:29:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:12,158 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3273 transitions. [2019-11-15 22:29:12,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:29:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3273 transitions. [2019-11-15 22:29:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-11-15 22:29:12,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:12,165 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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 22:29:12,166 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:12,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:12,166 INFO L82 PathProgramCache]: Analyzing trace with hash 740978942, now seen corresponding path program 1 times [2019-11-15 22:29:12,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:12,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114502900] [2019-11-15 22:29:12,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:12,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:12,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 708 proven. 174 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-15 22:29:13,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114502900] [2019-11-15 22:29:13,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864630202] [2019-11-15 22:29:13,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:13,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:29:13,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 853 proven. 29 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-15 22:29:14,908 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:29:14,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 22:29:14,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471936151] [2019-11-15 22:29:14,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:29:14,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:29:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:29:14,913 INFO L87 Difference]: Start difference. First operand 3030 states and 3273 transitions. Second operand 8 states. [2019-11-15 22:29:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:16,511 INFO L93 Difference]: Finished difference Result 6295 states and 6801 transitions. [2019-11-15 22:29:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:29:16,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 675 [2019-11-15 22:29:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:16,527 INFO L225 Difference]: With dead ends: 6295 [2019-11-15 22:29:16,527 INFO L226 Difference]: Without dead ends: 3445 [2019-11-15 22:29:16,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 672 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:29:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-11-15 22:29:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3208. [2019-11-15 22:29:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-15 22:29:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3455 transitions. [2019-11-15 22:29:16,594 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3455 transitions. Word has length 675 [2019-11-15 22:29:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:16,595 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 3455 transitions. [2019-11-15 22:29:16,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:29:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3455 transitions. [2019-11-15 22:29:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-11-15 22:29:16,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:16,606 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-15 22:29:16,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:16,818 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 286131592, now seen corresponding path program 1 times [2019-11-15 22:29:16,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:16,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726162858] [2019-11-15 22:29:16,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:16,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:16,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 1114 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-15 22:29:17,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726162858] [2019-11-15 22:29:17,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:17,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:29:17,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082071175] [2019-11-15 22:29:17,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:29:17,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:29:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:29:17,271 INFO L87 Difference]: Start difference. First operand 3208 states and 3455 transitions. Second operand 3 states. [2019-11-15 22:29:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:17,747 INFO L93 Difference]: Finished difference Result 7126 states and 7695 transitions. [2019-11-15 22:29:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:29:17,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2019-11-15 22:29:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:17,767 INFO L225 Difference]: With dead ends: 7126 [2019-11-15 22:29:17,767 INFO L226 Difference]: Without dead ends: 4098 [2019-11-15 22:29:17,771 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 22:29:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-15 22:29:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-11-15 22:29:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-15 22:29:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4396 transitions. [2019-11-15 22:29:17,839 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4396 transitions. Word has length 702 [2019-11-15 22:29:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:17,840 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4396 transitions. [2019-11-15 22:29:17,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:29:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4396 transitions. [2019-11-15 22:29:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2019-11-15 22:29:17,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:17,849 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-11-15 22:29:17,850 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -570726484, now seen corresponding path program 1 times [2019-11-15 22:29:17,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195483966] [2019-11-15 22:29:17,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-11-15 22:29:18,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195483966] [2019-11-15 22:29:18,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:18,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:18,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275397196] [2019-11-15 22:29:18,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:18,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:18,622 INFO L87 Difference]: Start difference. First operand 4098 states and 4396 transitions. Second operand 4 states. [2019-11-15 22:29:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:19,350 INFO L93 Difference]: Finished difference Result 9796 states and 10618 transitions. [2019-11-15 22:29:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:19,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 857 [2019-11-15 22:29:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:19,375 INFO L225 Difference]: With dead ends: 9796 [2019-11-15 22:29:19,375 INFO L226 Difference]: Without dead ends: 5878 [2019-11-15 22:29:19,379 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 22:29:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-11-15 22:29:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-11-15 22:29:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-15 22:29:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5904 transitions. [2019-11-15 22:29:19,468 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5904 transitions. Word has length 857 [2019-11-15 22:29:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:19,469 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5904 transitions. [2019-11-15 22:29:19,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5904 transitions. [2019-11-15 22:29:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2019-11-15 22:29:19,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:19,479 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-11-15 22:29:19,479 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash -948706177, now seen corresponding path program 1 times [2019-11-15 22:29:19,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:19,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443779109] [2019-11-15 22:29:19,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:19,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:19,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1620 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2019-11-15 22:29:21,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443779109] [2019-11-15 22:29:21,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:21,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:29:21,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248110542] [2019-11-15 22:29:21,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:29:21,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:21,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:29:21,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:29:21,274 INFO L87 Difference]: Start difference. First operand 5522 states and 5904 transitions. Second operand 7 states. [2019-11-15 22:29:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:22,127 INFO L93 Difference]: Finished difference Result 11223 states and 11993 transitions. [2019-11-15 22:29:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:29:22,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 875 [2019-11-15 22:29:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:22,148 INFO L225 Difference]: With dead ends: 11223 [2019-11-15 22:29:22,148 INFO L226 Difference]: Without dead ends: 5881 [2019-11-15 22:29:22,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:29:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2019-11-15 22:29:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5522. [2019-11-15 22:29:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-15 22:29:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5899 transitions. [2019-11-15 22:29:22,231 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5899 transitions. Word has length 875 [2019-11-15 22:29:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:22,232 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5899 transitions. [2019-11-15 22:29:22,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:29:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5899 transitions. [2019-11-15 22:29:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2019-11-15 22:29:22,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:22,243 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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, 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] [2019-11-15 22:29:22,243 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1227190264, now seen corresponding path program 1 times [2019-11-15 22:29:22,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:22,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192416762] [2019-11-15 22:29:22,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:22,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:22,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1793 proven. 144 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-15 22:29:23,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192416762] [2019-11-15 22:29:23,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636542416] [2019-11-15 22:29:23,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:23,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:29:23,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-11-15 22:29:24,240 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:29:24,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 22:29:24,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906536424] [2019-11-15 22:29:24,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:29:24,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:29:24,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:29:24,242 INFO L87 Difference]: Start difference. First operand 5522 states and 5899 transitions. Second operand 9 states. [2019-11-15 22:29:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:26,389 INFO L93 Difference]: Finished difference Result 13002 states and 13878 transitions. [2019-11-15 22:29:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:29:26,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 952 [2019-11-15 22:29:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:26,401 INFO L225 Difference]: With dead ends: 13002 [2019-11-15 22:29:26,402 INFO L226 Difference]: Without dead ends: 7660 [2019-11-15 22:29:26,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 954 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:29:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2019-11-15 22:29:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 6590. [2019-11-15 22:29:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2019-11-15 22:29:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 6927 transitions. [2019-11-15 22:29:26,500 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 6927 transitions. Word has length 952 [2019-11-15 22:29:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:26,501 INFO L462 AbstractCegarLoop]: Abstraction has 6590 states and 6927 transitions. [2019-11-15 22:29:26,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:29:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 6927 transitions. [2019-11-15 22:29:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1175 [2019-11-15 22:29:26,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:26,516 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:26,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:26,719 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1931049465, now seen corresponding path program 1 times [2019-11-15 22:29:26,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:26,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321032218] [2019-11-15 22:29:26,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:26,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:26,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 1191 proven. 0 refuted. 0 times theorem prover too weak. 3439 trivial. 0 not checked. [2019-11-15 22:29:27,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321032218] [2019-11-15 22:29:27,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:27,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:27,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580687865] [2019-11-15 22:29:27,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:27,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:27,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:27,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:27,798 INFO L87 Difference]: Start difference. First operand 6590 states and 6927 transitions. Second operand 4 states. [2019-11-15 22:29:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:28,619 INFO L93 Difference]: Finished difference Result 13534 states and 14263 transitions. [2019-11-15 22:29:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:28,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1174 [2019-11-15 22:29:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:28,634 INFO L225 Difference]: With dead ends: 13534 [2019-11-15 22:29:28,634 INFO L226 Difference]: Without dead ends: 7124 [2019-11-15 22:29:28,640 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 22:29:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2019-11-15 22:29:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 6056. [2019-11-15 22:29:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-15 22:29:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6342 transitions. [2019-11-15 22:29:28,724 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6342 transitions. Word has length 1174 [2019-11-15 22:29:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:28,725 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6342 transitions. [2019-11-15 22:29:28,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6342 transitions. [2019-11-15 22:29:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1193 [2019-11-15 22:29:28,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:28,740 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-15 22:29:28,740 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash -525960922, now seen corresponding path program 1 times [2019-11-15 22:29:28,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:28,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010849061] [2019-11-15 22:29:28,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:28,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:28,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4677 backedges. 1982 proven. 0 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2019-11-15 22:29:30,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010849061] [2019-11-15 22:29:30,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:30,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:30,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092477591] [2019-11-15 22:29:30,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:30,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:30,154 INFO L87 Difference]: Start difference. First operand 6056 states and 6342 transitions. Second operand 4 states. [2019-11-15 22:29:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:30,831 INFO L93 Difference]: Finished difference Result 12466 states and 13043 transitions. [2019-11-15 22:29:30,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:30,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1192 [2019-11-15 22:29:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:30,842 INFO L225 Difference]: With dead ends: 12466 [2019-11-15 22:29:30,842 INFO L226 Difference]: Without dead ends: 6590 [2019-11-15 22:29:30,847 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 22:29:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2019-11-15 22:29:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6234. [2019-11-15 22:29:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-11-15 22:29:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6513 transitions. [2019-11-15 22:29:30,927 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6513 transitions. Word has length 1192 [2019-11-15 22:29:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:30,928 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 6513 transitions. [2019-11-15 22:29:30,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6513 transitions. [2019-11-15 22:29:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2019-11-15 22:29:30,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:30,951 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:30,952 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1677268664, now seen corresponding path program 1 times [2019-11-15 22:29:30,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:30,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720913223] [2019-11-15 22:29:30,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:30,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:30,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8656 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 8046 trivial. 0 not checked. [2019-11-15 22:29:32,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720913223] [2019-11-15 22:29:32,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:32,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:32,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369878639] [2019-11-15 22:29:32,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:32,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:32,937 INFO L87 Difference]: Start difference. First operand 6234 states and 6513 transitions. Second operand 4 states. [2019-11-15 22:29:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:33,569 INFO L93 Difference]: Finished difference Result 12466 states and 13024 transitions. [2019-11-15 22:29:33,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:33,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1645 [2019-11-15 22:29:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:33,580 INFO L225 Difference]: With dead ends: 12466 [2019-11-15 22:29:33,580 INFO L226 Difference]: Without dead ends: 6412 [2019-11-15 22:29:33,585 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 22:29:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-15 22:29:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6234. [2019-11-15 22:29:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-11-15 22:29:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6480 transitions. [2019-11-15 22:29:33,661 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6480 transitions. Word has length 1645 [2019-11-15 22:29:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:33,663 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 6480 transitions. [2019-11-15 22:29:33,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6480 transitions. [2019-11-15 22:29:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2019-11-15 22:29:33,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:33,687 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:33,688 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:33,688 INFO L82 PathProgramCache]: Analyzing trace with hash 698233105, now seen corresponding path program 1 times [2019-11-15 22:29:33,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:33,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634327134] [2019-11-15 22:29:33,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:33,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:33,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 2883 proven. 0 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2019-11-15 22:29:35,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634327134] [2019-11-15 22:29:35,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:35,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:35,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982939159] [2019-11-15 22:29:35,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:35,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:35,654 INFO L87 Difference]: Start difference. First operand 6234 states and 6480 transitions. Second operand 4 states. [2019-11-15 22:29:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:36,364 INFO L93 Difference]: Finished difference Result 13712 states and 14218 transitions. [2019-11-15 22:29:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:36,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1662 [2019-11-15 22:29:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:36,368 INFO L225 Difference]: With dead ends: 13712 [2019-11-15 22:29:36,368 INFO L226 Difference]: Without dead ends: 4454 [2019-11-15 22:29:36,373 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 22:29:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-15 22:29:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3920. [2019-11-15 22:29:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 22:29:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3990 transitions. [2019-11-15 22:29:36,412 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3990 transitions. Word has length 1662 [2019-11-15 22:29:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:36,413 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 3990 transitions. [2019-11-15 22:29:36,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3990 transitions. [2019-11-15 22:29:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1681 [2019-11-15 22:29:36,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:36,436 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:36,436 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1087144341, now seen corresponding path program 1 times [2019-11-15 22:29:36,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:36,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872721081] [2019-11-15 22:29:36,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:36,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:36,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2725 proven. 0 refuted. 0 times theorem prover too weak. 5888 trivial. 0 not checked. [2019-11-15 22:29:39,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872721081] [2019-11-15 22:29:39,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:39,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:29:39,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219830259] [2019-11-15 22:29:39,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:29:39,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:29:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:29:39,334 INFO L87 Difference]: Start difference. First operand 3920 states and 3990 transitions. Second operand 7 states. [2019-11-15 22:29:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:39,916 INFO L93 Difference]: Finished difference Result 7542 states and 7683 transitions. [2019-11-15 22:29:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:29:39,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1680 [2019-11-15 22:29:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:39,920 INFO L225 Difference]: With dead ends: 7542 [2019-11-15 22:29:39,920 INFO L226 Difference]: Without dead ends: 4098 [2019-11-15 22:29:39,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:29:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-15 22:29:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2019-11-15 22:29:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 22:29:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3987 transitions. [2019-11-15 22:29:39,955 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3987 transitions. Word has length 1680 [2019-11-15 22:29:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:39,956 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 3987 transitions. [2019-11-15 22:29:39,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:29:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3987 transitions. [2019-11-15 22:29:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2019-11-15 22:29:39,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:39,975 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:29:39,976 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2019243921, now seen corresponding path program 1 times [2019-11-15 22:29:39,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:39,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706845481] [2019-11-15 22:29:39,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:39,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:39,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2019-11-15 22:29:42,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706845481] [2019-11-15 22:29:42,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:42,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:29:42,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780730610] [2019-11-15 22:29:42,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:29:42,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:29:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:29:42,003 INFO L87 Difference]: Start difference. First operand 3920 states and 3987 transitions. Second operand 5 states. [2019-11-15 22:29:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:42,791 INFO L93 Difference]: Finished difference Result 5346 states and 5448 transitions. [2019-11-15 22:29:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:29:42,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1733 [2019-11-15 22:29:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:42,794 INFO L225 Difference]: With dead ends: 5346 [2019-11-15 22:29:42,795 INFO L226 Difference]: Without dead ends: 5166 [2019-11-15 22:29:42,795 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 22:29:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-15 22:29:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2019-11-15 22:29:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 22:29:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4719 transitions. [2019-11-15 22:29:42,827 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4719 transitions. Word has length 1733 [2019-11-15 22:29:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:42,828 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4719 transitions. [2019-11-15 22:29:42,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:29:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4719 transitions. [2019-11-15 22:29:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2019-11-15 22:29:42,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:42,844 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:29:42,844 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash 636915005, now seen corresponding path program 1 times [2019-11-15 22:29:42,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:42,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243656013] [2019-11-15 22:29:42,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:42,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:42,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2019-11-15 22:29:44,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243656013] [2019-11-15 22:29:44,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:44,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:29:44,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970803546] [2019-11-15 22:29:44,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:29:44,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:29:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:29:44,654 INFO L87 Difference]: Start difference. First operand 4632 states and 4719 transitions. Second operand 3 states. [2019-11-15 22:29:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:45,011 INFO L93 Difference]: Finished difference Result 8906 states and 9078 transitions. [2019-11-15 22:29:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:29:45,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1738 [2019-11-15 22:29:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:45,014 INFO L225 Difference]: With dead ends: 8906 [2019-11-15 22:29:45,014 INFO L226 Difference]: Without dead ends: 4276 [2019-11-15 22:29:45,018 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 22:29:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-15 22:29:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3564. [2019-11-15 22:29:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-15 22:29:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3607 transitions. [2019-11-15 22:29:45,046 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3607 transitions. Word has length 1738 [2019-11-15 22:29:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:45,047 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3607 transitions. [2019-11-15 22:29:45,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:29:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3607 transitions. [2019-11-15 22:29:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2019-11-15 22:29:45,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:45,064 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:29:45,064 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2092363024, now seen corresponding path program 1 times [2019-11-15 22:29:45,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:45,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901644315] [2019-11-15 22:29:45,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:45,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:45,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9805 backedges. 6224 proven. 426 refuted. 0 times theorem prover too weak. 3155 trivial. 0 not checked. [2019-11-15 22:29:49,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901644315] [2019-11-15 22:29:49,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677025443] [2019-11-15 22:29:49,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:49,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 2097 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:29:49,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9805 backedges. 6650 proven. 0 refuted. 0 times theorem prover too weak. 3155 trivial. 0 not checked. [2019-11-15 22:29:53,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:29:53,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-15 22:29:53,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322874469] [2019-11-15 22:29:53,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:29:53,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:29:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:29:53,347 INFO L87 Difference]: Start difference. First operand 3564 states and 3607 transitions. Second operand 6 states. [2019-11-15 22:29:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:54,312 INFO L93 Difference]: Finished difference Result 5168 states and 5242 transitions. [2019-11-15 22:29:54,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:29:54,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1738 [2019-11-15 22:29:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:54,317 INFO L225 Difference]: With dead ends: 5168 [2019-11-15 22:29:54,317 INFO L226 Difference]: Without dead ends: 3742 [2019-11-15 22:29:54,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1744 GetRequests, 1735 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:29:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-15 22:29:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2019-11-15 22:29:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-15 22:29:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3787 transitions. [2019-11-15 22:29:54,343 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3787 transitions. Word has length 1738 [2019-11-15 22:29:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:54,344 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3787 transitions. [2019-11-15 22:29:54,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:29:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3787 transitions. [2019-11-15 22:29:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2019-11-15 22:29:54,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:54,362 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:29:54,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:54,563 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324035, now seen corresponding path program 1 times [2019-11-15 22:29:54,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:54,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643281356] [2019-11-15 22:29:54,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:54,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:54,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3204 proven. 0 refuted. 0 times theorem prover too weak. 8305 trivial. 0 not checked. [2019-11-15 22:29:58,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643281356] [2019-11-15 22:29:58,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:58,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:29:58,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578969824] [2019-11-15 22:29:58,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:29:58,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:29:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:29:58,379 INFO L87 Difference]: Start difference. First operand 3742 states and 3787 transitions. Second operand 7 states. [2019-11-15 22:29:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:59,139 INFO L93 Difference]: Finished difference Result 5039 states and 5107 transitions. [2019-11-15 22:29:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:29:59,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1903 [2019-11-15 22:29:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:59,142 INFO L225 Difference]: With dead ends: 5039 [2019-11-15 22:29:59,143 INFO L226 Difference]: Without dead ends: 3564 [2019-11-15 22:29:59,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:29:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-15 22:29:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2019-11-15 22:29:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-15 22:29:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3602 transitions. [2019-11-15 22:29:59,172 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3602 transitions. Word has length 1903 [2019-11-15 22:29:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:59,173 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3602 transitions. [2019-11-15 22:29:59,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:29:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3602 transitions. [2019-11-15 22:29:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2019-11-15 22:29:59,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:59,193 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 22:29:59,193 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1253846088, now seen corresponding path program 1 times [2019-11-15 22:29:59,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:59,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376480970] [2019-11-15 22:29:59,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:59,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:59,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-15 22:30:01,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376480970] [2019-11-15 22:30:01,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:01,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:30:01,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254454404] [2019-11-15 22:30:01,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:30:01,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:01,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:30:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:30:01,801 INFO L87 Difference]: Start difference. First operand 3564 states and 3602 transitions. Second operand 5 states. [2019-11-15 22:30:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:02,379 INFO L93 Difference]: Finished difference Result 3742 states and 3781 transitions. [2019-11-15 22:30:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:30:02,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2035 [2019-11-15 22:30:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:02,381 INFO L225 Difference]: With dead ends: 3742 [2019-11-15 22:30:02,381 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:30:02,382 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 22:30:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:30:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:30:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:30:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:30:02,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2035 [2019-11-15 22:30:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:02,383 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:30:02,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:30:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:30:02,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:30:02,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:30:02,758 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 233 [2019-11-15 22:30:03,058 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 233 [2019-11-15 22:30:04,718 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 206 DAG size of output: 101 [2019-11-15 22:30:06,135 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 206 DAG size of output: 101 [2019-11-15 22:30:06,137 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 22:30:06,137 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,138 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 22:30:06,139 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 22:30:06,140 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,141 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,142 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,143 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 22:30:06,143 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 22:30:06,143 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 22:30:06,147 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 22:30:06,147 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 22:30:06,147 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 22:30:06,147 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 22:30:06,148 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,149 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 22:30:06,150 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 22:30:06,151 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,152 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 22:30:06,153 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,154 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 22:30:06,155 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 22:30:06,156 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 22:30:06,157 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,158 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,159 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,160 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse5 (= 7 ~a15~0))) (let ((.cse28 (+ ~a12~0 43)) (.cse24 (not .cse5)) (.cse4 (= ~a24~0 1)) (.cse16 (<= ~a15~0 8)) (.cse14 (<= ~a21~0 6))) (let ((.cse11 (= 8 ~a21~0)) (.cse17 (= ~a21~0 9)) (.cse25 (or (and .cse24 .cse16 .cse14) (and .cse4 .cse16 .cse14))) (.cse3 (< 0 .cse28)) (.cse0 (= 8 ~a15~0))) (let ((.cse23 (<= .cse28 0)) (.cse18 (<= ~a12~0 73281)) (.cse10 (and .cse24 .cse4 .cse16)) (.cse1 (= ~a21~0 7)) (.cse9 (not .cse0)) (.cse6 (and (and .cse4 .cse25) .cse3)) (.cse26 (not .cse17)) (.cse27 (not .cse11))) (let ((.cse15 (and .cse11 .cse4 .cse16)) (.cse8 (= 9 ~a15~0)) (.cse19 (= ~a21~0 6)) (.cse21 (= ~a15~0 5)) (.cse12 (and .cse26 .cse5 .cse4 .cse27)) (.cse7 (= 10 ~a21~0)) (.cse13 (< 80 ~a12~0)) (.cse22 (<= ~a12~0 75)) (.cse20 (or (and (and .cse23 .cse25) .cse9) (and .cse26 .cse9 .cse27 .cse18 .cse3 .cse10 (not .cse1)) (and .cse9 .cse6))) (.cse2 (<= ~a12~0 11))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6) (and .cse4 .cse2 .cse7 .cse8) (and .cse9 (and (<= ~a12~0 80) .cse3 .cse10)) (and .cse11 (<= (+ ~a12~0 526768) 0) .cse4 .cse8) (and (<= (+ ~a12~0 397559) 0) .cse12) (and .cse0 .cse4 (<= ~a12~0 586307) .cse13 .cse14) (and .cse0 .cse4 .cse1 (<= (+ ~a12~0 49) 0)) (and (<= ~a12~0 599999) .cse4 .cse13 .cse8) (and .cse5 .cse15) (and (and .cse4 .cse16 .cse3 .cse17) .cse9) (and .cse18 .cse15 .cse3) (and .cse19 .cse20 (= ~a15~0 6)) (and .cse5 .cse4 .cse1) (and (and .cse2 .cse3 .cse10) .cse7) (and (= ~a21~0 10) .cse21 .cse20) (and .cse22 .cse11 .cse4 .cse3 .cse8) (and .cse19 .cse4 .cse21) (and .cse12 .cse13) (or (and .cse23 .cse24 .cse4 .cse16 .cse17) (and .cse0 .cse4 .cse7 .cse23)) (and .cse0 .cse4 .cse7 .cse13) (and .cse22 (and .cse0 .cse4) .cse17) (and .cse20 .cse2))))))) [2019-11-15 22:30:06,160 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 22:30:06,160 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 22:30:06,161 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,162 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,162 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 22:30:06,162 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 22:30:06,162 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 22:30:06,162 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 22:30:06,162 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 22:30:06,162 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 22:30:06,163 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 22:30:06,164 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,165 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 22:30:06,165 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse5 (= 7 ~a15~0))) (let ((.cse28 (+ ~a12~0 43)) (.cse24 (not .cse5)) (.cse4 (= ~a24~0 1)) (.cse16 (<= ~a15~0 8)) (.cse14 (<= ~a21~0 6))) (let ((.cse11 (= 8 ~a21~0)) (.cse17 (= ~a21~0 9)) (.cse25 (or (and .cse24 .cse16 .cse14) (and .cse4 .cse16 .cse14))) (.cse3 (< 0 .cse28)) (.cse0 (= 8 ~a15~0))) (let ((.cse23 (<= .cse28 0)) (.cse18 (<= ~a12~0 73281)) (.cse10 (and .cse24 .cse4 .cse16)) (.cse1 (= ~a21~0 7)) (.cse9 (not .cse0)) (.cse6 (and (and .cse4 .cse25) .cse3)) (.cse26 (not .cse17)) (.cse27 (not .cse11))) (let ((.cse15 (and .cse11 .cse4 .cse16)) (.cse8 (= 9 ~a15~0)) (.cse19 (= ~a21~0 6)) (.cse21 (= ~a15~0 5)) (.cse12 (and .cse26 .cse5 .cse4 .cse27)) (.cse7 (= 10 ~a21~0)) (.cse13 (< 80 ~a12~0)) (.cse22 (<= ~a12~0 75)) (.cse20 (or (and (and .cse23 .cse25) .cse9) (and .cse26 .cse9 .cse27 .cse18 .cse3 .cse10 (not .cse1)) (and .cse9 .cse6))) (.cse2 (<= ~a12~0 11))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6) (and .cse4 .cse2 .cse7 .cse8) (and .cse9 (and (<= ~a12~0 80) .cse3 .cse10)) (and .cse11 (<= (+ ~a12~0 526768) 0) .cse4 .cse8) (and (<= (+ ~a12~0 397559) 0) .cse12) (and .cse0 .cse4 (<= ~a12~0 586307) .cse13 .cse14) (and .cse0 .cse4 .cse1 (<= (+ ~a12~0 49) 0)) (and (<= ~a12~0 599999) .cse4 .cse13 .cse8) (and .cse5 .cse15) (and (and .cse4 .cse16 .cse3 .cse17) .cse9) (and .cse18 .cse15 .cse3) (and .cse19 .cse20 (= ~a15~0 6)) (and .cse5 .cse4 .cse1) (and (and .cse2 .cse3 .cse10) .cse7) (and (= ~a21~0 10) .cse21 .cse20) (and .cse22 .cse11 .cse4 .cse3 .cse8) (and .cse19 .cse4 .cse21) (and .cse12 .cse13) (or (and .cse23 .cse24 .cse4 .cse16 .cse17) (and .cse0 .cse4 .cse7 .cse23)) (and .cse0 .cse4 .cse7 .cse13) (and .cse22 (and .cse0 .cse4) .cse17) (and .cse20 .cse2))))))) [2019-11-15 22:30:06,165 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 22:30:06,165 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 22:30:06,165 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 22:30:06,166 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 22:30:06,167 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,168 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 22:30:06,169 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 22:30:06,170 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 22:30:06,171 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 22:30:06,172 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 22:30:06,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:30:06 BoogieIcfgContainer [2019-11-15 22:30:06,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:30:06,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:30:06,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:30:06,215 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:30:06,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:28:52" (3/4) ... [2019-11-15 22:30:06,218 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:30:06,240 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:30:06,241 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:30:06,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_532cc261-f449-4ba7-9b07-835b3562dfa6/bin/uautomizer/witness.graphml [2019-11-15 22:30:06,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:30:06,379 INFO L168 Benchmark]: Toolchain (without parser) took 76256.22 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 944.8 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,379 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:30:06,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1010.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,380 INFO L168 Benchmark]: Boogie Preprocessor took 116.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,380 INFO L168 Benchmark]: RCFGBuilder took 1369.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,381 INFO L168 Benchmark]: TraceAbstraction took 73454.01 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 970.4 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,381 INFO L168 Benchmark]: Witness Printer took 162.91 ms. Allocated memory is still 5.1 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:06,383 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1010.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1369.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73454.01 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 970.4 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 162.91 ms. Allocated memory is still 5.1 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((8 == a15 && a21 == 7) && a12 <= 11) && 0 < a12 + 43) && a24 == 1) || (7 == a15 && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) || (((a24 == 1 && a12 <= 11) && 10 == a21) && 9 == a15)) || (!(8 == a15) && (a12 <= 80 && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8)) || (((8 == a21 && a12 + 526768 <= 0) && a24 == 1) && 9 == a15)) || (a12 + 397559 <= 0 && ((!(a21 == 9) && 7 == a15) && a24 == 1) && !(8 == a21))) || ((((8 == a15 && a24 == 1) && a12 <= 586307) && 80 < a12) && a21 <= 6)) || (((8 == a15 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((a12 <= 599999 && a24 == 1) && 80 < a12) && 9 == a15)) || (7 == a15 && (8 == a21 && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && a15 <= 8) && 0 < a12 + 43) && a21 == 9) && !(8 == a15))) || ((a12 <= 73281 && (8 == a21 && a24 == 1) && a15 <= 8) && 0 < a12 + 43)) || ((a21 == 6 && ((((a12 + 43 <= 0 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && !(8 == a15)) || ((((((!(a21 == 9) && !(8 == a15)) && !(8 == a21)) && a12 <= 73281) && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && !(a21 == 7))) || (!(8 == a15) && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43))) && a15 == 6)) || ((7 == a15 && a24 == 1) && a21 == 7)) || (((a12 <= 11 && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && 10 == a21)) || ((a21 == 10 && a15 == 5) && ((((a12 + 43 <= 0 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && !(8 == a15)) || ((((((!(a21 == 9) && !(8 == a15)) && !(8 == a21)) && a12 <= 73281) && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && !(a21 == 7))) || (!(8 == a15) && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)))) || ((((a12 <= 75 && 8 == a21) && a24 == 1) && 0 < a12 + 43) && 9 == a15)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((!(a21 == 9) && 7 == a15) && a24 == 1) && !(8 == a21)) && 80 < a12)) || ((((a12 + 43 <= 0 && !(7 == a15)) && a24 == 1) && a15 <= 8) && a21 == 9) || (((8 == a15 && a24 == 1) && 10 == a21) && a12 + 43 <= 0)) || (((8 == a15 && a24 == 1) && 10 == a21) && 80 < a12)) || ((a12 <= 75 && 8 == a15 && a24 == 1) && a21 == 9)) || (((((a12 + 43 <= 0 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && !(8 == a15)) || ((((((!(a21 == 9) && !(8 == a15)) && !(8 == a21)) && a12 <= 73281) && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && !(a21 == 7))) || (!(8 == a15) && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) && a12 <= 11) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((8 == a15 && a21 == 7) && a12 <= 11) && 0 < a12 + 43) && a24 == 1) || (7 == a15 && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) || (((a24 == 1 && a12 <= 11) && 10 == a21) && 9 == a15)) || (!(8 == a15) && (a12 <= 80 && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8)) || (((8 == a21 && a12 + 526768 <= 0) && a24 == 1) && 9 == a15)) || (a12 + 397559 <= 0 && ((!(a21 == 9) && 7 == a15) && a24 == 1) && !(8 == a21))) || ((((8 == a15 && a24 == 1) && a12 <= 586307) && 80 < a12) && a21 <= 6)) || (((8 == a15 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((a12 <= 599999 && a24 == 1) && 80 < a12) && 9 == a15)) || (7 == a15 && (8 == a21 && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && a15 <= 8) && 0 < a12 + 43) && a21 == 9) && !(8 == a15))) || ((a12 <= 73281 && (8 == a21 && a24 == 1) && a15 <= 8) && 0 < a12 + 43)) || ((a21 == 6 && ((((a12 + 43 <= 0 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && !(8 == a15)) || ((((((!(a21 == 9) && !(8 == a15)) && !(8 == a21)) && a12 <= 73281) && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && !(a21 == 7))) || (!(8 == a15) && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43))) && a15 == 6)) || ((7 == a15 && a24 == 1) && a21 == 7)) || (((a12 <= 11 && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && 10 == a21)) || ((a21 == 10 && a15 == 5) && ((((a12 + 43 <= 0 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && !(8 == a15)) || ((((((!(a21 == 9) && !(8 == a15)) && !(8 == a21)) && a12 <= 73281) && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && !(a21 == 7))) || (!(8 == a15) && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)))) || ((((a12 <= 75 && 8 == a21) && a24 == 1) && 0 < a12 + 43) && 9 == a15)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((!(a21 == 9) && 7 == a15) && a24 == 1) && !(8 == a21)) && 80 < a12)) || ((((a12 + 43 <= 0 && !(7 == a15)) && a24 == 1) && a15 <= 8) && a21 == 9) || (((8 == a15 && a24 == 1) && 10 == a21) && a12 + 43 <= 0)) || (((8 == a15 && a24 == 1) && 10 == a21) && 80 < a12)) || ((a12 <= 75 && 8 == a15 && a24 == 1) && a21 == 9)) || (((((a12 + 43 <= 0 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && !(8 == a15)) || ((((((!(a21 == 9) && !(8 == a15)) && !(8 == a21)) && a12 <= 73281) && 0 < a12 + 43) && (!(7 == a15) && a24 == 1) && a15 <= 8) && !(a21 == 7))) || (!(8 == a15) && (a24 == 1 && (((!(7 == a15) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && a21 <= 6))) && 0 < a12 + 43)) && a12 <= 11) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 73.3s, OverallIterations: 24, TraceHistogramMax: 17, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, HoareTripleCheckerStatistics: 1434 SDtfs, 6844 SDslu, 341 SDs, 0 SdLazy, 23538 SolverSat, 2233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5401 GetRequests, 5280 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6590occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 6520 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 102 NumberOfFragments, 1419 HoareAnnotationTreeSize, 3 FomulaSimplifications, 47292 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 23140 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 29123 NumberOfCodeBlocks, 29123 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 29091 ConstructedInterpolants, 0 QuantifiedInterpolants, 99448291 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6551 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 118766/120328 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 correct! Received shutdown request...