./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.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_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/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 14021e9fff9123a734a262a9d34c71e4922bd817 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:42,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:52:42,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:52:43,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:52:43,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:52:43,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:52:43,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:52:43,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:52:43,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:52:43,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:52:43,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:52:43,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:52:43,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:52:43,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:52:43,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:52:43,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:52:43,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:52:43,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:52:43,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:52:43,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:52:43,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:52:43,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:52:43,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:52:43,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:52:43,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:52:43,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:52:43,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:52:43,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:52:43,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:52:43,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:52:43,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:52:43,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:52:43,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:52:43,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:52:43,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:52:43,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:52:43,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:52:43,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:52:43,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:52:43,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:52:43,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:52:43,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:52:43,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:52:43,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:52:43,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:52:43,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:52:43,106 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:52:43,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:52:43,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:52:43,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:52:43,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:52:43,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:52:43,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:52:43,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:52:43,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:52:43,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:52:43,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:52:43,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:52:43,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:52:43,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:52:43,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:52:43,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:52:43,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:52:43,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:52:43,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:52:43,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:52:43,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:52:43,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:52:43,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:52:43,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:52:43,113 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_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/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 -> 14021e9fff9123a734a262a9d34c71e4922bd817 [2019-11-15 22:52:43,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:52:43,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:52:43,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:52:43,173 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:52:43,174 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:52:43,174 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-11-15 22:52:43,221 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/data/daf05c44b/7c9685aaafc5454c9ecab1e7c1423d5b/FLAG6a20c3e19 [2019-11-15 22:52:43,827 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:52:43,828 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-11-15 22:52:43,848 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/data/daf05c44b/7c9685aaafc5454c9ecab1e7c1423d5b/FLAG6a20c3e19 [2019-11-15 22:52:44,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/data/daf05c44b/7c9685aaafc5454c9ecab1e7c1423d5b [2019-11-15 22:52:44,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:52:44,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:52:44,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:52:44,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:52:44,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:52:44,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:52:44" (1/1) ... [2019-11-15 22:52:44,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5365288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:44, skipping insertion in model container [2019-11-15 22:52:44,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:52:44" (1/1) ... [2019-11-15 22:52:44,272 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:52:44,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:52:44,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:52:44,999 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:52:45,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:52:45,247 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:52:45,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45 WrapperNode [2019-11-15 22:52:45,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:52:45,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:52:45,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:52:45,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:52:45,257 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:52:45" (1/1) ... [2019-11-15 22:52:45,281 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:52:45" (1/1) ... [2019-11-15 22:52:45,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:52:45,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:52:45,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:52:45,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:52:45,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... [2019-11-15 22:52:45,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:52:45,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:52:45,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:52:45,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:52:45,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/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:52:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:52:45,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:52:47,690 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:52:47,691 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:52:47,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:47 BoogieIcfgContainer [2019-11-15 22:52:47,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:52:47,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:52:47,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:52:47,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:52:47,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:52:44" (1/3) ... [2019-11-15 22:52:47,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1c51cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:52:47, skipping insertion in model container [2019-11-15 22:52:47,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:45" (2/3) ... [2019-11-15 22:52:47,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1c51cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:52:47, skipping insertion in model container [2019-11-15 22:52:47,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:47" (3/3) ... [2019-11-15 22:52:47,698 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label02.c [2019-11-15 22:52:47,705 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:52:47,711 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:52:47,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:52:47,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:52:47,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:52:47,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:52:47,744 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:52:47,744 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:52:47,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:52:47,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:52:47,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:52:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 22:52:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:52:47,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:47,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash -635106638, now seen corresponding path program 1 times [2019-11-15 22:52:47,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:47,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708033660] [2019-11-15 22:52:47,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:47,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:47,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:48,422 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:52:48,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708033660] [2019-11-15 22:52:48,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:48,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:52:48,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192238264] [2019-11-15 22:52:48,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:52:48,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:48,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:52:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:52:48,441 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-15 22:52:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:50,767 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-15 22:52:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:52:50,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-15 22:52:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:50,788 INFO L225 Difference]: With dead ends: 1075 [2019-11-15 22:52:50,788 INFO L226 Difference]: Without dead ends: 677 [2019-11-15 22:52:50,793 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:52:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-15 22:52:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-15 22:52:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-15 22:52:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-15 22:52:50,859 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 204 [2019-11-15 22:52:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:50,860 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-15 22:52:50,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:52:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-15 22:52:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 22:52:50,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:50,867 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:50,868 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:50,868 INFO L82 PathProgramCache]: Analyzing trace with hash 317780433, now seen corresponding path program 1 times [2019-11-15 22:52:50,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:50,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751750258] [2019-11-15 22:52:50,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:50,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:50,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:50,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751750258] [2019-11-15 22:52:50,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:50,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:52:50,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450414666] [2019-11-15 22:52:50,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:50,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:50,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:52:50,992 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-15 22:52:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:52,068 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-15 22:52:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:52:52,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-15 22:52:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:52,074 INFO L225 Difference]: With dead ends: 1323 [2019-11-15 22:52:52,074 INFO L226 Difference]: Without dead ends: 874 [2019-11-15 22:52:52,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:52:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-15 22:52:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-15 22:52:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-15 22:52:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-15 22:52:52,115 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 212 [2019-11-15 22:52:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:52,116 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-15 22:52:52,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:52:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-15 22:52:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 22:52:52,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:52,123 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,124 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash 395983086, now seen corresponding path program 1 times [2019-11-15 22:52:52,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:52,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998966975] [2019-11-15 22:52:52,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:52,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:52,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:52,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998966975] [2019-11-15 22:52:52,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:52,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:52:52,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315416417] [2019-11-15 22:52:52,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:52,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:52:52,220 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-15 22:52:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:52,721 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-15 22:52:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:52:52,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-15 22:52:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:52,727 INFO L225 Difference]: With dead ends: 1695 [2019-11-15 22:52:52,727 INFO L226 Difference]: Without dead ends: 838 [2019-11-15 22:52:52,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:52:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-15 22:52:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-15 22:52:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-15 22:52:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-15 22:52:52,770 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 217 [2019-11-15 22:52:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:52,770 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-15 22:52:52,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:52:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-15 22:52:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-15 22:52:52,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:52,776 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1769273276, now seen corresponding path program 1 times [2019-11-15 22:52:52,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:52,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805790838] [2019-11-15 22:52:52,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:52,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:52,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:52:52,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805790838] [2019-11-15 22:52:52,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:52,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:52:52,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021733908] [2019-11-15 22:52:52,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:52:52,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:52:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:52:52,965 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-15 22:52:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:54,487 INFO L93 Difference]: Finished difference Result 3311 states and 4893 transitions. [2019-11-15 22:52:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:52:54,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-15 22:52:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:54,505 INFO L225 Difference]: With dead ends: 3311 [2019-11-15 22:52:54,505 INFO L226 Difference]: Without dead ends: 2475 [2019-11-15 22:52:54,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:52:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-15 22:52:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1655. [2019-11-15 22:52:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-15 22:52:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2336 transitions. [2019-11-15 22:52:54,559 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2336 transitions. Word has length 218 [2019-11-15 22:52:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:54,559 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2336 transitions. [2019-11-15 22:52:54,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:52:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2336 transitions. [2019-11-15 22:52:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-15 22:52:54,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:54,566 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash -73934984, now seen corresponding path program 1 times [2019-11-15 22:52:54,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:54,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392171204] [2019-11-15 22:52:54,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:54,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:54,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:52:54,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392171204] [2019-11-15 22:52:54,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:54,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:52:54,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212459745] [2019-11-15 22:52:54,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:54,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:54,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:54,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:52:54,689 INFO L87 Difference]: Start difference. First operand 1655 states and 2336 transitions. Second operand 3 states. [2019-11-15 22:52:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:55,124 INFO L93 Difference]: Finished difference Result 4955 states and 6996 transitions. [2019-11-15 22:52:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:52:55,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-15 22:52:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:55,143 INFO L225 Difference]: With dead ends: 4955 [2019-11-15 22:52:55,144 INFO L226 Difference]: Without dead ends: 3302 [2019-11-15 22:52:55,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:52:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2019-11-15 22:52:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3300. [2019-11-15 22:52:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2019-11-15 22:52:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4655 transitions. [2019-11-15 22:52:55,245 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4655 transitions. Word has length 224 [2019-11-15 22:52:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:55,245 INFO L462 AbstractCegarLoop]: Abstraction has 3300 states and 4655 transitions. [2019-11-15 22:52:55,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:52:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4655 transitions. [2019-11-15 22:52:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-15 22:52:55,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:55,255 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:55,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1732733814, now seen corresponding path program 1 times [2019-11-15 22:52:55,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:55,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140414495] [2019-11-15 22:52:55,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:55,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:55,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:55,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140414495] [2019-11-15 22:52:55,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:55,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:52:55,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692810941] [2019-11-15 22:52:55,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:52:55,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:52:55,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:52:55,471 INFO L87 Difference]: Start difference. First operand 3300 states and 4655 transitions. Second operand 5 states. [2019-11-15 22:52:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:57,241 INFO L93 Difference]: Finished difference Result 7633 states and 10834 transitions. [2019-11-15 22:52:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:52:57,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-11-15 22:52:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:57,266 INFO L225 Difference]: With dead ends: 7633 [2019-11-15 22:52:57,266 INFO L226 Difference]: Without dead ends: 4335 [2019-11-15 22:52:57,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:52:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-11-15 22:52:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 3503. [2019-11-15 22:52:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-11-15 22:52:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4897 transitions. [2019-11-15 22:52:57,356 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4897 transitions. Word has length 242 [2019-11-15 22:52:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:57,356 INFO L462 AbstractCegarLoop]: Abstraction has 3503 states and 4897 transitions. [2019-11-15 22:52:57,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:52:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4897 transitions. [2019-11-15 22:52:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 22:52:57,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:57,364 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash -177417023, now seen corresponding path program 1 times [2019-11-15 22:52:57,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:57,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864462989] [2019-11-15 22:52:57,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:57,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:57,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:57,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864462989] [2019-11-15 22:52:57,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:57,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:52:57,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295726826] [2019-11-15 22:52:57,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:57,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:52:57,601 INFO L87 Difference]: Start difference. First operand 3503 states and 4897 transitions. Second operand 3 states. [2019-11-15 22:52:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:52:58,498 INFO L93 Difference]: Finished difference Result 8651 states and 12071 transitions. [2019-11-15 22:52:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:52:58,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-15 22:52:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:52:58,524 INFO L225 Difference]: With dead ends: 8651 [2019-11-15 22:52:58,525 INFO L226 Difference]: Without dead ends: 5150 [2019-11-15 22:52:58,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:52:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2019-11-15 22:52:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5148. [2019-11-15 22:52:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2019-11-15 22:52:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 7124 transitions. [2019-11-15 22:52:58,629 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 7124 transitions. Word has length 245 [2019-11-15 22:52:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:52:58,629 INFO L462 AbstractCegarLoop]: Abstraction has 5148 states and 7124 transitions. [2019-11-15 22:52:58,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:52:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 7124 transitions. [2019-11-15 22:52:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:52:58,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:52:58,640 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:58,641 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:52:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -285299978, now seen corresponding path program 1 times [2019-11-15 22:52:58,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:58,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110005292] [2019-11-15 22:52:58,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:58,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:58,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:58,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110005292] [2019-11-15 22:52:58,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873266573] [2019-11-15 22:52:58,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/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:52:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:59,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:52:59,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:52:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:52:59,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:52:59,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 22:52:59,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294536250] [2019-11-15 22:52:59,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:52:59,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:59,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:52:59,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:52:59,146 INFO L87 Difference]: Start difference. First operand 5148 states and 7124 transitions. Second operand 3 states. [2019-11-15 22:53:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:00,292 INFO L93 Difference]: Finished difference Result 14966 states and 20735 transitions. [2019-11-15 22:53:00,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:00,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-15 22:53:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:00,355 INFO L225 Difference]: With dead ends: 14966 [2019-11-15 22:53:00,356 INFO L226 Difference]: Without dead ends: 9820 [2019-11-15 22:53:00,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2019-11-15 22:53:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9817. [2019-11-15 22:53:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9817 states. [2019-11-15 22:53:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9817 states to 9817 states and 13584 transitions. [2019-11-15 22:53:00,552 INFO L78 Accepts]: Start accepts. Automaton has 9817 states and 13584 transitions. Word has length 252 [2019-11-15 22:53:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:00,552 INFO L462 AbstractCegarLoop]: Abstraction has 9817 states and 13584 transitions. [2019-11-15 22:53:00,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 9817 states and 13584 transitions. [2019-11-15 22:53:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-15 22:53:00,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:00,571 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:00,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:00,776 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1508910405, now seen corresponding path program 1 times [2019-11-15 22:53:00,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:00,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233044694] [2019-11-15 22:53:00,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:00,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:00,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-15 22:53:00,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233044694] [2019-11-15 22:53:00,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:00,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:00,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797489217] [2019-11-15 22:53:00,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:00,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:00,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:00,901 INFO L87 Difference]: Start difference. First operand 9817 states and 13584 transitions. Second operand 3 states. [2019-11-15 22:53:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:01,874 INFO L93 Difference]: Finished difference Result 27349 states and 37743 transitions. [2019-11-15 22:53:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:01,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-11-15 22:53:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:01,905 INFO L225 Difference]: With dead ends: 27349 [2019-11-15 22:53:01,906 INFO L226 Difference]: Without dead ends: 17534 [2019-11-15 22:53:01,919 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:53:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-15 22:53:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-15 22:53:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-15 22:53:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 22681 transitions. [2019-11-15 22:53:02,176 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 22681 transitions. Word has length 279 [2019-11-15 22:53:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:02,176 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 22681 transitions. [2019-11-15 22:53:02,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 22681 transitions. [2019-11-15 22:53:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 22:53:02,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:02,207 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:02,207 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1279960778, now seen corresponding path program 1 times [2019-11-15 22:53:02,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:02,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108100303] [2019-11-15 22:53:02,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:02,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:02,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-15 22:53:02,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108100303] [2019-11-15 22:53:02,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:02,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:02,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205415504] [2019-11-15 22:53:02,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:02,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:02,347 INFO L87 Difference]: Start difference. First operand 17532 states and 22681 transitions. Second operand 3 states. [2019-11-15 22:53:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:03,434 INFO L93 Difference]: Finished difference Result 35066 states and 45367 transitions. [2019-11-15 22:53:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:03,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-15 22:53:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:03,465 INFO L225 Difference]: With dead ends: 35066 [2019-11-15 22:53:03,465 INFO L226 Difference]: Without dead ends: 17536 [2019-11-15 22:53:03,485 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:53:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17536 states. [2019-11-15 22:53:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17536 to 17532. [2019-11-15 22:53:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-15 22:53:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20680 transitions. [2019-11-15 22:53:03,692 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20680 transitions. Word has length 281 [2019-11-15 22:53:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:03,692 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20680 transitions. [2019-11-15 22:53:03,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20680 transitions. [2019-11-15 22:53:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-15 22:53:03,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:03,719 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:03,719 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:03,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash 166387689, now seen corresponding path program 1 times [2019-11-15 22:53:03,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:03,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502043664] [2019-11-15 22:53:03,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:03,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:03,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-15 22:53:03,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502043664] [2019-11-15 22:53:03,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:03,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:03,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540549039] [2019-11-15 22:53:03,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:03,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:03,853 INFO L87 Difference]: Start difference. First operand 17532 states and 20680 transitions. Second operand 4 states. [2019-11-15 22:53:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:04,825 INFO L93 Difference]: Finished difference Result 35064 states and 41362 transitions. [2019-11-15 22:53:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:04,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-15 22:53:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:04,850 INFO L225 Difference]: With dead ends: 35064 [2019-11-15 22:53:04,850 INFO L226 Difference]: Without dead ends: 17534 [2019-11-15 22:53:04,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:53:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-15 22:53:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-15 22:53:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-15 22:53:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20168 transitions. [2019-11-15 22:53:05,072 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20168 transitions. Word has length 299 [2019-11-15 22:53:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:05,073 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20168 transitions. [2019-11-15 22:53:05,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20168 transitions. [2019-11-15 22:53:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 22:53:05,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:05,096 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:05,097 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:05,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash 319416056, now seen corresponding path program 1 times [2019-11-15 22:53:05,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:05,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808051763] [2019-11-15 22:53:05,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:05,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:05,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-15 22:53:05,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808051763] [2019-11-15 22:53:05,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736414513] [2019-11-15 22:53:05,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/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:53:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:05,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:53:05,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:53:05,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:53:05,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 22:53:05,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025663788] [2019-11-15 22:53:05,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:05,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:05,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:05,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:05,749 INFO L87 Difference]: Start difference. First operand 17532 states and 20168 transitions. Second operand 3 states. [2019-11-15 22:53:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:06,708 INFO L93 Difference]: Finished difference Result 34660 states and 39896 transitions. [2019-11-15 22:53:06,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:06,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-15 22:53:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:06,728 INFO L225 Difference]: With dead ends: 34660 [2019-11-15 22:53:06,728 INFO L226 Difference]: Without dead ends: 17130 [2019-11-15 22:53:06,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-11-15 22:53:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-11-15 22:53:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-11-15 22:53:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18372 transitions. [2019-11-15 22:53:06,925 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18372 transitions. Word has length 305 [2019-11-15 22:53:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:06,926 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18372 transitions. [2019-11-15 22:53:06,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18372 transitions. [2019-11-15 22:53:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-15 22:53:06,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:06,944 INFO L380 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:07,150 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 319777275, now seen corresponding path program 1 times [2019-11-15 22:53:07,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:07,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743272475] [2019-11-15 22:53:07,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:07,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:07,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-15 22:53:07,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743272475] [2019-11-15 22:53:07,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157362814] [2019-11-15 22:53:07,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/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:53:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:07,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:53:07,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 22:53:07,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:53:07,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-15 22:53:07,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005923536] [2019-11-15 22:53:07,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:07,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:07,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:07,780 INFO L87 Difference]: Start difference. First operand 16314 states and 18372 transitions. Second operand 3 states. [2019-11-15 22:53:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:08,248 INFO L93 Difference]: Finished difference Result 47676 states and 53654 transitions. [2019-11-15 22:53:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:08,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-11-15 22:53:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:08,274 INFO L225 Difference]: With dead ends: 47676 [2019-11-15 22:53:08,274 INFO L226 Difference]: Without dead ends: 31364 [2019-11-15 22:53:08,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-11-15 22:53:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-11-15 22:53:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-11-15 22:53:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35269 transitions. [2019-11-15 22:53:08,617 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35269 transitions. Word has length 334 [2019-11-15 22:53:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:08,618 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35269 transitions. [2019-11-15 22:53:08,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35269 transitions. [2019-11-15 22:53:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-15 22:53:08,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:08,641 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:08,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:08,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1227130941, now seen corresponding path program 1 times [2019-11-15 22:53:08,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:08,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479913886] [2019-11-15 22:53:08,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:08,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:08,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-15 22:53:09,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479913886] [2019-11-15 22:53:09,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:09,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:09,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077838619] [2019-11-15 22:53:09,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:09,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:09,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:09,113 INFO L87 Difference]: Start difference. First operand 31362 states and 35269 transitions. Second operand 3 states. [2019-11-15 22:53:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:09,631 INFO L93 Difference]: Finished difference Result 91421 states and 102843 transitions. [2019-11-15 22:53:09,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:09,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-11-15 22:53:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:09,678 INFO L225 Difference]: With dead ends: 91421 [2019-11-15 22:53:09,679 INFO L226 Difference]: Without dead ends: 60061 [2019-11-15 22:53:09,700 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:53:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60061 states. [2019-11-15 22:53:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60061 to 60059. [2019-11-15 22:53:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60059 states. [2019-11-15 22:53:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60059 states to 60059 states and 67560 transitions. [2019-11-15 22:53:10,698 INFO L78 Accepts]: Start accepts. Automaton has 60059 states and 67560 transitions. Word has length 402 [2019-11-15 22:53:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:10,699 INFO L462 AbstractCegarLoop]: Abstraction has 60059 states and 67560 transitions. [2019-11-15 22:53:10,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60059 states and 67560 transitions. [2019-11-15 22:53:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-11-15 22:53:10,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:10,739 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:10,739 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1835984863, now seen corresponding path program 1 times [2019-11-15 22:53:10,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:10,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893218815] [2019-11-15 22:53:10,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:10,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 22:53:11,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893218815] [2019-11-15 22:53:11,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:11,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:11,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192312047] [2019-11-15 22:53:11,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:11,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:11,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:11,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:11,027 INFO L87 Difference]: Start difference. First operand 60059 states and 67560 transitions. Second operand 3 states. [2019-11-15 22:53:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:11,617 INFO L93 Difference]: Finished difference Result 170158 states and 191231 transitions. [2019-11-15 22:53:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:11,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2019-11-15 22:53:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:11,714 INFO L225 Difference]: With dead ends: 170158 [2019-11-15 22:53:11,714 INFO L226 Difference]: Without dead ends: 110101 [2019-11-15 22:53:11,749 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:53:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110101 states. [2019-11-15 22:53:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110101 to 110099. [2019-11-15 22:53:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110099 states. [2019-11-15 22:53:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110099 states to 110099 states and 123037 transitions. [2019-11-15 22:53:13,127 INFO L78 Accepts]: Start accepts. Automaton has 110099 states and 123037 transitions. Word has length 406 [2019-11-15 22:53:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:13,127 INFO L462 AbstractCegarLoop]: Abstraction has 110099 states and 123037 transitions. [2019-11-15 22:53:13,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 110099 states and 123037 transitions. [2019-11-15 22:53:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-15 22:53:13,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:13,192 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:13,192 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1939314004, now seen corresponding path program 1 times [2019-11-15 22:53:13,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:13,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965025298] [2019-11-15 22:53:13,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:53:13,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965025298] [2019-11-15 22:53:13,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:13,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:53:13,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346774926] [2019-11-15 22:53:13,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:13,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:13,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:13,469 INFO L87 Difference]: Start difference. First operand 110099 states and 123037 transitions. Second operand 3 states. [2019-11-15 22:53:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:14,431 INFO L93 Difference]: Finished difference Result 279372 states and 311596 transitions. [2019-11-15 22:53:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:14,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-11-15 22:53:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:14,592 INFO L225 Difference]: With dead ends: 279372 [2019-11-15 22:53:14,592 INFO L226 Difference]: Without dead ends: 169275 [2019-11-15 22:53:14,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:53:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169275 states. [2019-11-15 22:53:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169275 to 169273. [2019-11-15 22:53:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169273 states. [2019-11-15 22:53:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169273 states to 169273 states and 188538 transitions. [2019-11-15 22:53:17,116 INFO L78 Accepts]: Start accepts. Automaton has 169273 states and 188538 transitions. Word has length 408 [2019-11-15 22:53:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:17,117 INFO L462 AbstractCegarLoop]: Abstraction has 169273 states and 188538 transitions. [2019-11-15 22:53:17,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 169273 states and 188538 transitions. [2019-11-15 22:53:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-15 22:53:17,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:17,247 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:17,247 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 20202666, now seen corresponding path program 1 times [2019-11-15 22:53:17,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360717797] [2019-11-15 22:53:17,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-11-15 22:53:17,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360717797] [2019-11-15 22:53:17,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:17,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:17,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382962664] [2019-11-15 22:53:17,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:53:17,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:17,426 INFO L87 Difference]: Start difference. First operand 169273 states and 188538 transitions. Second operand 4 states. [2019-11-15 22:53:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:22,585 INFO L93 Difference]: Finished difference Result 365751 states and 409365 transitions. [2019-11-15 22:53:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:53:22,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-15 22:53:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:22,777 INFO L225 Difference]: With dead ends: 365751 [2019-11-15 22:53:22,777 INFO L226 Difference]: Without dead ends: 196480 [2019-11-15 22:53:22,829 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:53:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196480 states. [2019-11-15 22:53:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196480 to 196456. [2019-11-15 22:53:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196456 states. [2019-11-15 22:53:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196456 states to 196456 states and 215216 transitions. [2019-11-15 22:53:24,758 INFO L78 Accepts]: Start accepts. Automaton has 196456 states and 215216 transitions. Word has length 420 [2019-11-15 22:53:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:24,758 INFO L462 AbstractCegarLoop]: Abstraction has 196456 states and 215216 transitions. [2019-11-15 22:53:24,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:53:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 196456 states and 215216 transitions. [2019-11-15 22:53:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-15 22:53:24,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:24,828 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:24,828 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2075258228, now seen corresponding path program 1 times [2019-11-15 22:53:24,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:24,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042931404] [2019-11-15 22:53:24,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-15 22:53:25,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042931404] [2019-11-15 22:53:25,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:25,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:25,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892153950] [2019-11-15 22:53:25,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:25,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:25,288 INFO L87 Difference]: Start difference. First operand 196456 states and 215216 transitions. Second operand 3 states. [2019-11-15 22:53:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:27,372 INFO L93 Difference]: Finished difference Result 390297 states and 427717 transitions. [2019-11-15 22:53:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:27,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-15 22:53:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:27,556 INFO L225 Difference]: With dead ends: 390297 [2019-11-15 22:53:27,556 INFO L226 Difference]: Without dead ends: 193843 [2019-11-15 22:53:27,627 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:53:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193843 states. [2019-11-15 22:53:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193843 to 190366. [2019-11-15 22:53:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190366 states. [2019-11-15 22:53:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190366 states to 190366 states and 206912 transitions. [2019-11-15 22:53:29,485 INFO L78 Accepts]: Start accepts. Automaton has 190366 states and 206912 transitions. Word has length 469 [2019-11-15 22:53:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:29,485 INFO L462 AbstractCegarLoop]: Abstraction has 190366 states and 206912 transitions. [2019-11-15 22:53:29,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 190366 states and 206912 transitions. [2019-11-15 22:53:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-11-15 22:53:29,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:53:29,552 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:29,552 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:53:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1215708500, now seen corresponding path program 1 times [2019-11-15 22:53:29,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:29,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300890482] [2019-11-15 22:53:29,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:29,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:29,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-15 22:53:30,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300890482] [2019-11-15 22:53:30,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:30,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:30,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036494759] [2019-11-15 22:53:30,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:53:30,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:30,840 INFO L87 Difference]: Start difference. First operand 190366 states and 206912 transitions. Second operand 3 states. [2019-11-15 22:53:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:32,306 INFO L93 Difference]: Finished difference Result 401497 states and 437034 transitions. [2019-11-15 22:53:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:32,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2019-11-15 22:53:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:53:32,307 INFO L225 Difference]: With dead ends: 401497 [2019-11-15 22:53:32,307 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:53:32,392 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:53:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:53:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:53:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:53:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:53:32,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 484 [2019-11-15 22:53:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:53:32,393 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:32,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:53:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:53:32,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:53:32,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:53:39,246 WARN L191 SmtUtils]: Spent 6.83 s on a formula simplification. DAG size of input: 1075 DAG size of output: 479 [2019-11-15 22:53:44,737 WARN L191 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 1075 DAG size of output: 479 [2019-11-15 22:53:51,262 WARN L191 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 474 DAG size of output: 100 [2019-11-15 22:53:57,696 WARN L191 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 474 DAG size of output: 100 [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 22:53:57,698 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,699 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,700 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:53:57,701 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,702 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 22:53:57,703 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,704 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,705 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 22:53:57,706 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:53:57,707 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1647) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:53:57,708 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,709 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,710 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse7 (= 1 ~a6~0)) (.cse2 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse13 (not .cse2)) (.cse22 (not .cse7)) (.cse3 (= ~a5~0 1))) (let ((.cse16 (and .cse22 .cse3)) (.cse17 (and .cse13 .cse22 .cse3)) (.cse23 (not .cse1)) (.cse6 (= ~a16~0 1))) (let ((.cse12 (and .cse17 .cse23 .cse6)) (.cse21 (and .cse23 .cse6 .cse16)) (.cse18 (= 1 ~a3~0)) (.cse20 (= 1 ~a8~0)) (.cse8 (and .cse23 .cse3 .cse6)) (.cse11 (= 1 ~a0~0)) (.cse0 (<= ~a3~0 0)) (.cse15 (<= ~a11~0 0)) (.cse10 (= 1 ~a4~0)) (.cse19 (and .cse13 .cse1 .cse22 .cse3)) (.cse14 (<= 1 ~a3~0)) (.cse4 (= ~a11~0 1)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a15~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse10) (and .cse4 .cse5 .cse11 .cse9 .cse12) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse11) (and .cse14 .cse2 .cse15 .cse5 .cse9 .cse16) (and .cse17 .cse18 .cse15 .cse11) (and .cse17 .cse14 .cse4 .cse11) (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse19 .cse15 .cse11) (and .cse18 .cse7 .cse15 .cse3 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse11 .cse5 .cse10) (and .cse14 .cse4 .cse9 .cse12) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse11) (and .cse13 .cse1 .cse18 .cse20 .cse3 .cse4 .cse5) (and .cse2 .cse21 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse19 .cse4 .cse6 .cse10) (and .cse14 .cse4 .cse5 .cse11 .cse16) (and .cse13 .cse7 .cse15 .cse3 .cse11) (and .cse19 .cse4 .cse11) (and .cse19 .cse18 .cse4 .cse6) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse14 .cse2 .cse4 .cse5 .cse9 .cse16 .cse10) (and .cse0 .cse2 .cse15 .cse20 .cse9 .cse16) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse21 .cse11) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse11 .cse9) (and .cse18 .cse7 .cse2 .cse8 .cse4) (and .cse0 .cse2 .cse20 .cse21 .cse4 .cse5) (and .cse18 .cse2 .cse4 .cse5 .cse16 .cse10) (and .cse13 .cse7 .cse15 .cse3 .cse5) (and .cse14 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse9) (and (and .cse0 .cse13 .cse7 .cse3 .cse4 .cse6) .cse5 .cse10) (and .cse0 .cse13 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse2 .cse15 .cse16 .cse10) (and .cse14 .cse19 .cse15 .cse5 .cse9) (and .cse0 (and .cse1 .cse22 .cse3) .cse2 .cse15 .cse5) (and .cse0 .cse19 .cse4 .cse9 .cse10) (and .cse18 .cse7 .cse15 .cse3 .cse5 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse14 .cse2 .cse21 .cse4 .cse5 .cse10) (and .cse17 .cse18 .cse15 .cse5 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse9 .cse10) (and (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse6) .cse10) (and .cse7 .cse8 .cse15 .cse11 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse11) (and .cse14 .cse1 .cse15 .cse20 .cse3 .cse11) (and .cse0 .cse7 .cse8 .cse15 .cse11) (and .cse13 .cse14 .cse1 .cse7 .cse15 .cse3) (and .cse0 .cse7 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse19 .cse15 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse9 .cse10) (and .cse14 .cse19 .cse4 .cse5) (and .cse13 .cse14 .cse7 .cse3 .cse4 .cse5 .cse9)))))) [2019-11-15 22:53:57,710 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,710 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,710 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 22:53:57,711 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,712 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 22:53:57,713 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 22:53:57,713 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,713 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,713 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:53:57,713 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:53:57,713 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse7 (= 1 ~a6~0)) (.cse2 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse13 (not .cse2)) (.cse22 (not .cse7)) (.cse3 (= ~a5~0 1))) (let ((.cse16 (and .cse22 .cse3)) (.cse17 (and .cse13 .cse22 .cse3)) (.cse23 (not .cse1)) (.cse6 (= ~a16~0 1))) (let ((.cse12 (and .cse17 .cse23 .cse6)) (.cse21 (and .cse23 .cse6 .cse16)) (.cse18 (= 1 ~a3~0)) (.cse20 (= 1 ~a8~0)) (.cse8 (and .cse23 .cse3 .cse6)) (.cse11 (= 1 ~a0~0)) (.cse0 (<= ~a3~0 0)) (.cse15 (<= ~a11~0 0)) (.cse10 (= 1 ~a4~0)) (.cse19 (and .cse13 .cse1 .cse22 .cse3)) (.cse14 (<= 1 ~a3~0)) (.cse4 (= ~a11~0 1)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a15~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse10) (and .cse4 .cse5 .cse11 .cse9 .cse12) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse11) (and .cse14 .cse2 .cse15 .cse5 .cse9 .cse16) (and .cse17 .cse18 .cse15 .cse11) (and .cse17 .cse14 .cse4 .cse11) (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse19 .cse15 .cse11) (and .cse18 .cse7 .cse15 .cse3 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse11 .cse5 .cse10) (and .cse14 .cse4 .cse9 .cse12) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse11) (and .cse13 .cse1 .cse18 .cse20 .cse3 .cse4 .cse5) (and .cse2 .cse21 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse19 .cse4 .cse6 .cse10) (and .cse14 .cse4 .cse5 .cse11 .cse16) (and .cse13 .cse7 .cse15 .cse3 .cse11) (and .cse19 .cse4 .cse11) (and .cse19 .cse18 .cse4 .cse6) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse14 .cse2 .cse4 .cse5 .cse9 .cse16 .cse10) (and .cse0 .cse2 .cse15 .cse20 .cse9 .cse16) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse21 .cse11) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse11 .cse9) (and .cse18 .cse7 .cse2 .cse8 .cse4) (and .cse0 .cse2 .cse20 .cse21 .cse4 .cse5) (and .cse18 .cse2 .cse4 .cse5 .cse16 .cse10) (and .cse13 .cse7 .cse15 .cse3 .cse5) (and .cse14 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse9) (and (and .cse0 .cse13 .cse7 .cse3 .cse4 .cse6) .cse5 .cse10) (and .cse0 .cse13 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse2 .cse15 .cse16 .cse10) (and .cse14 .cse19 .cse15 .cse5 .cse9) (and .cse0 (and .cse1 .cse22 .cse3) .cse2 .cse15 .cse5) (and .cse0 .cse19 .cse4 .cse9 .cse10) (and .cse18 .cse7 .cse15 .cse3 .cse5 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse14 .cse2 .cse21 .cse4 .cse5 .cse10) (and .cse17 .cse18 .cse15 .cse5 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse9 .cse10) (and (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse6) .cse10) (and .cse7 .cse8 .cse15 .cse11 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse11) (and .cse14 .cse1 .cse15 .cse20 .cse3 .cse11) (and .cse0 .cse7 .cse8 .cse15 .cse11) (and .cse13 .cse14 .cse1 .cse7 .cse15 .cse3) (and .cse0 .cse7 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse19 .cse15 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse9 .cse10) (and .cse14 .cse19 .cse4 .cse5) (and .cse13 .cse14 .cse7 .cse3 .cse4 .cse5 .cse9)))))) [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,714 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,715 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:53:57,716 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,717 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,718 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,719 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 22:53:57,720 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,721 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 22:53:57,722 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,723 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 22:53:57,724 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 22:53:57,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:53:57 BoogieIcfgContainer [2019-11-15 22:53:57,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:53:57,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:53:57,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:53:57,779 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:53:57,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:47" (3/4) ... [2019-11-15 22:53:57,783 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:53:57,814 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:53:57,818 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:53:58,007 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7c084f5c-a8a9-44f5-ab61-fffd0adbe1e0/bin/uautomizer/witness.graphml [2019-11-15 22:53:58,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:53:58,009 INFO L168 Benchmark]: Toolchain (without parser) took 73758.61 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 938.0 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,009 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:58,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 996.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.86 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,010 INFO L168 Benchmark]: Boogie Preprocessor took 91.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,011 INFO L168 Benchmark]: RCFGBuilder took 2255.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,011 INFO L168 Benchmark]: TraceAbstraction took 70086.08 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,011 INFO L168 Benchmark]: Witness Printer took 228.80 ms. Allocated memory is still 5.2 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:58,013 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 996.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.86 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2255.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70086.08 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 228.80 ms. Allocated memory is still 5.2 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1647]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) || ((((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || ((((a11 == 1 && a26 == 1) && 1 == a0) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((!(a12 == 1) && 1 <= a3) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 <= a3) && a11 == 1) && 1 == a0)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a0)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || (((1 <= a3 && a11 == 1) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && 1 == a3) && 1 == a8) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((1 <= a3 && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 == 1) && a16 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((1 <= a3 && a12 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a12 == 1) && a11 <= 0) && 1 == a8) && a15 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0) && a15 == 1)) || ((((1 == a3 && 1 == a6) && a12 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1)) || (((((a3 <= 0 && a12 == 1) && 1 == a8) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((1 == a3 && a12 == 1) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((((1 <= a3 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && a26 == 1) && a15 == 1)) || ((((a3 <= 0 && (a27 == 1 && !(1 == a6)) && a5 == 1) && a12 == 1) && a11 <= 0) && a26 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a15 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a4)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a16 == 1) && 1 == a4)) || ((((1 == a6 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a27 == 1) && a11 <= 0) && 1 == a8) && a5 == 1) && 1 == a0)) || ((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && 1 <= a3) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a4)) || ((((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a12 == 1) && 1 <= a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) || ((((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || ((((a11 == 1 && a26 == 1) && 1 == a0) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((!(a12 == 1) && 1 <= a3) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 <= a3) && a11 == 1) && 1 == a0)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a0)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || (((1 <= a3 && a11 == 1) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && 1 == a3) && 1 == a8) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((1 <= a3 && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 == 1) && a16 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((1 <= a3 && a12 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a12 == 1) && a11 <= 0) && 1 == a8) && a15 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0) && a15 == 1)) || ((((1 == a3 && 1 == a6) && a12 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1)) || (((((a3 <= 0 && a12 == 1) && 1 == a8) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((1 == a3 && a12 == 1) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((((1 <= a3 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && a26 == 1) && a15 == 1)) || ((((a3 <= 0 && (a27 == 1 && !(1 == a6)) && a5 == 1) && a12 == 1) && a11 <= 0) && a26 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a15 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a4)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a16 == 1) && 1 == a4)) || ((((1 == a6 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a27 == 1) && a11 <= 0) && 1 == a8) && a5 == 1) && 1 == a0)) || ((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && 1 <= a3) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a4)) || ((((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a12 == 1) && 1 <= a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 69.9s, OverallIterations: 19, TraceHistogramMax: 6, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.3s, HoareTripleCheckerStatistics: 4133 SDtfs, 5525 SDslu, 1702 SDs, 0 SdLazy, 10810 SolverSat, 2193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 910 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196456occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 6233 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1914 NumberOfFragments, 2711 HoareAnnotationTreeSize, 3 FomulaSimplifications, 44906 FormulaSimplificationTreeSizeReduction, 12.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 43620 FormulaSimplificationTreeSizeReductionInter, 12.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 6792 NumberOfCodeBlocks, 6792 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6770 ConstructedInterpolants, 0 QuantifiedInterpolants, 3386746 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1515 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 3549/3559 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...