./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/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 578a9aa08d4fb9af8adce08199c3eedf30155811 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:47:41,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:47:41,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:47:41,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:47:41,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:47:41,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:47:41,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:47:41,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:47:41,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:47:41,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:47:41,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:47:41,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:47:41,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:47:41,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:47:41,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:47:41,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:47:41,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:47:41,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:47:41,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:47:41,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:47:41,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:47:41,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:47:41,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:47:41,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:47:41,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:47:41,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:47:41,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:47:41,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:47:41,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:47:41,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:47:41,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:47:41,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:47:41,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:47:41,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:47:41,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:47:41,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:47:41,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:47:41,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:47:41,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:47:41,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:47:41,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:47:41,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:47:41,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:47:41,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:47:41,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:47:41,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:47:41,436 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:47:41,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:47:41,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:47:41,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:47:41,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:47:41,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:47:41,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:47:41,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:47:41,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:47:41,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:47:41,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:47:41,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:47:41,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:47:41,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:47:41,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:47:41,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:47:41,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:47:41,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:47:41,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:47:41,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:47:41,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:47:41,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:47:41,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:47:41,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:47:41,443 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_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/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 -> 578a9aa08d4fb9af8adce08199c3eedf30155811 [2019-11-19 21:47:41,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:47:41,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:47:41,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:47:41,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:47:41,625 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:47:41,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2019-11-19 21:47:41,675 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/data/c80f4b107/88c99fe96b9e456c855ace8388709198/FLAGee2f2e4c4 [2019-11-19 21:47:42,210 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:47:42,211 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2019-11-19 21:47:42,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/data/c80f4b107/88c99fe96b9e456c855ace8388709198/FLAGee2f2e4c4 [2019-11-19 21:47:42,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/data/c80f4b107/88c99fe96b9e456c855ace8388709198 [2019-11-19 21:47:42,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:47:42,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:47:42,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:42,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:47:42,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:47:42,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:42" (1/1) ... [2019-11-19 21:47:42,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd093d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:42, skipping insertion in model container [2019-11-19 21:47:42,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:42" (1/1) ... [2019-11-19 21:47:42,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:47:42,506 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:47:43,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:43,305 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:47:43,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:43,583 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:47:43,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43 WrapperNode [2019-11-19 21:47:43,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:43,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:43,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:47:43,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:47:43,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:43,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:47:43,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:47:43,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:47:43,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... [2019-11-19 21:47:43,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:47:43,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:47:43,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:47:43,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:47:43,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/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-19 21:47:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:47:44,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:47:47,232 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:47:47,232 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 21:47:47,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:47 BoogieIcfgContainer [2019-11-19 21:47:47,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:47:47,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:47:47,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:47:47,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:47:47,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:47:42" (1/3) ... [2019-11-19 21:47:47,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b5659f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:47, skipping insertion in model container [2019-11-19 21:47:47,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:43" (2/3) ... [2019-11-19 21:47:47,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b5659f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:47, skipping insertion in model container [2019-11-19 21:47:47,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:47" (3/3) ... [2019-11-19 21:47:47,241 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label13.c [2019-11-19 21:47:47,250 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:47:47,258 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:47:47,268 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:47:47,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:47:47,295 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:47:47,295 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:47:47,295 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:47:47,295 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:47:47,296 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:47:47,296 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:47:47,296 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:47:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-19 21:47:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 21:47:47,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:47,327 INFO L410 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] [2019-11-19 21:47:47,327 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2019-11-19 21:47:47,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:47,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570315065] [2019-11-19 21:47:47,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:47,597 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-19 21:47:47,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570315065] [2019-11-19 21:47:47,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:47,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:47:47,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741858639] [2019-11-19 21:47:47,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:47:47,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:47:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:47:47,620 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-19 21:47:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:52,356 INFO L93 Difference]: Finished difference Result 1506 states and 2774 transitions. [2019-11-19 21:47:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:47:52,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-19 21:47:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:52,381 INFO L225 Difference]: With dead ends: 1506 [2019-11-19 21:47:52,382 INFO L226 Difference]: Without dead ends: 1000 [2019-11-19 21:47:52,387 INFO L630 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-19 21:47:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-11-19 21:47:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 680. [2019-11-19 21:47:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-19 21:47:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2019-11-19 21:47:52,464 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 48 [2019-11-19 21:47:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:52,465 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2019-11-19 21:47:52,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:47:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2019-11-19 21:47:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-19 21:47:52,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:52,471 INFO L410 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, 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] [2019-11-19 21:47:52,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1328017793, now seen corresponding path program 1 times [2019-11-19 21:47:52,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:52,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572849397] [2019-11-19 21:47:52,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:52,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572849397] [2019-11-19 21:47:52,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:52,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:47:52,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556438088] [2019-11-19 21:47:52,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:47:52,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:47:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:47:52,652 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand 4 states. [2019-11-19 21:47:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:55,714 INFO L93 Difference]: Finished difference Result 2561 states and 4133 transitions. [2019-11-19 21:47:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:47:55,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-19 21:47:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:55,724 INFO L225 Difference]: With dead ends: 2561 [2019-11-19 21:47:55,725 INFO L226 Difference]: Without dead ends: 1883 [2019-11-19 21:47:55,728 INFO L630 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-19 21:47:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-11-19 21:47:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1278. [2019-11-19 21:47:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-11-19 21:47:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1775 transitions. [2019-11-19 21:47:55,788 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1775 transitions. Word has length 116 [2019-11-19 21:47:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:55,790 INFO L462 AbstractCegarLoop]: Abstraction has 1278 states and 1775 transitions. [2019-11-19 21:47:55,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:47:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1775 transitions. [2019-11-19 21:47:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 21:47:55,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:55,800 INFO L410 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, 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] [2019-11-19 21:47:55,800 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 851098733, now seen corresponding path program 1 times [2019-11-19 21:47:55,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:55,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115948430] [2019-11-19 21:47:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115948430] [2019-11-19 21:47:56,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:56,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:47:56,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737114416] [2019-11-19 21:47:56,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:47:56,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:56,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:47:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:47:56,149 INFO L87 Difference]: Start difference. First operand 1278 states and 1775 transitions. Second operand 6 states. [2019-11-19 21:48:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:01,578 INFO L93 Difference]: Finished difference Result 5270 states and 7256 transitions. [2019-11-19 21:48:01,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:48:01,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-11-19 21:48:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:01,598 INFO L225 Difference]: With dead ends: 5270 [2019-11-19 21:48:01,599 INFO L226 Difference]: Without dead ends: 3994 [2019-11-19 21:48:01,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:48:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-11-19 21:48:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3382. [2019-11-19 21:48:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-19 21:48:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4279 transitions. [2019-11-19 21:48:01,674 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4279 transitions. Word has length 124 [2019-11-19 21:48:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:01,675 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4279 transitions. [2019-11-19 21:48:01,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:48:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4279 transitions. [2019-11-19 21:48:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-19 21:48:01,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:01,679 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:48:01,679 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1777642279, now seen corresponding path program 1 times [2019-11-19 21:48:01,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:01,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038272506] [2019-11-19 21:48:01,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 162 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:02,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038272506] [2019-11-19 21:48:02,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205942227] [2019-11-19 21:48:02,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/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-19 21:48:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:02,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 21:48:02,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:48:02,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 21:48:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:02,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:48:02,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-19 21:48:02,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170618959] [2019-11-19 21:48:02,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 21:48:02,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:02,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 21:48:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:48:02,570 INFO L87 Difference]: Start difference. First operand 3382 states and 4279 transitions. Second operand 12 states. [2019-11-19 21:48:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:11,790 INFO L93 Difference]: Finished difference Result 10825 states and 13811 transitions. [2019-11-19 21:48:11,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 21:48:11,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 215 [2019-11-19 21:48:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:11,818 INFO L225 Difference]: With dead ends: 10825 [2019-11-19 21:48:11,818 INFO L226 Difference]: Without dead ends: 5794 [2019-11-19 21:48:11,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:48:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2019-11-19 21:48:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4890. [2019-11-19 21:48:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4890 states. [2019-11-19 21:48:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 5606 transitions. [2019-11-19 21:48:11,924 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 5606 transitions. Word has length 215 [2019-11-19 21:48:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:11,925 INFO L462 AbstractCegarLoop]: Abstraction has 4890 states and 5606 transitions. [2019-11-19 21:48:11,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:48:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 5606 transitions. [2019-11-19 21:48:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-19 21:48:11,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:11,933 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:48:12,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:48:12,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 350709814, now seen corresponding path program 1 times [2019-11-19 21:48:12,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:12,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926204275] [2019-11-19 21:48:12,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:12,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926204275] [2019-11-19 21:48:12,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:12,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:48:12,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888903697] [2019-11-19 21:48:12,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:12,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:12,544 INFO L87 Difference]: Start difference. First operand 4890 states and 5606 transitions. Second operand 4 states. [2019-11-19 21:48:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:16,045 INFO L93 Difference]: Finished difference Result 14866 states and 17358 transitions. [2019-11-19 21:48:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:16,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-11-19 21:48:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:16,084 INFO L225 Difference]: With dead ends: 14866 [2019-11-19 21:48:16,084 INFO L226 Difference]: Without dead ends: 9978 [2019-11-19 21:48:16,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9978 states. [2019-11-19 21:48:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9978 to 8775. [2019-11-19 21:48:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8775 states. [2019-11-19 21:48:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 10021 transitions. [2019-11-19 21:48:16,233 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 10021 transitions. Word has length 330 [2019-11-19 21:48:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:16,233 INFO L462 AbstractCegarLoop]: Abstraction has 8775 states and 10021 transitions. [2019-11-19 21:48:16,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 10021 transitions. [2019-11-19 21:48:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-11-19 21:48:16,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:16,244 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:48:16,245 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash -817019640, now seen corresponding path program 1 times [2019-11-19 21:48:16,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:16,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823019071] [2019-11-19 21:48:16,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 277 proven. 11 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 21:48:16,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823019071] [2019-11-19 21:48:16,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279339242] [2019-11-19 21:48:16,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/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-19 21:48:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:17,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:48:17,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:48:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 21:48:17,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:48:17,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-19 21:48:17,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193683993] [2019-11-19 21:48:17,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:17,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:48:17,281 INFO L87 Difference]: Start difference. First operand 8775 states and 10021 transitions. Second operand 3 states. [2019-11-19 21:48:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:18,642 INFO L93 Difference]: Finished difference Result 19043 states and 21857 transitions. [2019-11-19 21:48:18,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:18,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-11-19 21:48:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:18,685 INFO L225 Difference]: With dead ends: 19043 [2019-11-19 21:48:18,685 INFO L226 Difference]: Without dead ends: 10270 [2019-11-19 21:48:18,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 501 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:48:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10270 states. [2019-11-19 21:48:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10270 to 9971. [2019-11-19 21:48:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9971 states. [2019-11-19 21:48:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 11433 transitions. [2019-11-19 21:48:18,827 INFO L78 Accepts]: Start accepts. Automaton has 9971 states and 11433 transitions. Word has length 501 [2019-11-19 21:48:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:18,828 INFO L462 AbstractCegarLoop]: Abstraction has 9971 states and 11433 transitions. [2019-11-19 21:48:18,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 9971 states and 11433 transitions. [2019-11-19 21:48:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-11-19 21:48:18,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:18,840 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:48:19,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:48:19,043 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1138954628, now seen corresponding path program 1 times [2019-11-19 21:48:19,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:19,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430843566] [2019-11-19 21:48:19,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-11-19 21:48:19,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430843566] [2019-11-19 21:48:19,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676884394] [2019-11-19 21:48:19,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/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-19 21:48:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:19,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:48:19,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:48:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-19 21:48:20,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:48:20,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-19 21:48:20,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145218553] [2019-11-19 21:48:20,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:20,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:20,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:20,229 INFO L87 Difference]: Start difference. First operand 9971 states and 11433 transitions. Second operand 3 states. [2019-11-19 21:48:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:21,555 INFO L93 Difference]: Finished difference Result 22337 states and 25426 transitions. [2019-11-19 21:48:21,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:21,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-11-19 21:48:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:21,576 INFO L225 Difference]: With dead ends: 22337 [2019-11-19 21:48:21,576 INFO L226 Difference]: Without dead ends: 12368 [2019-11-19 21:48:21,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 507 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-19 21:48:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12368 states. [2019-11-19 21:48:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12368 to 11768. [2019-11-19 21:48:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11768 states. [2019-11-19 21:48:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 13301 transitions. [2019-11-19 21:48:21,709 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 13301 transitions. Word has length 507 [2019-11-19 21:48:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:21,709 INFO L462 AbstractCegarLoop]: Abstraction has 11768 states and 13301 transitions. [2019-11-19 21:48:21,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 13301 transitions. [2019-11-19 21:48:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-11-19 21:48:21,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:21,726 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:48:21,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:48:21,937 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1745026675, now seen corresponding path program 1 times [2019-11-19 21:48:21,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:21,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118926958] [2019-11-19 21:48:21,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-19 21:48:22,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118926958] [2019-11-19 21:48:22,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:22,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:48:22,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252743214] [2019-11-19 21:48:22,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:48:22,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:22,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:48:22,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:22,489 INFO L87 Difference]: Start difference. First operand 11768 states and 13301 transitions. Second operand 4 states. [2019-11-19 21:48:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:24,512 INFO L93 Difference]: Finished difference Result 23238 states and 26294 transitions. [2019-11-19 21:48:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:48:24,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 576 [2019-11-19 21:48:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:24,531 INFO L225 Difference]: With dead ends: 23238 [2019-11-19 21:48:24,531 INFO L226 Difference]: Without dead ends: 11472 [2019-11-19 21:48:24,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:48:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2019-11-19 21:48:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11163. [2019-11-19 21:48:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11163 states. [2019-11-19 21:48:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11163 states to 11163 states and 12310 transitions. [2019-11-19 21:48:24,655 INFO L78 Accepts]: Start accepts. Automaton has 11163 states and 12310 transitions. Word has length 576 [2019-11-19 21:48:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:24,656 INFO L462 AbstractCegarLoop]: Abstraction has 11163 states and 12310 transitions. [2019-11-19 21:48:24,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:48:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11163 states and 12310 transitions. [2019-11-19 21:48:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-11-19 21:48:24,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:24,664 INFO L410 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:48:24,664 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash -964489000, now seen corresponding path program 1 times [2019-11-19 21:48:24,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:24,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347914920] [2019-11-19 21:48:24,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-11-19 21:48:25,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347914920] [2019-11-19 21:48:25,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:25,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:25,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655568912] [2019-11-19 21:48:25,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:25,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:25,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:25,281 INFO L87 Difference]: Start difference. First operand 11163 states and 12310 transitions. Second operand 3 states. [2019-11-19 21:48:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:27,498 INFO L93 Difference]: Finished difference Result 28899 states and 32051 transitions. [2019-11-19 21:48:27,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:27,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 586 [2019-11-19 21:48:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:27,524 INFO L225 Difference]: With dead ends: 28899 [2019-11-19 21:48:27,525 INFO L226 Difference]: Without dead ends: 17738 [2019-11-19 21:48:27,535 INFO L630 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-19 21:48:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17738 states. [2019-11-19 21:48:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17738 to 13849. [2019-11-19 21:48:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13849 states. [2019-11-19 21:48:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13849 states to 13849 states and 15513 transitions. [2019-11-19 21:48:27,690 INFO L78 Accepts]: Start accepts. Automaton has 13849 states and 15513 transitions. Word has length 586 [2019-11-19 21:48:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:27,691 INFO L462 AbstractCegarLoop]: Abstraction has 13849 states and 15513 transitions. [2019-11-19 21:48:27,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13849 states and 15513 transitions. [2019-11-19 21:48:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-11-19 21:48:27,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:27,699 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-19 21:48:27,699 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2025829424, now seen corresponding path program 1 times [2019-11-19 21:48:27,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:27,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91332218] [2019-11-19 21:48:27,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-11-19 21:48:28,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91332218] [2019-11-19 21:48:28,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:28,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:28,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371682133] [2019-11-19 21:48:28,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:28,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:28,077 INFO L87 Difference]: Start difference. First operand 13849 states and 15513 transitions. Second operand 3 states. [2019-11-19 21:48:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:29,197 INFO L93 Difference]: Finished difference Result 27993 states and 31368 transitions. [2019-11-19 21:48:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:29,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 625 [2019-11-19 21:48:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:29,217 INFO L225 Difference]: With dead ends: 27993 [2019-11-19 21:48:29,217 INFO L226 Difference]: Without dead ends: 14146 [2019-11-19 21:48:29,227 INFO L630 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-19 21:48:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14146 states. [2019-11-19 21:48:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14146 to 13847. [2019-11-19 21:48:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13847 states. [2019-11-19 21:48:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13847 states to 13847 states and 15509 transitions. [2019-11-19 21:48:29,363 INFO L78 Accepts]: Start accepts. Automaton has 13847 states and 15509 transitions. Word has length 625 [2019-11-19 21:48:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:29,364 INFO L462 AbstractCegarLoop]: Abstraction has 13847 states and 15509 transitions. [2019-11-19 21:48:29,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13847 states and 15509 transitions. [2019-11-19 21:48:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2019-11-19 21:48:29,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:29,373 INFO L410 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, 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, 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, 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] [2019-11-19 21:48:29,373 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -431846777, now seen corresponding path program 1 times [2019-11-19 21:48:29,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:29,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666738805] [2019-11-19 21:48:29,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-19 21:48:29,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666738805] [2019-11-19 21:48:29,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:29,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:48:29,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517720974] [2019-11-19 21:48:29,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:48:29,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:48:29,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:48:29,976 INFO L87 Difference]: Start difference. First operand 13847 states and 15509 transitions. Second operand 3 states. [2019-11-19 21:48:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:31,392 INFO L93 Difference]: Finished difference Result 30083 states and 33866 transitions. [2019-11-19 21:48:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:48:31,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 631 [2019-11-19 21:48:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:31,408 INFO L225 Difference]: With dead ends: 30083 [2019-11-19 21:48:31,409 INFO L226 Difference]: Without dead ends: 16238 [2019-11-19 21:48:31,418 INFO L630 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-19 21:48:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16238 states. [2019-11-19 21:48:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16238 to 15042. [2019-11-19 21:48:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15042 states. [2019-11-19 21:48:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15042 states to 15042 states and 16814 transitions. [2019-11-19 21:48:31,556 INFO L78 Accepts]: Start accepts. Automaton has 15042 states and 16814 transitions. Word has length 631 [2019-11-19 21:48:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:31,557 INFO L462 AbstractCegarLoop]: Abstraction has 15042 states and 16814 transitions. [2019-11-19 21:48:31,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:48:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 15042 states and 16814 transitions. [2019-11-19 21:48:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-11-19 21:48:31,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:31,578 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:48:31,578 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash 603125184, now seen corresponding path program 1 times [2019-11-19 21:48:31,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:48:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825288636] [2019-11-19 21:48:31,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:48:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 159 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:34,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825288636] [2019-11-19 21:48:34,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913703893] [2019-11-19 21:48:34,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:48:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:34,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:48:34,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:48:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 21:48:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:48:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:48:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:48:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:48:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 596 proven. 46 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-19 21:48:35,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:48:35,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 19 [2019-11-19 21:48:35,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622110841] [2019-11-19 21:48:35,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 21:48:35,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:48:35,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 21:48:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:48:35,740 INFO L87 Difference]: Start difference. First operand 15042 states and 16814 transitions. Second operand 19 states. [2019-11-19 21:49:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:49:06,094 INFO L93 Difference]: Finished difference Result 50182 states and 55271 transitions. [2019-11-19 21:49:06,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-19 21:49:06,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 780 [2019-11-19 21:49:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:49:06,129 INFO L225 Difference]: With dead ends: 50182 [2019-11-19 21:49:06,129 INFO L226 Difference]: Without dead ends: 35142 [2019-11-19 21:49:06,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 815 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=640, Invalid=3916, Unknown=0, NotChecked=0, Total=4556 [2019-11-19 21:49:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35142 states. [2019-11-19 21:49:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35142 to 20428. [2019-11-19 21:49:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20428 states. [2019-11-19 21:49:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20428 states to 20428 states and 22403 transitions. [2019-11-19 21:49:06,452 INFO L78 Accepts]: Start accepts. Automaton has 20428 states and 22403 transitions. Word has length 780 [2019-11-19 21:49:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:49:06,452 INFO L462 AbstractCegarLoop]: Abstraction has 20428 states and 22403 transitions. [2019-11-19 21:49:06,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 21:49:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20428 states and 22403 transitions. [2019-11-19 21:49:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-11-19 21:49:06,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:49:06,473 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:49:06,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:49:06,674 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:49:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:49:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1010886192, now seen corresponding path program 1 times [2019-11-19 21:49:06,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:49:06,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155019411] [2019-11-19 21:49:06,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:49:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:49:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-19 21:49:07,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155019411] [2019-11-19 21:49:07,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:49:07,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:49:07,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216972960] [2019-11-19 21:49:07,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:49:07,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:49:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:49:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:49:07,527 INFO L87 Difference]: Start difference. First operand 20428 states and 22403 transitions. Second operand 5 states. [2019-11-19 21:49:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:49:10,788 INFO L93 Difference]: Finished difference Result 50474 states and 55443 transitions. [2019-11-19 21:49:10,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:49:10,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 798 [2019-11-19 21:49:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:49:10,813 INFO L225 Difference]: With dead ends: 50474 [2019-11-19 21:49:10,813 INFO L226 Difference]: Without dead ends: 30048 [2019-11-19 21:49:10,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:49:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30048 states. [2019-11-19 21:49:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30048 to 24024. [2019-11-19 21:49:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24024 states. [2019-11-19 21:49:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24024 states to 24024 states and 26362 transitions. [2019-11-19 21:49:11,075 INFO L78 Accepts]: Start accepts. Automaton has 24024 states and 26362 transitions. Word has length 798 [2019-11-19 21:49:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:49:11,076 INFO L462 AbstractCegarLoop]: Abstraction has 24024 states and 26362 transitions. [2019-11-19 21:49:11,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:49:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 24024 states and 26362 transitions. [2019-11-19 21:49:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2019-11-19 21:49:11,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:49:11,106 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:49:11,107 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:49:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:49:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1543420195, now seen corresponding path program 1 times [2019-11-19 21:49:11,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:49:11,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575348230] [2019-11-19 21:49:11,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:49:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:49:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1433 proven. 561 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-19 21:49:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575348230] [2019-11-19 21:49:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041344989] [2019-11-19 21:49:12,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:49:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:49:12,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:49:12,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:49:12,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:49:13,416 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_896 Int)) (let ((.cse0 (mod (+ v_~a29~0_896 17705) 299928))) (and (<= .cse0 (+ c_~a29~0 300071)) (= .cse0 0)))) (exists ((v_~a29~0_896 Int)) (and (<= 0 (+ v_~a29~0_896 317633)) (<= (mod (+ v_~a29~0_896 17705) 299928) (+ c_~a29~0 300071)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod (+ v_prenex_2 17705) 299928))) (and (< (+ v_prenex_2 317633) 0) (<= .cse1 (+ c_~a29~0 599999)) (not (= .cse1 0)))))) is different from true [2019-11-19 21:49:13,995 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_896 Int)) (let ((.cse0 (mod (+ v_~a29~0_896 17705) 299928))) (and (<= .cse0 (+ c_~a29~0 300071)) (= .cse0 0)))) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 17705) 299928) (+ c_~a29~0 300071)) (<= 0 (+ v_prenex_3 317633)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod (+ v_prenex_2 17705) 299928))) (and (< (+ v_prenex_2 317633) 0) (<= .cse1 (+ c_~a29~0 599999)) (not (= .cse1 0)))))) is different from true [2019-11-19 21:49:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:49:14,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:49:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:49:14,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:49:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:49:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 949 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 46 not checked. [2019-11-19 21:49:17,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:49:17,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-19 21:49:17,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470584101] [2019-11-19 21:49:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:49:17,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:49:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:49:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=38, Unknown=2, NotChecked=26, Total=90 [2019-11-19 21:49:17,306 INFO L87 Difference]: Start difference. First operand 24024 states and 26362 transitions. Second operand 10 states. [2019-11-19 21:49:26,303 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-19 21:49:32,021 WARN L191 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2019-11-19 21:49:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:49:33,735 INFO L93 Difference]: Finished difference Result 55876 states and 60623 transitions. [2019-11-19 21:49:33,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 21:49:33,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1079 [2019-11-19 21:49:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:49:33,757 INFO L225 Difference]: With dead ends: 55876 [2019-11-19 21:49:33,758 INFO L226 Difference]: Without dead ends: 24080 [2019-11-19 21:49:33,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1085 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=101, Invalid=174, Unknown=5, NotChecked=62, Total=342 [2019-11-19 21:49:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24080 states. [2019-11-19 21:49:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24080 to 14584. [2019-11-19 21:49:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14584 states. [2019-11-19 21:49:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 15135 transitions. [2019-11-19 21:49:33,905 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 15135 transitions. Word has length 1079 [2019-11-19 21:49:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:49:33,906 INFO L462 AbstractCegarLoop]: Abstraction has 14584 states and 15135 transitions. [2019-11-19 21:49:33,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:49:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 15135 transitions. [2019-11-19 21:49:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2019-11-19 21:49:33,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:49:33,928 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 21:49:34,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:49:34,128 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:49:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:49:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -724490526, now seen corresponding path program 1 times [2019-11-19 21:49:34,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:49:34,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020768625] [2019-11-19 21:49:34,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:49:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:49:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 1656 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-11-19 21:49:35,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020768625] [2019-11-19 21:49:35,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:49:35,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:49:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295544690] [2019-11-19 21:49:35,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:49:35,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:49:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:49:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:49:35,340 INFO L87 Difference]: Start difference. First operand 14584 states and 15135 transitions. Second operand 3 states. [2019-11-19 21:49:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:49:36,173 INFO L93 Difference]: Finished difference Result 27176 states and 28188 transitions. [2019-11-19 21:49:36,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:49:36,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1320 [2019-11-19 21:49:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:49:36,175 INFO L225 Difference]: With dead ends: 27176 [2019-11-19 21:49:36,175 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:49:36,181 INFO L630 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-19 21:49:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:49:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:49:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:49:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:49:36,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1320 [2019-11-19 21:49:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:49:36,183 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:49:36,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:49:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:49:36,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:49:36,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:49:37,187 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 535 DAG size of output: 410 [2019-11-19 21:49:37,979 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 535 DAG size of output: 410 [2019-11-19 21:49:38,411 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 369 [2019-11-19 21:49:41,337 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 377 DAG size of output: 115 [2019-11-19 21:49:47,446 WARN L191 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 377 DAG size of output: 115 [2019-11-19 21:49:54,183 WARN L191 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 353 DAG size of output: 120 [2019-11-19 21:49:54,186 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,186 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,187 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,188 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 21:49:54,189 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 21:49:54,190 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:49:54,191 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,192 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,193 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,194 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,195 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,196 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 21:49:54,197 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,198 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,199 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:49:54,200 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-19 21:49:54,201 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 21:49:54,202 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-19 21:49:54,203 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,204 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,205 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,206 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,206 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,206 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse15 (+ ~a4~0 86))) (let ((.cse9 (= 1 ~a2~0)) (.cse8 (<= .cse15 0)) (.cse16 (<= (+ ~a29~0 16) 0)) (.cse24 (+ ~a29~0 144)) (.cse25 (+ ~a0~0 147))) (let ((.cse3 (< 43 ~a29~0)) (.cse12 (<= .cse25 0)) (.cse6 (<= 0 (+ ~a29~0 142))) (.cse10 (< 0 .cse25)) (.cse2 (= 2 ~a2~0)) (.cse20 (+ ~a0~0 61)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse5 (not (= 4 ~a2~0))) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse17 (<= .cse24 0)) (.cse21 (and .cse8 .cse16)) (.cse13 (<= (+ ~a29~0 38436) 0)) (.cse14 (not .cse9)) (.cse11 (<= 0 (+ ~a29~0 599989))) (.cse4 (<= ~a29~0 43)) (.cse23 (<= 0 (+ ~a0~0 44))) (.cse22 (< 0 .cse24)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse19 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse11) (and .cse12 (and .cse2 .cse3)) (and .cse1 .cse9 .cse4 .cse6) (and .cse1 .cse7 .cse13 .cse14 .cse11 .cse5) (and .cse7 (and .cse1 (< 0 .cse15) .cse3)) (and .cse1 .cse12 .cse16 .cse6) (and .cse1 .cse12 .cse14 .cse17 .cse11) (and (and .cse10 .cse8) .cse6) (and .cse8 (exists ((v_prenex_2 Int) (v_~a29~0_897 Int)) (let ((.cse18 (mod (+ v_prenex_2 17705) 299928))) (and (<= .cse18 (+ v_~a29~0_897 599999)) (< (+ v_prenex_2 317633) 0) (<= (+ (div v_~a29~0_897 5) 340362) ~a29~0) (= 0 (mod v_~a29~0_897 5)) (not (= .cse18 0)))))) (and (and .cse1 .cse19 (or .cse10 (not (= 4 ULTIMATE.start_calculate_output_~input)))) .cse7) (and (and .cse8 .cse2) (not (= 3 ULTIMATE.start_calculate_output_~input)) (< 0 .cse20)) (and .cse21 .cse17 (<= .cse20 0)) (and .cse0 .cse1 (<= 220364 ~a29~0) .cse5) (and (= ~a2~0 1) .cse22 .cse8) (and .cse7 (and .cse1 .cse17 .cse19)) (and .cse21 .cse13 .cse23 .cse14 .cse11) (and (or (and .cse4 .cse23 .cse22) .cse8) .cse1 .cse19))))) [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,207 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,208 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,208 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,208 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 21:49:54,208 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,208 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 21:49:54,208 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-19 21:49:54,208 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,209 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-19 21:49:54,210 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,211 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,211 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,211 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,211 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,211 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,212 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse16 (+ ~a4~0 86))) (let ((.cse8 (<= .cse16 0)) (.cse13 (<= (+ ~a29~0 16) 0)) (.cse23 (+ ~a29~0 144)) (.cse9 (= 1 ~a2~0)) (.cse24 (+ ~a0~0 147))) (let ((.cse3 (< 43 ~a29~0)) (.cse12 (<= .cse24 0)) (.cse15 (not .cse9)) (.cse10 (< 0 .cse24)) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse2 (= 2 ~a2~0)) (.cse17 (<= .cse23 0)) (.cse21 (+ ~a0~0 61)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse5 (not (= 4 ~a2~0))) (.cse6 (<= 0 (+ ~a29~0 142))) (.cse19 (and .cse8 .cse13)) (.cse14 (<= (+ ~a29~0 38436) 0)) (.cse11 (<= 0 (+ ~a29~0 599989))) (.cse4 (<= ~a29~0 43)) (.cse22 (<= 0 (+ ~a0~0 44))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse20 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse6) (and .cse1 .cse7 .cse14 .cse15 .cse11 .cse5) (and .cse12 (and .cse2 .cse3)) (and .cse7 (and .cse1 (< 0 .cse16) .cse3)) (and .cse1 .cse12 .cse15 .cse17 .cse11) (and (and .cse10 .cse8) .cse6) (and .cse8 (exists ((v_prenex_2 Int) (v_~a29~0_897 Int)) (let ((.cse18 (mod (+ v_prenex_2 17705) 299928))) (and (<= .cse18 (+ v_~a29~0_897 599999)) (< (+ v_prenex_2 317633) 0) (<= (+ (div v_~a29~0_897 5) 340362) ~a29~0) (= 0 (mod v_~a29~0_897 5)) (not (= .cse18 0)))))) (and (= ~a2~0 1) .cse19) (and (and .cse1 .cse20) .cse7) (and (and .cse8 .cse2) (not (= 3 ULTIMATE.start_calculate_output_~input)) (< 0 .cse21)) (and .cse19 .cse17 (<= .cse21 0)) (and .cse0 .cse1 (<= 220364 ~a29~0) .cse5) (and .cse1 .cse9 .cse4 .cse6) (and .cse19 .cse14 .cse22 .cse11) (and (or (and .cse4 .cse22 (< 0 .cse23)) .cse8) .cse1 .cse20))))) [2019-11-19 21:49:54,212 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,212 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 21:49:54,212 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 21:49:54,212 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 21:49:54,213 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,214 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,215 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,216 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 21:49:54,217 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,218 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,219 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,220 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,221 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,221 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,221 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,221 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse16 (+ ~a4~0 86))) (let ((.cse8 (<= .cse16 0)) (.cse13 (<= (+ ~a29~0 16) 0)) (.cse23 (+ ~a29~0 144)) (.cse9 (= 1 ~a2~0)) (.cse24 (+ ~a0~0 147))) (let ((.cse3 (< 43 ~a29~0)) (.cse12 (<= .cse24 0)) (.cse15 (not .cse9)) (.cse10 (< 0 .cse24)) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse2 (= 2 ~a2~0)) (.cse17 (<= .cse23 0)) (.cse21 (+ ~a0~0 61)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse5 (not (= 4 ~a2~0))) (.cse6 (<= 0 (+ ~a29~0 142))) (.cse19 (and .cse8 .cse13)) (.cse14 (<= (+ ~a29~0 38436) 0)) (.cse11 (<= 0 (+ ~a29~0 599989))) (.cse4 (<= ~a29~0 43)) (.cse22 (<= 0 (+ ~a0~0 44))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse20 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse6) (and .cse1 .cse7 .cse14 .cse15 .cse11 .cse5) (and .cse12 (and .cse2 .cse3)) (and .cse7 (and .cse1 (< 0 .cse16) .cse3)) (and .cse1 .cse12 .cse15 .cse17 .cse11) (and (and .cse10 .cse8) .cse6) (and .cse8 (exists ((v_prenex_2 Int) (v_~a29~0_897 Int)) (let ((.cse18 (mod (+ v_prenex_2 17705) 299928))) (and (<= .cse18 (+ v_~a29~0_897 599999)) (< (+ v_prenex_2 317633) 0) (<= (+ (div v_~a29~0_897 5) 340362) ~a29~0) (= 0 (mod v_~a29~0_897 5)) (not (= .cse18 0)))))) (and (= ~a2~0 1) .cse19) (and (and .cse1 .cse20) .cse7) (and (and .cse8 .cse2) (not (= 3 ULTIMATE.start_calculate_output_~input)) (< 0 .cse21)) (and .cse19 .cse17 (<= .cse21 0)) (and .cse0 .cse1 (<= 220364 ~a29~0) .cse5) (and .cse1 .cse9 .cse4 .cse6) (and .cse19 .cse14 .cse22 .cse11) (and (or (and .cse4 .cse22 (< 0 .cse23)) .cse8) .cse1 .cse20))))) [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,222 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 21:49:54,223 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 21:49:54,224 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 21:49:54,225 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,226 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,227 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,228 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,229 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,230 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,231 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,232 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-19 21:49:54,233 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,234 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 21:49:54,235 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 21:49:54,235 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-19 21:49:54,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:49:54 BoogieIcfgContainer [2019-11-19 21:49:54,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:49:54,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:49:54,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:49:54,283 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:49:54,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:47" (3/4) ... [2019-11-19 21:49:54,286 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:49:54,317 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 21:49:54,320 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:49:54,348 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) [2019-11-19 21:49:54,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) [2019-11-19 21:49:54,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (((a4 + 42 <= 0 && 3 == a2) && (0 < a0 + 147 || !(4 == input))) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || ((a2 == 1 && 0 < a29 + 144) && a4 + 86 <= 0)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && a29 + 144 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && !(1 == a2)) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) [2019-11-19 21:49:54,599 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_87f4ebc4-0ef2-4c09-a734-ea0bfe88dd14/bin/uautomizer/witness.graphml [2019-11-19 21:49:54,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:49:54,600 INFO L168 Benchmark]: Toolchain (without parser) took 132189.70 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 946.1 MB in the beginning and 1.9 GB in the end (delta: -962.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,601 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:49:54,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1172.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -114.0 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.22 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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,602 INFO L168 Benchmark]: Boogie Preprocessor took 193.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 999.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,602 INFO L168 Benchmark]: RCFGBuilder took 3260.63 ms. Allocated memory is still 1.2 GB. Free memory was 999.9 MB in the beginning and 923.7 MB in the end (delta: 76.1 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,603 INFO L168 Benchmark]: TraceAbstraction took 127047.39 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 923.7 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,603 INFO L168 Benchmark]: Witness Printer took 317.16 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 86.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:49:54,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1172.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -114.0 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 194.22 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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 193.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 999.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3260.63 ms. Allocated memory is still 1.2 GB. Free memory was 999.9 MB in the beginning and 923.7 MB in the end (delta: 76.1 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 127047.39 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 923.7 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 317.16 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 86.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-11-19 21:49:54,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 21:49:54,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-19 21:49:54,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-19 21:49:54,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-19 21:49:54,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (((a4 + 42 <= 0 && 3 == a2) && (0 < a0 + 147 || !(4 == input))) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || ((a2 == 1 && 0 < a29 + 144) && a4 + 86 <= 0)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && a29 + 144 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && !(1 == a2)) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 126.9s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 86.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.0s, HoareTripleCheckerStatistics: 3410 SDtfs, 22760 SDslu, 2148 SDs, 0 SdLazy, 82402 SolverSat, 5935 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 64.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3276 GetRequests, 3136 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24024occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 40470 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 232 NumberOfFragments, 1261 HoareAnnotationTreeSize, 4 FomulaSimplifications, 219851 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 105248 FormulaSimplificationTreeSizeReductionInter, 15.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 11318 NumberOfCodeBlocks, 11318 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 11298 ConstructedInterpolants, 283 QuantifiedInterpolants, 38540277 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3642 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 13039/14618 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...