./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label56.c -s /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/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 66046df24ee9a8dc92e970aeeb93586ff76ce37f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:40,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:40,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:40,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:40,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:40,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:40,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:40,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:40,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:40,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:40,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:40,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:40,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:40,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:40,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:40,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:40,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:40,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:40,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:40,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:40,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:40,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:40,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:40,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:40,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:40,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:40,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:40,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:40,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:40,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:40,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:40,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:40,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:40,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:40,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:40,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:40,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:40,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:40,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:40,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:40,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:40,684 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:03:40,710 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:40,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:40,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:40,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:40,712 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:40,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:40,713 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:03:40,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:40,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:03:40,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:40,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:03:40,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:03:40,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:03:40,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:03:40,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:03:40,715 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:40,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:03:40,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:40,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:40,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:03:40,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:03:40,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:03:40,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:40,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:03:40,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:03:40,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:40,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:03:40,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:03:40,718 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_30bf6070-4897-41bc-8beb-38878c4315fa/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 -> 66046df24ee9a8dc92e970aeeb93586ff76ce37f [2019-11-16 00:03:40,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:40,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:40,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:40,777 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:40,777 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:40,778 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label56.c [2019-11-16 00:03:40,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/data/657ad0aa6/310b1585fca9400893e011bc7f0e9d04/FLAG7136fb3c9 [2019-11-16 00:03:41,426 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:41,428 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/sv-benchmarks/c/eca-rers2012/Problem15_label56.c [2019-11-16 00:03:41,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/data/657ad0aa6/310b1585fca9400893e011bc7f0e9d04/FLAG7136fb3c9 [2019-11-16 00:03:41,798 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/data/657ad0aa6/310b1585fca9400893e011bc7f0e9d04 [2019-11-16 00:03:41,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:41,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:03:41,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:41,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:41,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:41,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:41" (1/1) ... [2019-11-16 00:03:41,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572e2db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:41, skipping insertion in model container [2019-11-16 00:03:41,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:41" (1/1) ... [2019-11-16 00:03:41,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:41,880 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:42,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:42,756 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:43,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:43,445 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:43,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43 WrapperNode [2019-11-16 00:03:43,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:43,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:43,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:03:43,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:03:43,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:43,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:43,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:43,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:43,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... [2019-11-16 00:03:43,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:43,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:43,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:43,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:43,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/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-16 00:03:43,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:43,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:46,405 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:46,405 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:03:46,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:46 BoogieIcfgContainer [2019-11-16 00:03:46,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:46,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:03:46,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:03:46,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:03:46,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:03:41" (1/3) ... [2019-11-16 00:03:46,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287956d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:46, skipping insertion in model container [2019-11-16 00:03:46,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:43" (2/3) ... [2019-11-16 00:03:46,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287956d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:46, skipping insertion in model container [2019-11-16 00:03:46,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:46" (3/3) ... [2019-11-16 00:03:46,419 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label56.c [2019-11-16 00:03:46,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:03:46,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:03:46,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:03:46,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:03:46,486 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:03:46,486 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:03:46,486 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:46,486 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:46,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:03:46,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:46,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:03:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-16 00:03:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:03:46,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:46,524 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:46,525 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2113343065, now seen corresponding path program 1 times [2019-11-16 00:03:46,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:46,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911314261] [2019-11-16 00:03:46,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:46,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:46,729 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-16 00:03:46,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911314261] [2019-11-16 00:03:46,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:46,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:46,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389502732] [2019-11-16 00:03:46,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:46,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:46,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:46,747 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-16 00:03:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:51,378 INFO L93 Difference]: Finished difference Result 1467 states and 2715 transitions. [2019-11-16 00:03:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:51,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-16 00:03:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:51,413 INFO L225 Difference]: With dead ends: 1467 [2019-11-16 00:03:51,414 INFO L226 Difference]: Without dead ends: 976 [2019-11-16 00:03:51,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-16 00:03:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-11-16 00:03:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-16 00:03:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1477 transitions. [2019-11-16 00:03:51,525 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1477 transitions. Word has length 33 [2019-11-16 00:03:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:51,525 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1477 transitions. [2019-11-16 00:03:51,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1477 transitions. [2019-11-16 00:03:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:03:51,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:51,530 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:03:51,530 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1201639937, now seen corresponding path program 1 times [2019-11-16 00:03:51,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:51,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867661690] [2019-11-16 00:03:51,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:51,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:51,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867661690] [2019-11-16 00:03:51,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:51,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:51,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586213120] [2019-11-16 00:03:51,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:51,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:51,780 INFO L87 Difference]: Start difference. First operand 974 states and 1477 transitions. Second operand 4 states. [2019-11-16 00:03:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:54,705 INFO L93 Difference]: Finished difference Result 3747 states and 5705 transitions. [2019-11-16 00:03:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:54,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-16 00:03:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:54,721 INFO L225 Difference]: With dead ends: 3747 [2019-11-16 00:03:54,722 INFO L226 Difference]: Without dead ends: 2775 [2019-11-16 00:03:54,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-11-16 00:03:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-11-16 00:03:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-11-16 00:03:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2484 transitions. [2019-11-16 00:03:54,782 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2484 transitions. Word has length 108 [2019-11-16 00:03:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:54,783 INFO L462 AbstractCegarLoop]: Abstraction has 1872 states and 2484 transitions. [2019-11-16 00:03:54,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2484 transitions. [2019-11-16 00:03:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-16 00:03:54,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:54,803 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:03:54,803 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1351380268, now seen corresponding path program 1 times [2019-11-16 00:03:54,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:54,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022476274] [2019-11-16 00:03:54,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:54,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:54,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-16 00:03:55,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022476274] [2019-11-16 00:03:55,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:55,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:55,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352645583] [2019-11-16 00:03:55,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:55,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:55,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:55,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:55,591 INFO L87 Difference]: Start difference. First operand 1872 states and 2484 transitions. Second operand 5 states. [2019-11-16 00:03:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,615 INFO L93 Difference]: Finished difference Result 4641 states and 5945 transitions. [2019-11-16 00:03:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:59,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 380 [2019-11-16 00:03:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:59,636 INFO L225 Difference]: With dead ends: 4641 [2019-11-16 00:03:59,636 INFO L226 Difference]: Without dead ends: 2771 [2019-11-16 00:03:59,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-11-16 00:03:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2471. [2019-11-16 00:03:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-11-16 00:03:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3125 transitions. [2019-11-16 00:03:59,697 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3125 transitions. Word has length 380 [2019-11-16 00:03:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:59,699 INFO L462 AbstractCegarLoop]: Abstraction has 2471 states and 3125 transitions. [2019-11-16 00:03:59,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3125 transitions. [2019-11-16 00:03:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-11-16 00:03:59,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:59,708 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:03:59,708 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash -806541762, now seen corresponding path program 1 times [2019-11-16 00:03:59,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482448579] [2019-11-16 00:03:59,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:04:00,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482448579] [2019-11-16 00:04:00,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:00,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:00,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900398426] [2019-11-16 00:04:00,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:00,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:00,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:00,136 INFO L87 Difference]: Start difference. First operand 2471 states and 3125 transitions. Second operand 4 states. [2019-11-16 00:04:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:03,997 INFO L93 Difference]: Finished difference Result 5542 states and 7080 transitions. [2019-11-16 00:04:03,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:03,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 454 [2019-11-16 00:04:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:04,013 INFO L225 Difference]: With dead ends: 5542 [2019-11-16 00:04:04,013 INFO L226 Difference]: Without dead ends: 3073 [2019-11-16 00:04:04,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2019-11-16 00:04:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3071. [2019-11-16 00:04:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-11-16 00:04:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3699 transitions. [2019-11-16 00:04:04,076 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3699 transitions. Word has length 454 [2019-11-16 00:04:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:04,077 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 3699 transitions. [2019-11-16 00:04:04,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3699 transitions. [2019-11-16 00:04:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-11-16 00:04:04,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:04,086 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:04:04,087 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1138002799, now seen corresponding path program 1 times [2019-11-16 00:04:04,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:04,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584195110] [2019-11-16 00:04:04,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:04,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:04,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-16 00:04:04,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584195110] [2019-11-16 00:04:04,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:04,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:04,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338874116] [2019-11-16 00:04:04,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:04,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:04,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:04,630 INFO L87 Difference]: Start difference. First operand 3071 states and 3699 transitions. Second operand 4 states. [2019-11-16 00:04:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:07,619 INFO L93 Difference]: Finished difference Result 6745 states and 8190 transitions. [2019-11-16 00:04:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:07,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2019-11-16 00:04:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:07,638 INFO L225 Difference]: With dead ends: 6745 [2019-11-16 00:04:07,638 INFO L226 Difference]: Without dead ends: 3676 [2019-11-16 00:04:07,642 INFO L600 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-16 00:04:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2019-11-16 00:04:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3672. [2019-11-16 00:04:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3672 states. [2019-11-16 00:04:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4289 transitions. [2019-11-16 00:04:07,710 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4289 transitions. Word has length 463 [2019-11-16 00:04:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:07,711 INFO L462 AbstractCegarLoop]: Abstraction has 3672 states and 4289 transitions. [2019-11-16 00:04:07,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4289 transitions. [2019-11-16 00:04:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-11-16 00:04:07,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:07,723 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:04:07,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1377533685, now seen corresponding path program 1 times [2019-11-16 00:04:07,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:07,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046766966] [2019-11-16 00:04:07,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:07,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:07,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:04:08,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046766966] [2019-11-16 00:04:08,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:08,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:08,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160978794] [2019-11-16 00:04:08,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:08,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:08,347 INFO L87 Difference]: Start difference. First operand 3672 states and 4289 transitions. Second operand 3 states. [2019-11-16 00:04:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:10,514 INFO L93 Difference]: Finished difference Result 9136 states and 10587 transitions. [2019-11-16 00:04:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:10,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2019-11-16 00:04:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:10,542 INFO L225 Difference]: With dead ends: 9136 [2019-11-16 00:04:10,542 INFO L226 Difference]: Without dead ends: 5466 [2019-11-16 00:04:10,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-11-16 00:04:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 3971. [2019-11-16 00:04:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-16 00:04:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4630 transitions. [2019-11-16 00:04:10,645 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4630 transitions. Word has length 484 [2019-11-16 00:04:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:10,646 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4630 transitions. [2019-11-16 00:04:10,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4630 transitions. [2019-11-16 00:04:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-11-16 00:04:10,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:10,652 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-16 00:04:10,653 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash 955983823, now seen corresponding path program 1 times [2019-11-16 00:04:10,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:10,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621702631] [2019-11-16 00:04:10,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:10,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-11-16 00:04:11,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621702631] [2019-11-16 00:04:11,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:11,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:11,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922323181] [2019-11-16 00:04:11,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:11,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:11,105 INFO L87 Difference]: Start difference. First operand 3971 states and 4630 transitions. Second operand 4 states. [2019-11-16 00:04:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:16,019 INFO L93 Difference]: Finished difference Result 13287 states and 15292 transitions. [2019-11-16 00:04:16,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:16,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 486 [2019-11-16 00:04:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:16,042 INFO L225 Difference]: With dead ends: 13287 [2019-11-16 00:04:16,042 INFO L226 Difference]: Without dead ends: 5730 [2019-11-16 00:04:16,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2019-11-16 00:04:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5730. [2019-11-16 00:04:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5730 states. [2019-11-16 00:04:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 6014 transitions. [2019-11-16 00:04:16,150 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 6014 transitions. Word has length 486 [2019-11-16 00:04:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:16,150 INFO L462 AbstractCegarLoop]: Abstraction has 5730 states and 6014 transitions. [2019-11-16 00:04:16,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 6014 transitions. [2019-11-16 00:04:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2019-11-16 00:04:16,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:16,166 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:04:16,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -546298920, now seen corresponding path program 1 times [2019-11-16 00:04:16,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:16,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840634586] [2019-11-16 00:04:16,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:16,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:16,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 966 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-16 00:04:17,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840634586] [2019-11-16 00:04:17,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:17,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:17,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927762042] [2019-11-16 00:04:17,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:17,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:17,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:17,059 INFO L87 Difference]: Start difference. First operand 5730 states and 6014 transitions. Second operand 3 states. [2019-11-16 00:04:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:18,309 INFO L93 Difference]: Finished difference Result 14449 states and 15177 transitions. [2019-11-16 00:04:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:18,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 805 [2019-11-16 00:04:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:18,346 INFO L225 Difference]: With dead ends: 14449 [2019-11-16 00:04:18,346 INFO L226 Difference]: Without dead ends: 8721 [2019-11-16 00:04:18,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2019-11-16 00:04:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7226. [2019-11-16 00:04:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7226 states. [2019-11-16 00:04:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 7572 transitions. [2019-11-16 00:04:18,459 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 7572 transitions. Word has length 805 [2019-11-16 00:04:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:18,460 INFO L462 AbstractCegarLoop]: Abstraction has 7226 states and 7572 transitions. [2019-11-16 00:04:18,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 7572 transitions. [2019-11-16 00:04:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2019-11-16 00:04:18,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:18,476 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:04:18,476 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1462646468, now seen corresponding path program 1 times [2019-11-16 00:04:18,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:18,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738897583] [2019-11-16 00:04:18,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:18,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:18,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-16 00:04:19,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738897583] [2019-11-16 00:04:19,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:19,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:19,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920368621] [2019-11-16 00:04:19,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:19,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:19,258 INFO L87 Difference]: Start difference. First operand 7226 states and 7572 transitions. Second operand 3 states. [2019-11-16 00:04:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:20,199 INFO L93 Difference]: Finished difference Result 15346 states and 16079 transitions. [2019-11-16 00:04:20,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:20,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 818 [2019-11-16 00:04:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:20,219 INFO L225 Difference]: With dead ends: 15346 [2019-11-16 00:04:20,219 INFO L226 Difference]: Without dead ends: 8122 [2019-11-16 00:04:20,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2019-11-16 00:04:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 7225. [2019-11-16 00:04:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2019-11-16 00:04:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 7570 transitions. [2019-11-16 00:04:20,317 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 7570 transitions. Word has length 818 [2019-11-16 00:04:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:20,319 INFO L462 AbstractCegarLoop]: Abstraction has 7225 states and 7570 transitions. [2019-11-16 00:04:20,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 7570 transitions. [2019-11-16 00:04:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2019-11-16 00:04:20,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:20,336 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:20,336 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 154899430, now seen corresponding path program 1 times [2019-11-16 00:04:20,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:20,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599784198] [2019-11-16 00:04:20,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:20,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:20,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 520 proven. 392 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:04:23,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599784198] [2019-11-16 00:04:23,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348605064] [2019-11-16 00:04:23,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/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-16 00:04:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:23,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:04:23,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:23,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-16 00:04:24,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:24,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-16 00:04:24,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172583791] [2019-11-16 00:04:24,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:24,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:24,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:04:24,035 INFO L87 Difference]: Start difference. First operand 7225 states and 7570 transitions. Second operand 3 states. [2019-11-16 00:04:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:26,328 INFO L93 Difference]: Finished difference Result 19545 states and 20509 transitions. [2019-11-16 00:04:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:26,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 839 [2019-11-16 00:04:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:26,347 INFO L225 Difference]: With dead ends: 19545 [2019-11-16 00:04:26,348 INFO L226 Difference]: Without dead ends: 12322 [2019-11-16 00:04:26,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 838 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:04:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-11-16 00:04:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11420. [2019-11-16 00:04:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11420 states. [2019-11-16 00:04:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11420 states to 11420 states and 11964 transitions. [2019-11-16 00:04:26,536 INFO L78 Accepts]: Start accepts. Automaton has 11420 states and 11964 transitions. Word has length 839 [2019-11-16 00:04:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:26,538 INFO L462 AbstractCegarLoop]: Abstraction has 11420 states and 11964 transitions. [2019-11-16 00:04:26,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11420 states and 11964 transitions. [2019-11-16 00:04:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-11-16 00:04:26,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:26,564 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:26,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:26,768 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash -415241253, now seen corresponding path program 1 times [2019-11-16 00:04:26,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:26,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319272601] [2019-11-16 00:04:26,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:26,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:26,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 242 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:29,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319272601] [2019-11-16 00:04:29,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032363634] [2019-11-16 00:04:29,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/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-16 00:04:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:30,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:04:30,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:30,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:32,910 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 228 DAG size of output: 26 [2019-11-16 00:04:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2019-11-16 00:04:33,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:33,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-11-16 00:04:33,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756881589] [2019-11-16 00:04:33,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:33,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:04:33,464 INFO L87 Difference]: Start difference. First operand 11420 states and 11964 transitions. Second operand 3 states. [2019-11-16 00:04:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:47,507 INFO L93 Difference]: Finished difference Result 28833 states and 30193 transitions. [2019-11-16 00:04:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:47,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 876 [2019-11-16 00:04:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:47,510 INFO L225 Difference]: With dead ends: 28833 [2019-11-16 00:04:47,510 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:04:47,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 875 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:04:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:04:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:04:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:04:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:04:47,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 876 [2019-11-16 00:04:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:47,531 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:04:47,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:04:47,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:04:47,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:47,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:04:47,891 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 141 [2019-11-16 00:04:48,004 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 141 [2019-11-16 00:04:48,116 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 141 [2019-11-16 00:04:49,057 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2019-11-16 00:04:49,970 WARN L191 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2019-11-16 00:04:50,821 WARN L191 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 76 [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,824 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,825 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,826 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,827 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,828 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,829 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,830 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,831 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,832 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,835 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,835 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,835 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,836 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,837 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,838 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,839 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,840 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:04:50,841 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:04:50,842 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,843 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,844 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,844 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:04:50,845 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:04:50,846 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,847 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:04:50,848 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:04:50,849 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,849 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,849 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,849 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,849 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse0 (= 4 ~a2~0))) (let ((.cse3 (<= (+ ~a0~0 98) 0)) (.cse1 (< 0 (+ ~a0~0 61))) (.cse4 (not (= 1 ~a2~0))) (.cse5 (not .cse0)) (.cse2 (<= (+ ~a4~0 86) 0))) (or (and (<= (+ ~a0~0 32950) 0) .cse0) (and .cse1 .cse2) (and (= ~a2~0 1) (<= ~a29~0 43) (< 0 (+ ~a29~0 144))) (and .cse3 .cse4 .cse5) (and .cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ (mod v_~a29~0_893 29) 8) ~a29~0) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (and .cse3 (< 0 (+ ~a0~0 147))) (let ((.cse6 (not (= 5 ~a2~0)))) (or (and .cse6 .cse1 .cse4 .cse5) (and .cse2 .cse6))) (and .cse2 (exists ((v_~a29~0_894 Int)) (let ((.cse8 (div (* v_~a29~0_894 9) 10))) (let ((.cse7 (div .cse8 5))) (and (<= 0 .cse7) (<= 0 (+ .cse7 1)) (<= 0 (* 9 v_~a29~0_894)) (= (mod .cse8 5) 0) (< 43 v_~a29~0_894) (<= (mod .cse7 29) (+ ~a29~0 13)))))))))) [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,850 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:04:50,851 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,852 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,853 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:04:50,853 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:04:50,853 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,854 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:04:50,854 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:04:50,854 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,854 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,855 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,855 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,855 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,856 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,856 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse0 (= 4 ~a2~0))) (let ((.cse3 (<= (+ ~a0~0 98) 0)) (.cse1 (< 0 (+ ~a0~0 61))) (.cse4 (not (= 1 ~a2~0))) (.cse5 (not .cse0)) (.cse2 (<= (+ ~a4~0 86) 0))) (or (and (<= (+ ~a0~0 32950) 0) .cse0) (and .cse1 .cse2) (and (= ~a2~0 1) (<= ~a29~0 43) (< 0 (+ ~a29~0 144))) (and .cse3 .cse4 .cse5) (and .cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ (mod v_~a29~0_893 29) 8) ~a29~0) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (and .cse3 (< 0 (+ ~a0~0 147))) (let ((.cse6 (not (= 5 ~a2~0)))) (or (and .cse6 .cse1 .cse4 .cse5) (and .cse2 .cse6))) (and .cse2 (exists ((v_~a29~0_894 Int)) (let ((.cse8 (div (* v_~a29~0_894 9) 10))) (let ((.cse7 (div .cse8 5))) (and (<= 0 .cse7) (<= 0 (+ .cse7 1)) (<= 0 (* 9 v_~a29~0_894)) (= (mod .cse8 5) 0) (< 43 v_~a29~0_894) (<= (mod .cse7 29) (+ ~a29~0 13)))))))))) [2019-11-16 00:04:50,856 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,858 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:04:50,858 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:04:50,858 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,858 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,859 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,860 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:04:50,860 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,860 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,860 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,860 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,862 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,862 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,862 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:04:50,862 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:04:50,862 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,862 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,863 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,864 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,865 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,866 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,867 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,868 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,868 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,868 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,868 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,868 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse0 (= 4 ~a2~0))) (let ((.cse3 (<= (+ ~a0~0 98) 0)) (.cse1 (< 0 (+ ~a0~0 61))) (.cse4 (not (= 1 ~a2~0))) (.cse5 (not .cse0)) (.cse2 (<= (+ ~a4~0 86) 0))) (or (and (<= (+ ~a0~0 32950) 0) .cse0) (and .cse1 .cse2) (and (= ~a2~0 1) (<= ~a29~0 43) (< 0 (+ ~a29~0 144))) (and .cse3 .cse4 .cse5) (and .cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ (mod v_~a29~0_893 29) 8) ~a29~0) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (and .cse3 (< 0 (+ ~a0~0 147))) (let ((.cse6 (not (= 5 ~a2~0)))) (or (and .cse6 .cse1 .cse4 .cse5) (and .cse2 .cse6))) (and .cse2 (exists ((v_~a29~0_894 Int)) (let ((.cse8 (div (* v_~a29~0_894 9) 10))) (let ((.cse7 (div .cse8 5))) (and (<= 0 .cse7) (<= 0 (+ .cse7 1)) (<= 0 (* 9 v_~a29~0_894)) (= (mod .cse8 5) 0) (< 43 v_~a29~0_894) (<= (mod .cse7 29) (+ ~a29~0 13)))))))))) [2019-11-16 00:04:50,868 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,869 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,870 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,871 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:04:50,872 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,873 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,873 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,873 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,874 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,875 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,876 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,877 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,878 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:04:50,879 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,880 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:04:50,881 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 106) no Hoare annotation was computed. [2019-11-16 00:04:50,881 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,881 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:04:50,881 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:04:50,881 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,882 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,882 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:04:50,882 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:04:50,882 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:04:50,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:50,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:50,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:04:50 BoogieIcfgContainer [2019-11-16 00:04:50,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:04:50,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:04:50,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:04:50,945 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:04:50,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:46" (3/4) ... [2019-11-16 00:04:50,949 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:04:50,989 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:04:50,992 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:04:51,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((a0 + 32950 <= 0 && 4 == a2) || (0 < a0 + 61 && a4 + 86 <= 0)) || ((a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && !(1 == a2)) && !(4 == a2))) || (a0 + 98 <= 0 && (\exists v_~a29~0_893 : int :: (v_~a29~0_893 % 29 + 8 <= a29 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893))) || (a0 + 98 <= 0 && 0 < a0 + 147)) || (((!(5 == a2) && 0 < a0 + 61) && !(1 == a2)) && !(4 == a2)) || (a4 + 86 <= 0 && !(5 == a2))) || (a4 + 86 <= 0 && (\exists v_~a29~0_894 : int :: ((((0 <= v_~a29~0_894 * 9 / 10 / 5 && 0 <= v_~a29~0_894 * 9 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_894) && v_~a29~0_894 * 9 / 10 % 5 == 0) && 43 < v_~a29~0_894) && v_~a29~0_894 * 9 / 10 / 5 % 29 <= a29 + 13)) [2019-11-16 00:04:51,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((a0 + 32950 <= 0 && 4 == a2) || (0 < a0 + 61 && a4 + 86 <= 0)) || ((a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && !(1 == a2)) && !(4 == a2))) || (a0 + 98 <= 0 && (\exists v_~a29~0_893 : int :: (v_~a29~0_893 % 29 + 8 <= a29 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893))) || (a0 + 98 <= 0 && 0 < a0 + 147)) || (((!(5 == a2) && 0 < a0 + 61) && !(1 == a2)) && !(4 == a2)) || (a4 + 86 <= 0 && !(5 == a2))) || (a4 + 86 <= 0 && (\exists v_~a29~0_894 : int :: ((((0 <= v_~a29~0_894 * 9 / 10 / 5 && 0 <= v_~a29~0_894 * 9 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_894) && v_~a29~0_894 * 9 / 10 % 5 == 0) && 43 < v_~a29~0_894) && v_~a29~0_894 * 9 / 10 / 5 % 29 <= a29 + 13)) [2019-11-16 00:04:51,063 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((a0 + 32950 <= 0 && 4 == a2) || (0 < a0 + 61 && a4 + 86 <= 0)) || ((a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && !(1 == a2)) && !(4 == a2))) || (a0 + 98 <= 0 && (\exists v_~a29~0_893 : int :: (v_~a29~0_893 % 29 + 8 <= a29 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893))) || (a0 + 98 <= 0 && 0 < a0 + 147)) || (((!(5 == a2) && 0 < a0 + 61) && !(1 == a2)) && !(4 == a2)) || (a4 + 86 <= 0 && !(5 == a2))) || (a4 + 86 <= 0 && (\exists v_~a29~0_894 : int :: ((((0 <= v_~a29~0_894 * 9 / 10 / 5 && 0 <= v_~a29~0_894 * 9 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_894) && v_~a29~0_894 * 9 / 10 % 5 == 0) && 43 < v_~a29~0_894) && v_~a29~0_894 * 9 / 10 / 5 % 29 <= a29 + 13)) [2019-11-16 00:04:51,365 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_30bf6070-4897-41bc-8beb-38878c4315fa/bin/uautomizer/witness.graphml [2019-11-16 00:04:51,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:04:51,367 INFO L168 Benchmark]: Toolchain (without parser) took 69565.48 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 939.4 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 790.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,367 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:04:51,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1644.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,368 INFO L168 Benchmark]: Boogie Preprocessor took 157.84 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: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,369 INFO L168 Benchmark]: RCFGBuilder took 2644.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 968.7 MB in the end (delta: 75.2 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,369 INFO L168 Benchmark]: TraceAbstraction took 64537.29 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 968.7 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 540.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,370 INFO L168 Benchmark]: Witness Printer took 420.15 ms. Allocated memory is still 3.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:51,372 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1644.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.84 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: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2644.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 968.7 MB in the end (delta: 75.2 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64537.29 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 968.7 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 540.7 MB. Max. memory is 11.5 GB. * Witness Printer took 420.15 ms. Allocated memory is still 3.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 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_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 106]: 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-16 00:04:51,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] Derived loop invariant: (((((((a0 + 32950 <= 0 && 4 == a2) || (0 < a0 + 61 && a4 + 86 <= 0)) || ((a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && !(1 == a2)) && !(4 == a2))) || (a0 + 98 <= 0 && (\exists v_~a29~0_893 : int :: (v_~a29~0_893 % 29 + 8 <= a29 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893))) || (a0 + 98 <= 0 && 0 < a0 + 147)) || (((!(5 == a2) && 0 < a0 + 61) && !(1 == a2)) && !(4 == a2)) || (a4 + 86 <= 0 && !(5 == a2))) || (a4 + 86 <= 0 && (\exists v_~a29~0_894 : int :: ((((0 <= v_~a29~0_894 * 9 / 10 / 5 && 0 <= v_~a29~0_894 * 9 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_894) && v_~a29~0_894 * 9 / 10 % 5 == 0) && 43 < v_~a29~0_894) && v_~a29~0_894 * 9 / 10 / 5 % 29 <= a29 + 13)) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:04:51,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] Derived loop invariant: (((((((a0 + 32950 <= 0 && 4 == a2) || (0 < a0 + 61 && a4 + 86 <= 0)) || ((a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && !(1 == a2)) && !(4 == a2))) || (a0 + 98 <= 0 && (\exists v_~a29~0_893 : int :: (v_~a29~0_893 % 29 + 8 <= a29 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893))) || (a0 + 98 <= 0 && 0 < a0 + 147)) || (((!(5 == a2) && 0 < a0 + 61) && !(1 == a2)) && !(4 == a2)) || (a4 + 86 <= 0 && !(5 == a2))) || (a4 + 86 <= 0 && (\exists v_~a29~0_894 : int :: ((((0 <= v_~a29~0_894 * 9 / 10 / 5 && 0 <= v_~a29~0_894 * 9 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_894) && v_~a29~0_894 * 9 / 10 % 5 == 0) && 43 < v_~a29~0_894) && v_~a29~0_894 * 9 / 10 / 5 % 29 <= a29 + 13)) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:04:51,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:04:51,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2019-11-16 00:04:51,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] Derived loop invariant: (((((((a0 + 32950 <= 0 && 4 == a2) || (0 < a0 + 61 && a4 + 86 <= 0)) || ((a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && !(1 == a2)) && !(4 == a2))) || (a0 + 98 <= 0 && (\exists v_~a29~0_893 : int :: (v_~a29~0_893 % 29 + 8 <= a29 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893))) || (a0 + 98 <= 0 && 0 < a0 + 147)) || (((!(5 == a2) && 0 < a0 + 61) && !(1 == a2)) && !(4 == a2)) || (a4 + 86 <= 0 && !(5 == a2))) || (a4 + 86 <= 0 && (\exists v_~a29~0_894 : int :: ((((0 <= v_~a29~0_894 * 9 / 10 / 5 && 0 <= v_~a29~0_894 * 9 / 10 / 5 + 1) && 0 <= 9 * v_~a29~0_894) && v_~a29~0_894 * 9 / 10 % 5 == 0) && 43 < v_~a29~0_894) && v_~a29~0_894 * 9 / 10 / 5 % 29 <= a29 + 13)) - 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: 64.3s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 44.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 3459 SDtfs, 4824 SDslu, 580 SDs, 0 SdLazy, 15749 SolverSat, 2515 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 39.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1775 GetRequests, 1728 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11420occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 6000 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 217 NumberOfFragments, 499 HoareAnnotationTreeSize, 4 FomulaSimplifications, 7539 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 10449 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 7461 NumberOfCodeBlocks, 7461 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 7448 ConstructedInterpolants, 62 QuantifiedInterpolants, 25102940 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1967 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 7342/8584 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...