./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label11.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_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/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 7ac7639a72133e31492d63978588a646cea9108e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:55:02,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:55:02,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:55:02,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:55:02,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:55:02,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:55:02,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:55:02,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:55:02,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:55:02,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:55:02,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:55:02,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:55:02,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:55:02,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:55:02,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:55:02,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:55:02,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:55:02,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:55:02,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:55:02,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:55:02,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:55:02,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:55:02,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:55:02,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:55:02,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:55:02,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:55:02,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:55:02,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:55:02,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:55:02,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:55:02,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:55:02,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:55:02,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:55:02,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:55:02,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:55:02,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:55:02,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:55:02,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:55:02,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:55:02,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:55:02,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:55:02,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:55:02,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:55:02,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:55:02,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:55:02,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:55:02,823 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:55:02,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:55:02,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:55:02,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:55:02,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:55:02,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:55:02,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:55:02,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:55:02,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:55:02,825 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:55:02,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:55:02,826 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:55:02,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:55:02,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:55:02,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:55:02,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:55:02,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:55:02,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:55:02,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:55:02,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:55:02,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:55:02,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:55:02,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:55:02,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:55:02,829 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_9ee13a26-8940-460b-b625-d941d0b1b544/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 -> 7ac7639a72133e31492d63978588a646cea9108e [2019-11-15 22:55:02,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:55:02,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:55:02,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:55:02,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:55:02,907 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:55:02,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2019-11-15 22:55:02,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/data/cd651b363/8dec4c9b1dcf4e0a89bbae0d65a95fad/FLAG2aa536d7f [2019-11-15 22:55:03,698 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:55:03,698 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2019-11-15 22:55:03,742 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/data/cd651b363/8dec4c9b1dcf4e0a89bbae0d65a95fad/FLAG2aa536d7f [2019-11-15 22:55:03,815 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/data/cd651b363/8dec4c9b1dcf4e0a89bbae0d65a95fad [2019-11-15 22:55:03,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:55:03,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:55:03,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:55:03,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:55:03,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:55:03,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:55:03" (1/1) ... [2019-11-15 22:55:03,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4317a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:03, skipping insertion in model container [2019-11-15 22:55:03,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:55:03" (1/1) ... [2019-11-15 22:55:03,843 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:55:03,948 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:55:04,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:55:04,905 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:55:05,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:55:05,248 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:55:05,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05 WrapperNode [2019-11-15 22:55:05,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:55:05,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:55:05,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:55:05,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:55:05,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:55:05,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:55:05,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:55:05,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:55:05,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... [2019-11-15 22:55:05,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:55:05,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:55:05,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:55:05,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:55:05,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:55:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:55:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:55:09,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:55:09,352 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 22:55:09,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:09 BoogieIcfgContainer [2019-11-15 22:55:09,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:55:09,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:55:09,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:55:09,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:55:09,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:55:03" (1/3) ... [2019-11-15 22:55:09,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43314ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:55:09, skipping insertion in model container [2019-11-15 22:55:09,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:05" (2/3) ... [2019-11-15 22:55:09,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43314ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:55:09, skipping insertion in model container [2019-11-15 22:55:09,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:09" (3/3) ... [2019-11-15 22:55:09,367 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2019-11-15 22:55:09,377 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:55:09,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:55:09,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:55:09,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:55:09,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:55:09,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:55:09,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:55:09,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:55:09,446 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:55:09,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:55:09,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:55:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 22:55:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 22:55:09,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:09,494 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:09,496 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2019-11-15 22:55:09,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:09,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903776881] [2019-11-15 22:55:09,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:09,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:09,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:09,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903776881] [2019-11-15 22:55:09,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:09,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:09,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144212343] [2019-11-15 22:55:09,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:09,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:09,865 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 22:55:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:14,480 INFO L93 Difference]: Finished difference Result 1466 states and 2714 transitions. [2019-11-15 22:55:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:14,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 22:55:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:14,509 INFO L225 Difference]: With dead ends: 1466 [2019-11-15 22:55:14,509 INFO L226 Difference]: Without dead ends: 975 [2019-11-15 22:55:14,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-11-15 22:55:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 973. [2019-11-15 22:55:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-11-15 22:55:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1485 transitions. [2019-11-15 22:55:14,623 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1485 transitions. Word has length 55 [2019-11-15 22:55:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:14,624 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1485 transitions. [2019-11-15 22:55:14,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:55:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1485 transitions. [2019-11-15 22:55:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 22:55:14,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:14,636 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:55:14,637 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 521697686, now seen corresponding path program 1 times [2019-11-15 22:55:14,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:14,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978863735] [2019-11-15 22:55:14,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:14,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:14,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:14,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978863735] [2019-11-15 22:55:14,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:14,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:14,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670783446] [2019-11-15 22:55:14,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:14,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:14,893 INFO L87 Difference]: Start difference. First operand 973 states and 1485 transitions. Second operand 4 states. [2019-11-15 22:55:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:18,753 INFO L93 Difference]: Finished difference Result 3745 states and 5745 transitions. [2019-11-15 22:55:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:18,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-15 22:55:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:18,771 INFO L225 Difference]: With dead ends: 3745 [2019-11-15 22:55:18,772 INFO L226 Difference]: Without dead ends: 2774 [2019-11-15 22:55:18,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-11-15 22:55:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1871. [2019-11-15 22:55:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2019-11-15 22:55:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2498 transitions. [2019-11-15 22:55:18,858 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2498 transitions. Word has length 167 [2019-11-15 22:55:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:18,859 INFO L462 AbstractCegarLoop]: Abstraction has 1871 states and 2498 transitions. [2019-11-15 22:55:18,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:55:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2498 transitions. [2019-11-15 22:55:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-15 22:55:18,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:18,874 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:18,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash -256885756, now seen corresponding path program 1 times [2019-11-15 22:55:18,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:18,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793297351] [2019-11-15 22:55:18,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:18,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:18,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-15 22:55:19,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793297351] [2019-11-15 22:55:19,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:19,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:55:19,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050070116] [2019-11-15 22:55:19,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:55:19,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:55:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:55:19,697 INFO L87 Difference]: Start difference. First operand 1871 states and 2498 transitions. Second operand 5 states. [2019-11-15 22:55:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:23,531 INFO L93 Difference]: Finished difference Result 4639 states and 5973 transitions. [2019-11-15 22:55:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:23,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2019-11-15 22:55:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:23,550 INFO L225 Difference]: With dead ends: 4639 [2019-11-15 22:55:23,550 INFO L226 Difference]: Without dead ends: 2770 [2019-11-15 22:55:23,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:55:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2019-11-15 22:55:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2470. [2019-11-15 22:55:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-15 22:55:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3139 transitions. [2019-11-15 22:55:23,615 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3139 transitions. Word has length 327 [2019-11-15 22:55:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:23,616 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 3139 transitions. [2019-11-15 22:55:23,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:55:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3139 transitions. [2019-11-15 22:55:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-11-15 22:55:23,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:23,626 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:23,627 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash -52089934, now seen corresponding path program 1 times [2019-11-15 22:55:23,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:23,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211717649] [2019-11-15 22:55:23,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:23,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:23,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 102 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:24,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211717649] [2019-11-15 22:55:24,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117428528] [2019-11-15 22:55:24,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:25,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:55:25,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:25,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:55:25,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-15 22:55:25,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39100235] [2019-11-15 22:55:25,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:25,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:25,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:55:25,329 INFO L87 Difference]: Start difference. First operand 2470 states and 3139 transitions. Second operand 3 states. [2019-11-15 22:55:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:28,512 INFO L93 Difference]: Finished difference Result 5547 states and 7133 transitions. [2019-11-15 22:55:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:28,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 401 [2019-11-15 22:55:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:28,531 INFO L225 Difference]: With dead ends: 5547 [2019-11-15 22:55:28,531 INFO L226 Difference]: Without dead ends: 3079 [2019-11-15 22:55:28,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 401 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:55:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2019-11-15 22:55:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3077. [2019-11-15 22:55:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-11-15 22:55:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 3865 transitions. [2019-11-15 22:55:28,601 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 3865 transitions. Word has length 401 [2019-11-15 22:55:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:28,602 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 3865 transitions. [2019-11-15 22:55:28,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 3865 transitions. [2019-11-15 22:55:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-15 22:55:28,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:28,613 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:55:28,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:28,824 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1721986535, now seen corresponding path program 1 times [2019-11-15 22:55:28,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:28,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96117197] [2019-11-15 22:55:28,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:28,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:28,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 343 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-15 22:55:30,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96117197] [2019-11-15 22:55:30,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468430443] [2019-11-15 22:55:30,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:30,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:55:30,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-15 22:55:30,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:55:30,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 22:55:30,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555308618] [2019-11-15 22:55:30,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:30,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:55:30,486 INFO L87 Difference]: Start difference. First operand 3077 states and 3865 transitions. Second operand 3 states. [2019-11-15 22:55:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:33,165 INFO L93 Difference]: Finished difference Result 6750 states and 8572 transitions. [2019-11-15 22:55:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:33,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-11-15 22:55:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:33,191 INFO L225 Difference]: With dead ends: 6750 [2019-11-15 22:55:33,192 INFO L226 Difference]: Without dead ends: 3675 [2019-11-15 22:55:33,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:55:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2019-11-15 22:55:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3675. [2019-11-15 22:55:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3675 states. [2019-11-15 22:55:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4637 transitions. [2019-11-15 22:55:33,278 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4637 transitions. Word has length 418 [2019-11-15 22:55:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:33,279 INFO L462 AbstractCegarLoop]: Abstraction has 3675 states and 4637 transitions. [2019-11-15 22:55:33,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4637 transitions. [2019-11-15 22:55:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-11-15 22:55:33,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:33,298 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:33,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:33,501 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:33,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:33,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1129479199, now seen corresponding path program 1 times [2019-11-15 22:55:33,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:33,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178358050] [2019-11-15 22:55:33,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:33,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:33,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-11-15 22:55:34,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178358050] [2019-11-15 22:55:34,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826556244] [2019-11-15 22:55:34,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:55:34,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-11-15 22:55:34,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:55:34,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-15 22:55:34,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226597084] [2019-11-15 22:55:34,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:34,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:34,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:34,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:34,899 INFO L87 Difference]: Start difference. First operand 3675 states and 4637 transitions. Second operand 3 states. [2019-11-15 22:55:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:38,176 INFO L93 Difference]: Finished difference Result 9146 states and 11374 transitions. [2019-11-15 22:55:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:38,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-11-15 22:55:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:38,214 INFO L225 Difference]: With dead ends: 9146 [2019-11-15 22:55:38,215 INFO L226 Difference]: Without dead ends: 5473 [2019-11-15 22:55:38,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2019-11-15 22:55:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 5172. [2019-11-15 22:55:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5172 states. [2019-11-15 22:55:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 6291 transitions. [2019-11-15 22:55:38,338 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 6291 transitions. Word has length 514 [2019-11-15 22:55:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:38,339 INFO L462 AbstractCegarLoop]: Abstraction has 5172 states and 6291 transitions. [2019-11-15 22:55:38,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 6291 transitions. [2019-11-15 22:55:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-11-15 22:55:38,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:38,356 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:38,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:38,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1616945835, now seen corresponding path program 1 times [2019-11-15 22:55:38,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:38,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938550929] [2019-11-15 22:55:38,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:38,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:38,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-15 22:55:39,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938550929] [2019-11-15 22:55:39,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:39,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:39,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810655365] [2019-11-15 22:55:39,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:39,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:39,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:39,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:39,263 INFO L87 Difference]: Start difference. First operand 5172 states and 6291 transitions. Second operand 3 states. [2019-11-15 22:55:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:41,896 INFO L93 Difference]: Finished difference Result 13929 states and 17105 transitions. [2019-11-15 22:55:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:41,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 529 [2019-11-15 22:55:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:41,938 INFO L225 Difference]: With dead ends: 13929 [2019-11-15 22:55:41,938 INFO L226 Difference]: Without dead ends: 8759 [2019-11-15 22:55:41,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2019-11-15 22:55:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 5767. [2019-11-15 22:55:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-15 22:55:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7357 transitions. [2019-11-15 22:55:42,076 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7357 transitions. Word has length 529 [2019-11-15 22:55:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:42,078 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7357 transitions. [2019-11-15 22:55:42,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7357 transitions. [2019-11-15 22:55:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-15 22:55:42,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:42,088 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1] [2019-11-15 22:55:42,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1165923697, now seen corresponding path program 1 times [2019-11-15 22:55:42,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:42,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807523954] [2019-11-15 22:55:42,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:42,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:42,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 597 proven. 3 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-15 22:55:43,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807523954] [2019-11-15 22:55:43,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525173493] [2019-11-15 22:55:43,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:43,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:55:43,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-15 22:55:44,620 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:44,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 22:55:44,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235216467] [2019-11-15 22:55:44,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:55:44,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:55:44,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:55:44,625 INFO L87 Difference]: Start difference. First operand 5767 states and 7357 transitions. Second operand 9 states. [2019-11-15 22:55:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:51,386 INFO L93 Difference]: Finished difference Result 16769 states and 20802 transitions. [2019-11-15 22:55:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:55:51,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 582 [2019-11-15 22:55:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:51,407 INFO L225 Difference]: With dead ends: 16769 [2019-11-15 22:55:51,408 INFO L226 Difference]: Without dead ends: 7858 [2019-11-15 22:55:51,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 579 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:55:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7858 states. [2019-11-15 22:55:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7858 to 7559. [2019-11-15 22:55:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7559 states. [2019-11-15 22:55:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7559 states to 7559 states and 8359 transitions. [2019-11-15 22:55:51,546 INFO L78 Accepts]: Start accepts. Automaton has 7559 states and 8359 transitions. Word has length 582 [2019-11-15 22:55:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:51,547 INFO L462 AbstractCegarLoop]: Abstraction has 7559 states and 8359 transitions. [2019-11-15 22:55:51,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:55:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7559 states and 8359 transitions. [2019-11-15 22:55:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-11-15 22:55:51,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:51,557 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:55:51,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:51,771 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1723812101, now seen corresponding path program 1 times [2019-11-15 22:55:51,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:51,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606451844] [2019-11-15 22:55:51,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:51,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:51,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:54,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606451844] [2019-11-15 22:55:54,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770856701] [2019-11-15 22:55:54,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:54,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:55:54,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:54,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:54,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:54,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:54,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 269 proven. 40 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-15 22:55:55,724 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:55,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 19 [2019-11-15 22:55:55,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656032117] [2019-11-15 22:55:55,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 22:55:55,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 22:55:55,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:55:55,728 INFO L87 Difference]: Start difference. First operand 7559 states and 8359 transitions. Second operand 19 states. [2019-11-15 22:56:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:20,298 INFO L93 Difference]: Finished difference Result 29875 states and 33050 transitions. [2019-11-15 22:56:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-15 22:56:20,299 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 590 [2019-11-15 22:56:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:20,344 INFO L225 Difference]: With dead ends: 29875 [2019-11-15 22:56:20,344 INFO L226 Difference]: Without dead ends: 22019 [2019-11-15 22:56:20,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 620 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=618, Invalid=2244, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:56:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22019 states. [2019-11-15 22:56:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22019 to 13003. [2019-11-15 22:56:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13003 states. [2019-11-15 22:56:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13003 states to 13003 states and 14004 transitions. [2019-11-15 22:56:20,763 INFO L78 Accepts]: Start accepts. Automaton has 13003 states and 14004 transitions. Word has length 590 [2019-11-15 22:56:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:20,764 INFO L462 AbstractCegarLoop]: Abstraction has 13003 states and 14004 transitions. [2019-11-15 22:56:20,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 22:56:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 13003 states and 14004 transitions. [2019-11-15 22:56:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2019-11-15 22:56:20,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:20,781 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:56:20,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:20,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1098345871, now seen corresponding path program 1 times [2019-11-15 22:56:20,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:20,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185460493] [2019-11-15 22:56:20,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:20,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:20,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 22:56:21,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185460493] [2019-11-15 22:56:21,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:21,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:56:21,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340897865] [2019-11-15 22:56:21,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:56:21,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:56:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:21,525 INFO L87 Difference]: Start difference. First operand 13003 states and 14004 transitions. Second operand 4 states. [2019-11-15 22:56:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:23,392 INFO L93 Difference]: Finished difference Result 25709 states and 27713 transitions. [2019-11-15 22:56:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:56:23,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 658 [2019-11-15 22:56:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:23,422 INFO L225 Difference]: With dead ends: 25709 [2019-11-15 22:56:23,423 INFO L226 Difference]: Without dead ends: 13007 [2019-11-15 22:56:23,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13007 states. [2019-11-15 22:56:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13007 to 12103. [2019-11-15 22:56:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12103 states. [2019-11-15 22:56:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12103 states to 12103 states and 12824 transitions. [2019-11-15 22:56:23,604 INFO L78 Accepts]: Start accepts. Automaton has 12103 states and 12824 transitions. Word has length 658 [2019-11-15 22:56:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:23,605 INFO L462 AbstractCegarLoop]: Abstraction has 12103 states and 12824 transitions. [2019-11-15 22:56:23,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:56:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 12103 states and 12824 transitions. [2019-11-15 22:56:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-11-15 22:56:23,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:23,621 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:56:23,621 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:23,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash 649916601, now seen corresponding path program 1 times [2019-11-15 22:56:23,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:23,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095068160] [2019-11-15 22:56:23,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:23,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:23,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-15 22:56:24,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095068160] [2019-11-15 22:56:24,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:24,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:56:24,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314426178] [2019-11-15 22:56:24,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:56:24,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:24,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:56:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:24,358 INFO L87 Difference]: Start difference. First operand 12103 states and 12824 transitions. Second operand 4 states. [2019-11-15 22:56:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:27,761 INFO L93 Difference]: Finished difference Result 26614 states and 28265 transitions. [2019-11-15 22:56:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:56:27,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 708 [2019-11-15 22:56:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:27,779 INFO L225 Difference]: With dead ends: 26614 [2019-11-15 22:56:27,780 INFO L226 Difference]: Without dead ends: 16309 [2019-11-15 22:56:27,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16309 states. [2019-11-15 22:56:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16309 to 14494. [2019-11-15 22:56:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14494 states. [2019-11-15 22:56:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 15331 transitions. [2019-11-15 22:56:27,983 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 15331 transitions. Word has length 708 [2019-11-15 22:56:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:27,984 INFO L462 AbstractCegarLoop]: Abstraction has 14494 states and 15331 transitions. [2019-11-15 22:56:27,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:56:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 15331 transitions. [2019-11-15 22:56:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2019-11-15 22:56:28,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:28,003 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:56:28,003 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash -588327305, now seen corresponding path program 1 times [2019-11-15 22:56:28,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:28,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783458233] [2019-11-15 22:56:28,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:28,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:28,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 715 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 22:56:28,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783458233] [2019-11-15 22:56:28,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473776390] [2019-11-15 22:56:28,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:29,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:56:29,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:56:29,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:56:29,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:56:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-15 22:56:29,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:56:29,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2019-11-15 22:56:29,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299651305] [2019-11-15 22:56:29,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:56:29,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:29,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:56:29,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:56:29,493 INFO L87 Difference]: Start difference. First operand 14494 states and 15331 transitions. Second operand 4 states. [2019-11-15 22:56:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:31,190 INFO L93 Difference]: Finished difference Result 27109 states and 28752 transitions. [2019-11-15 22:56:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:56:31,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 744 [2019-11-15 22:56:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:31,213 INFO L225 Difference]: With dead ends: 27109 [2019-11-15 22:56:31,213 INFO L226 Difference]: Without dead ends: 14413 [2019-11-15 22:56:31,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 744 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:56:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14413 states. [2019-11-15 22:56:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14413 to 12616. [2019-11-15 22:56:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12616 states. [2019-11-15 22:56:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12616 states to 12616 states and 13029 transitions. [2019-11-15 22:56:31,443 INFO L78 Accepts]: Start accepts. Automaton has 12616 states and 13029 transitions. Word has length 744 [2019-11-15 22:56:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:31,445 INFO L462 AbstractCegarLoop]: Abstraction has 12616 states and 13029 transitions. [2019-11-15 22:56:31,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:56:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12616 states and 13029 transitions. [2019-11-15 22:56:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2019-11-15 22:56:31,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:31,603 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:56:31,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:31,811 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1421008417, now seen corresponding path program 1 times [2019-11-15 22:56:31,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:31,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534223635] [2019-11-15 22:56:31,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:31,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:31,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 499 proven. 303 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-15 22:56:33,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534223635] [2019-11-15 22:56:33,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014820372] [2019-11-15 22:56:33,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:33,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:56:33,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:56:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:56:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:56:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:56:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:56:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:56:33,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:56:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 617 proven. 53 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-15 22:56:34,757 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:56:34,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-15 22:56:34,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424601064] [2019-11-15 22:56:34,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:56:34,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:34,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:56:34,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:56:34,760 INFO L87 Difference]: Start difference. First operand 12616 states and 13029 transitions. Second operand 14 states. [2019-11-15 22:56:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:52,328 INFO L93 Difference]: Finished difference Result 34118 states and 35352 transitions. [2019-11-15 22:56:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-15 22:56:52,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 799 [2019-11-15 22:56:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:52,349 INFO L225 Difference]: With dead ends: 34118 [2019-11-15 22:56:52,350 INFO L226 Difference]: Without dead ends: 20880 [2019-11-15 22:56:52,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 831 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=448, Invalid=2204, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 22:56:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20880 states. [2019-11-15 22:56:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20880 to 17400. [2019-11-15 22:56:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-11-15 22:56:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 17963 transitions. [2019-11-15 22:56:52,592 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 17963 transitions. Word has length 799 [2019-11-15 22:56:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:52,593 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 17963 transitions. [2019-11-15 22:56:52,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:56:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 17963 transitions. [2019-11-15 22:56:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2019-11-15 22:56:52,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:52,627 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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] [2019-11-15 22:56:52,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:52,830 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash -464751274, now seen corresponding path program 1 times [2019-11-15 22:56:52,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:52,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324093846] [2019-11-15 22:56:52,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:52,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:52,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 1376 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-11-15 22:56:54,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324093846] [2019-11-15 22:56:54,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:54,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:56:54,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530332104] [2019-11-15 22:56:54,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:56:54,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:56:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:54,032 INFO L87 Difference]: Start difference. First operand 17400 states and 17963 transitions. Second operand 4 states. [2019-11-15 22:56:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:55,532 INFO L93 Difference]: Finished difference Result 33900 states and 35003 transitions. [2019-11-15 22:56:55,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:56:55,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1029 [2019-11-15 22:56:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:55,550 INFO L225 Difference]: With dead ends: 33900 [2019-11-15 22:56:55,550 INFO L226 Difference]: Without dead ends: 16801 [2019-11-15 22:56:55,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16801 states. [2019-11-15 22:56:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16801 to 15898. [2019-11-15 22:56:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15898 states. [2019-11-15 22:56:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15898 states to 15898 states and 16329 transitions. [2019-11-15 22:56:55,751 INFO L78 Accepts]: Start accepts. Automaton has 15898 states and 16329 transitions. Word has length 1029 [2019-11-15 22:56:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:55,752 INFO L462 AbstractCegarLoop]: Abstraction has 15898 states and 16329 transitions. [2019-11-15 22:56:55,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:56:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15898 states and 16329 transitions. [2019-11-15 22:56:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-11-15 22:56:55,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:55,777 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:56:55,777 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2066717736, now seen corresponding path program 1 times [2019-11-15 22:56:55,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:55,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079018085] [2019-11-15 22:56:55,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:55,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:55,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 1456 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2019-11-15 22:56:58,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079018085] [2019-11-15 22:56:58,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:58,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:56:58,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50006581] [2019-11-15 22:56:58,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:56:58,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:58,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:56:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:56:58,235 INFO L87 Difference]: Start difference. First operand 15898 states and 16329 transitions. Second operand 8 states. [2019-11-15 22:57:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:02,145 INFO L93 Difference]: Finished difference Result 35231 states and 36197 transitions. [2019-11-15 22:57:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:57:02,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1102 [2019-11-15 22:57:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:02,163 INFO L225 Difference]: With dead ends: 35231 [2019-11-15 22:57:02,163 INFO L226 Difference]: Without dead ends: 19933 [2019-11-15 22:57:02,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:57:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19933 states. [2019-11-15 22:57:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19933 to 15599. [2019-11-15 22:57:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15599 states. [2019-11-15 22:57:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15599 states to 15599 states and 15979 transitions. [2019-11-15 22:57:02,410 INFO L78 Accepts]: Start accepts. Automaton has 15599 states and 15979 transitions. Word has length 1102 [2019-11-15 22:57:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:02,411 INFO L462 AbstractCegarLoop]: Abstraction has 15599 states and 15979 transitions. [2019-11-15 22:57:02,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:57:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15599 states and 15979 transitions. [2019-11-15 22:57:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1140 [2019-11-15 22:57:02,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:02,442 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:02,442 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:02,443 INFO L82 PathProgramCache]: Analyzing trace with hash -330010666, now seen corresponding path program 1 times [2019-11-15 22:57:02,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:02,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556683318] [2019-11-15 22:57:02,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:02,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:02,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2393 backedges. 1609 proven. 407 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-15 22:57:04,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556683318] [2019-11-15 22:57:04,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867120125] [2019-11-15 22:57:04,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:57:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:04,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:57:04,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:57:04,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:57:05,394 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_898 Int)) (and (<= 0 (+ v_~a29~0_898 317633)) (<= (mod (+ v_~a29~0_898 17705) 299928) (+ c_~a29~0 300071)))) (exists ((v_prenex_6 Int)) (let ((.cse0 (mod (+ v_prenex_6 17705) 299928))) (and (not (= .cse0 0)) (< (+ v_prenex_6 317633) 0) (<= .cse0 (+ c_~a29~0 599999))))) (exists ((v_~a29~0_898 Int)) (let ((.cse1 (mod (+ v_~a29~0_898 17705) 299928))) (and (= .cse1 0) (<= .cse1 (+ c_~a29~0 300071)))))) is different from true [2019-11-15 22:57:05,994 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_898 Int)) (and (<= 0 (+ v_~a29~0_898 317633)) (<= (mod (+ v_~a29~0_898 17705) 299928) (+ c_~a29~0 300071)))) (exists ((v_prenex_6 Int)) (let ((.cse0 (mod (+ v_prenex_6 17705) 299928))) (and (not (= .cse0 0)) (< (+ v_prenex_6 317633) 0) (<= .cse0 (+ c_~a29~0 599999))))) (exists ((v_prenex_7 Int)) (let ((.cse1 (mod (+ v_prenex_7 17705) 299928))) (and (<= .cse1 (+ c_~a29~0 300071)) (= .cse1 0))))) is different from true [2019-11-15 22:57:06,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:57:06,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:57:06,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:57:06,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:57:06,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:57:13,412 WARN L191 SmtUtils]: Spent 7.10 s on a formula simplification. DAG size of input: 77 DAG size of output: 35 [2019-11-15 22:57:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:57:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2393 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 1301 trivial. 53 not checked. [2019-11-15 22:57:16,893 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:57:16,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-15 22:57:16,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985854972] [2019-11-15 22:57:16,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:57:16,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:57:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2019-11-15 22:57:16,896 INFO L87 Difference]: Start difference. First operand 15599 states and 15979 transitions. Second operand 11 states. [2019-11-15 22:57:29,402 WARN L191 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-15 22:57:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:31,435 INFO L93 Difference]: Finished difference Result 36809 states and 37679 transitions. [2019-11-15 22:57:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:57:31,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1139 [2019-11-15 22:57:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:31,436 INFO L225 Difference]: With dead ends: 36809 [2019-11-15 22:57:31,436 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:57:31,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1150 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=181, Invalid=376, Unknown=3, NotChecked=90, Total=650 [2019-11-15 22:57:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:57:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:57:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:57:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:57:31,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1139 [2019-11-15 22:57:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:31,449 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:57:31,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:57:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:57:31,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:57:31,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:57:31,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:57:33,172 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 669 DAG size of output: 480 [2019-11-15 22:57:34,262 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 669 DAG size of output: 480 [2019-11-15 22:57:34,700 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 339 [2019-11-15 22:57:38,112 WARN L191 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 433 DAG size of output: 99 [2019-11-15 22:57:41,376 WARN L191 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 433 DAG size of output: 99 [2019-11-15 22:57:43,673 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 311 DAG size of output: 101 [2019-11-15 22:57:43,675 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,676 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,677 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,678 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 22:57:43,679 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,680 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 22:57:43,681 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,682 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,682 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,682 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,682 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:57:43,683 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-15 22:57:43,684 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,685 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 22:57:43,686 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 22:57:43,686 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,686 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 22:57:43,686 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,686 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,686 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,687 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,688 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 22:57:43,689 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 22:57:43,690 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 22:57:43,691 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,692 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 22:57:43,693 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 22:57:43,694 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 22:57:43,695 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-15 22:57:43,695 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-15 22:57:43,695 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,695 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,695 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,695 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,696 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse24 (= 1 ~a2~0)) (.cse9 (= 2 ~a2~0)) (.cse27 (+ ~a0~0 147)) (.cse28 (+ ~a4~0 86))) (let ((.cse5 (<= .cse28 0)) (.cse4 (< 0 .cse27)) (.cse10 (< 0 (+ ~a4~0 42))) (.cse7 (<= (+ ~a0~0 98) 0)) (.cse26 (not (= ~a2~0 4))) (.cse13 (not .cse9)) (.cse25 (not .cse24)) (.cse11 (< 43 ~a29~0)) (.cse2 (= 4 ~a2~0))) (let ((.cse0 (<= 220364 ~a29~0)) (.cse15 (not .cse2)) (.cse3 (and (and .cse7 .cse26 .cse13) .cse25 .cse11)) (.cse17 (< 0 .cse28)) (.cse18 (<= (+ ~a0~0 148) 0)) (.cse22 (<= 0 (+ ~a0~0 44))) (.cse8 (< 0 (+ ~a29~0 144))) (.cse1 (<= .cse27 0)) (.cse19 (or .cse4 .cse10 (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse20 (= 3 ~a2~0)) (.cse16 (<= ~a29~0 43)) (.cse14 (<= 0 (+ ~a29~0 599989))) (.cse12 (and .cse5 .cse26)) (.cse6 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse4 .cse5 .cse6) (and (and .cse7 .cse8) .cse9) (and .cse7 .cse4 .cse10 .cse11) (and (and .cse7 .cse5) .cse8) (and .cse12 .cse9) (and .cse7 .cse13 .cse4 .cse14 .cse15) (and .cse1 .cse16 .cse8 .cse15) (and (= ~a2~0 1) .cse17 .cse16 .cse8) (and .cse18 .cse19 .cse20) (and .cse7 .cse4 .cse20) (and .cse18 .cse3) (and (<= (+ ~a29~0 17) 0) .cse18 .cse17 .cse2 .cse14) (let ((.cse21 (+ ~a4~0 89)) (.cse23 (+ ~a29~0 127))) (and (<= .cse21 0) (<= 0 .cse21) .cse22 (<= 0 .cse23) (<= .cse23 0))) (and .cse24 .cse18 .cse8) (and (or .cse22 .cse12) .cse20) (and (<= (+ ~a0~0 216075) 0) .cse14 .cse20) (and .cse12 .cse25 .cse8) (and .cse1 .cse16 .cse19 .cse14 .cse20) (and (and .cse4 .cse16 .cse5 .cse2) .cse14) (and .cse12 .cse6))))) [2019-11-15 22:57:43,696 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 22:57:43,697 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 22:57:43,697 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,697 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,697 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,697 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,697 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,698 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,698 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,698 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 22:57:43,698 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,698 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 22:57:43,698 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-15 22:57:43,699 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,699 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-15 22:57:43,699 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-15 22:57:43,699 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 22:57:43,699 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 22:57:43,699 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,700 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,700 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,700 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,700 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,700 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 22:57:43,700 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,701 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,702 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,702 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,702 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse27 (+ ~a4~0 86))) (let ((.cse26 (= 1 ~a2~0)) (.cse11 (= 2 ~a2~0)) (.cse3 (<= .cse27 0)) (.cse28 (not (= ~a2~0 4)))) (let ((.cse19 (and .cse3 .cse28)) (.cse17 (+ ~a29~0 144)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse6 (not .cse11)) (.cse20 (not .cse26)) (.cse15 (< 43 ~a29~0)) (.cse29 (+ ~a0~0 147)) (.cse14 (= 4 ~a2~0))) (let ((.cse8 (not .cse14)) (.cse16 (= ~a2~0 1)) (.cse12 (<= ~a29~0 43)) (.cse2 (< 0 .cse29)) (.cse13 (<= .cse29 0)) (.cse9 (and (and .cse5 .cse28 .cse6) .cse20 .cse15)) (.cse21 (<= 220364 ~a29~0)) (.cse18 (< 0 .cse27)) (.cse7 (<= 0 (+ ~a29~0 599989))) (.cse0 (<= (+ ~a0~0 148) 0)) (.cse10 (< 0 .cse17)) (.cse23 (<= 0 (+ ~a0~0 44))) (.cse25 (and .cse19 (<= ~a2~0 3))) (.cse1 (= 3 ~a2~0)) (.cse4 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse0) (and (and .cse5 .cse10) .cse11) (and (and .cse12 .cse10 .cse8) .cse13) (and (and .cse2 .cse12 .cse3 .cse14) .cse7) (and .cse12 .cse13 .cse1 .cse7) (and .cse5 .cse2 (< 0 (+ ~a4~0 42)) .cse15) (and (and .cse5 .cse3) .cse10) (and (and .cse3 .cse16) (<= .cse17 0)) (and .cse16 .cse18 .cse12 .cse10) (and .cse19 .cse20 .cse10) (and .cse5 .cse2 .cse1) (and .cse21 .cse13 .cse14) (and .cse9 .cse21) (and (<= (+ ~a29~0 17) 0) .cse0 .cse18 .cse14 .cse7) (let ((.cse22 (+ ~a4~0 89)) (.cse24 (+ ~a29~0 127))) (and (<= .cse22 0) (<= 0 .cse22) .cse23 (<= 0 .cse24) (<= .cse24 0))) (and .cse11 .cse25) (and .cse26 .cse0 .cse10) (and (or .cse23 .cse25) .cse1) (and .cse19 .cse4)))))) [2019-11-15 22:57:43,702 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,703 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 22:57:43,703 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 22:57:43,703 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,703 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,703 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,703 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,704 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,704 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,704 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 22:57:43,704 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 22:57:43,704 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,704 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,705 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-15 22:57:43,705 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,705 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,705 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,705 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,705 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,706 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,707 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,707 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,707 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:57:43,707 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 22:57:43,707 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,707 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 22:57:43,708 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,708 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,708 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,708 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,708 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,708 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,709 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,709 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 22:57:43,709 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 22:57:43,709 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,709 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,709 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,710 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,710 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,710 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,710 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,710 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 22:57:43,710 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,711 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,712 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,713 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,713 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,713 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse27 (+ ~a4~0 86))) (let ((.cse26 (= 1 ~a2~0)) (.cse11 (= 2 ~a2~0)) (.cse3 (<= .cse27 0)) (.cse28 (not (= ~a2~0 4)))) (let ((.cse19 (and .cse3 .cse28)) (.cse17 (+ ~a29~0 144)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse6 (not .cse11)) (.cse20 (not .cse26)) (.cse15 (< 43 ~a29~0)) (.cse29 (+ ~a0~0 147)) (.cse14 (= 4 ~a2~0))) (let ((.cse8 (not .cse14)) (.cse16 (= ~a2~0 1)) (.cse12 (<= ~a29~0 43)) (.cse2 (< 0 .cse29)) (.cse13 (<= .cse29 0)) (.cse9 (and (and .cse5 .cse28 .cse6) .cse20 .cse15)) (.cse21 (<= 220364 ~a29~0)) (.cse18 (< 0 .cse27)) (.cse7 (<= 0 (+ ~a29~0 599989))) (.cse0 (<= (+ ~a0~0 148) 0)) (.cse10 (< 0 .cse17)) (.cse23 (<= 0 (+ ~a0~0 44))) (.cse25 (and .cse19 (<= ~a2~0 3))) (.cse1 (= 3 ~a2~0)) (.cse4 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse0) (and (and .cse5 .cse10) .cse11) (and (and .cse12 .cse10 .cse8) .cse13) (and (and .cse2 .cse12 .cse3 .cse14) .cse7) (and .cse12 .cse13 .cse1 .cse7) (and .cse5 .cse2 (< 0 (+ ~a4~0 42)) .cse15) (and (and .cse5 .cse3) .cse10) (and (and .cse3 .cse16) (<= .cse17 0)) (and .cse16 .cse18 .cse12 .cse10) (and .cse19 .cse20 .cse10) (and .cse5 .cse2 .cse1) (and .cse21 .cse13 .cse14) (and .cse9 .cse21) (and (<= (+ ~a29~0 17) 0) .cse0 .cse18 .cse14 .cse7) (let ((.cse22 (+ ~a4~0 89)) (.cse24 (+ ~a29~0 127))) (and (<= .cse22 0) (<= 0 .cse22) .cse23 (<= 0 .cse24) (<= .cse24 0))) (and .cse11 .cse25) (and .cse26 .cse0 .cse10) (and (or .cse23 .cse25) .cse1) (and .cse19 .cse4)))))) [2019-11-15 22:57:43,713 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 22:57:43,713 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 22:57:43,713 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,713 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,714 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,714 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,714 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,714 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,714 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,715 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,715 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 22:57:43,715 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 22:57:43,715 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,715 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 22:57:43,715 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 22:57:43,716 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,716 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,716 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,716 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,716 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,716 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,717 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 22:57:43,717 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,717 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,717 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,717 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,717 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-15 22:57:43,718 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-15 22:57:43,718 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 22:57:43,718 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,718 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 22:57:43,718 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 22:57:43,718 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,719 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,719 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,719 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,719 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,719 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,719 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,720 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 22:57:43,720 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,720 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,720 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,720 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,720 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 22:57:43,721 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,721 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:57:43,721 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,721 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,721 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,721 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,722 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,722 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,722 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,722 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,722 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,722 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-15 22:57:43,723 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-15 22:57:43,723 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,723 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 22:57:43,723 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,723 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,724 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,724 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 22:57:43,724 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,724 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,724 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,724 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,725 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,725 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,725 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,725 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-15 22:57:43,725 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-15 22:57:43,725 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,726 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,726 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,726 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 22:57:43,726 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,726 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,726 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,727 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,727 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,727 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 22:57:43,727 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,727 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,727 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 22:57:43,728 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 22:57:43,728 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,728 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:57:43,728 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-15 22:57:43,728 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,728 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:57:43,729 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,729 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 22:57:43,729 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 22:57:43,729 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,729 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,729 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 22:57:43,730 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 22:57:43,730 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-15 22:57:43,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:57:43 BoogieIcfgContainer [2019-11-15 22:57:43,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:57:43,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:57:43,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:57:43,778 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:57:43,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:09" (3/4) ... [2019-11-15 22:57:43,782 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:57:43,839 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 22:57:43,843 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:57:44,204 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ee13a26-8940-460b-b625-d941d0b1b544/bin/uautomizer/witness.graphml [2019-11-15 22:57:44,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:57:44,206 INFO L168 Benchmark]: Toolchain (without parser) took 160385.82 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 944.7 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 379.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,207 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:57:44,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1423.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 248.42 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: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,208 INFO L168 Benchmark]: Boogie Preprocessor took 242.67 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,208 INFO L168 Benchmark]: RCFGBuilder took 3612.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.5 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,209 INFO L168 Benchmark]: TraceAbstraction took 154422.57 ms. Allocated memory was 1.3 GB in the beginning and 4.7 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,209 INFO L168 Benchmark]: Witness Printer took 427.42 ms. Allocated memory is still 4.7 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:44,212 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.28 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 1423.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 248.42 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: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 242.67 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3612.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.5 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 154422.57 ms. Allocated memory was 1.3 GB in the beginning and 4.7 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 427.42 ms. Allocated memory is still 4.7 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: 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 Derived loop invariant: (((((((((((((((((((((a0 + 148 <= 0 && 3 == a2) || ((0 < a0 + 147 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && !(2 == a2)) && 0 < a0 + 147) && 0 <= a29 + 599989) && !(4 == a2))) || (((((a0 + 98 <= 0 && !(a2 == 4)) && !(2 == a2)) && !(1 == a2)) && 43 < a29) && a0 + 148 <= 0)) || ((a0 + 98 <= 0 && 0 < a29 + 144) && 2 == a2)) || (((a29 <= 43 && 0 < a29 + 144) && !(4 == a2)) && a0 + 147 <= 0)) || ((((0 < a0 + 147 && a29 <= 43) && a4 + 86 <= 0) && 4 == a2) && 0 <= a29 + 599989)) || (((a29 <= 43 && a0 + 147 <= 0) && 3 == a2) && 0 <= a29 + 599989)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && 43 < a29)) || ((a0 + 98 <= 0 && a4 + 86 <= 0) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && 3 == a2)) || ((220364 <= a29 && a0 + 147 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && !(a2 == 4)) && !(2 == a2)) && !(1 == a2)) && 43 < a29) && 220364 <= a29)) || ((((a29 + 17 <= 0 && a0 + 148 <= 0) && 0 < a4 + 86) && 4 == a2) && 0 <= a29 + 599989)) || ((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a29 + 127 <= 0)) || (2 == a2 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) || ((1 == a2 && a0 + 148 <= 0) && 0 < a29 + 144)) || ((0 <= a0 + 44 || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 == a2)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a0 + 148 <= 0 && 3 == a2) || ((0 < a0 + 147 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && !(2 == a2)) && 0 < a0 + 147) && 0 <= a29 + 599989) && !(4 == a2))) || (((((a0 + 98 <= 0 && !(a2 == 4)) && !(2 == a2)) && !(1 == a2)) && 43 < a29) && a0 + 148 <= 0)) || ((a0 + 98 <= 0 && 0 < a29 + 144) && 2 == a2)) || (((a29 <= 43 && 0 < a29 + 144) && !(4 == a2)) && a0 + 147 <= 0)) || ((((0 < a0 + 147 && a29 <= 43) && a4 + 86 <= 0) && 4 == a2) && 0 <= a29 + 599989)) || (((a29 <= 43 && a0 + 147 <= 0) && 3 == a2) && 0 <= a29 + 599989)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && 43 < a29)) || ((a0 + 98 <= 0 && a4 + 86 <= 0) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 < a29 + 144)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && 3 == a2)) || ((220364 <= a29 && a0 + 147 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && !(a2 == 4)) && !(2 == a2)) && !(1 == a2)) && 43 < a29) && 220364 <= a29)) || ((((a29 + 17 <= 0 && a0 + 148 <= 0) && 0 < a4 + 86) && 4 == a2) && 0 <= a29 + 599989)) || ((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a29 + 127 <= 0)) || (2 == a2 && (a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) || ((1 == a2 && a0 + 148 <= 0) && 0 < a29 + 144)) || ((0 <= a0 + 44 || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 <= 3)) && 3 == a2)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((220364 <= a29 && a0 + 147 <= 0) && 4 == a2) || (220364 <= a29 && (((a0 + 98 <= 0 && !(a2 == 4)) && !(2 == a2)) && !(1 == a2)) && 43 < a29)) || ((0 < a0 + 147 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && 0 < a29 + 144) && 2 == a2)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && 43 < a29)) || ((a0 + 98 <= 0 && a4 + 86 <= 0) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || ((((a0 + 98 <= 0 && !(2 == a2)) && 0 < a0 + 147) && 0 <= a29 + 599989) && !(4 == a2))) || (((a0 + 147 <= 0 && a29 <= 43) && 0 < a29 + 144) && !(4 == a2))) || (((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144)) || ((a0 + 148 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(4 == input))) && 3 == a2)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && 3 == a2)) || (a0 + 148 <= 0 && (((a0 + 98 <= 0 && !(a2 == 4)) && !(2 == a2)) && !(1 == a2)) && 43 < a29)) || ((((a29 + 17 <= 0 && a0 + 148 <= 0) && 0 < a4 + 86) && 4 == a2) && 0 <= a29 + 599989)) || ((((a4 + 89 <= 0 && 0 <= a4 + 89) && 0 <= a0 + 44) && 0 <= a29 + 127) && a29 + 127 <= 0)) || ((1 == a2 && a0 + 148 <= 0) && 0 < a29 + 144)) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(a2 == 4))) && 3 == a2)) || ((a0 + 216075 <= 0 && 0 <= a29 + 599989) && 3 == a2)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 < a29 + 144)) || ((((a0 + 147 <= 0 && a29 <= 43) && ((0 < a0 + 147 || 0 < a4 + 42) || !(4 == input))) && 0 <= a29 + 599989) && 3 == a2)) || ((((0 < a0 + 147 && a29 <= 43) && a4 + 86 <= 0) && 4 == a2) && 0 <= a29 + 599989)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a0 + 61 <= 0) - 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: 154.2s, OverallIterations: 16, TraceHistogramMax: 7, AutomataDifference: 100.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.0s, HoareTripleCheckerStatistics: 2982 SDtfs, 30358 SDslu, 2149 SDs, 0 SdLazy, 81783 SolverSat, 6368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5488 GetRequests, 5277 SyntacticMatches, 24 SemanticMatches, 187 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17400occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 27048 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 291 NumberOfFragments, 1263 HoareAnnotationTreeSize, 4 FomulaSimplifications, 186016 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 430462 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 14949 NumberOfCodeBlocks, 14949 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14925 ConstructedInterpolants, 230 QuantifiedInterpolants, 53515796 SizeOfPredicates, 18 NumberOfNonLiveVariables, 6085 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 17554/19123 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...