./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label50.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_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 7492cd022f1e8554d216271372c4fc16e69b1112 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:26:31,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:31,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:31,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:31,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:31,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:31,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:31,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:31,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:31,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:31,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:31,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:31,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:31,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:31,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:31,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:31,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:31,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:31,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:31,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:31,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:31,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:31,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:31,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:31,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:31,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:31,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:31,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:31,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:31,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:31,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:31,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:31,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:31,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:31,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:31,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:31,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:31,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:31,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:31,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:31,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:31,708 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:26:31,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:31,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:31,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:31,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:31,723 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:31,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:31,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:26:31,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:26:31,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:26:31,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:31,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:26:31,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:26:31,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:26:31,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:26:31,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:31,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:31,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:26:31,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:31,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:31,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:26:31,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:26:31,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:31,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:31,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:26:31,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:26:31,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:26:31,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:26:31,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:26:31,729 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_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 -> 7492cd022f1e8554d216271372c4fc16e69b1112 [2019-11-15 23:26:31,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:31,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:31,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:31,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:31,789 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:31,790 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2019-11-15 23:26:31,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/data/b5555b97c/317cf2d2579d40d5a3de244dcb89ea9b/FLAGa7ea51ed2 [2019-11-15 23:26:32,365 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:32,366 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2019-11-15 23:26:32,393 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/data/b5555b97c/317cf2d2579d40d5a3de244dcb89ea9b/FLAGa7ea51ed2 [2019-11-15 23:26:32,660 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/data/b5555b97c/317cf2d2579d40d5a3de244dcb89ea9b [2019-11-15 23:26:32,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:32,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:32,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:32,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:32,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:32,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:32" (1/1) ... [2019-11-15 23:26:32,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a80cc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:32, skipping insertion in model container [2019-11-15 23:26:32,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:32" (1/1) ... [2019-11-15 23:26:32,679 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:32,754 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:33,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:33,310 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:33,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:33,497 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:33,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33 WrapperNode [2019-11-15 23:26:33,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:33,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:33,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:33,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:33,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:33,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:33,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:33,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:33,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... [2019-11-15 23:26:33,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:33,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:33,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:33,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:33,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 23:26:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:33,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:35,528 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:26:35,529 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:26:35,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:35 BoogieIcfgContainer [2019-11-15 23:26:35,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:26:35,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:26:35,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:26:35,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:26:35,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:26:32" (1/3) ... [2019-11-15 23:26:35,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327ece76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:26:35, skipping insertion in model container [2019-11-15 23:26:35,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:33" (2/3) ... [2019-11-15 23:26:35,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327ece76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:26:35, skipping insertion in model container [2019-11-15 23:26:35,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:35" (3/3) ... [2019-11-15 23:26:35,540 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label50.c [2019-11-15 23:26:35,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:26:35,557 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:26:35,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:26:35,609 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:26:35,609 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:26:35,609 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:26:35,610 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:26:35,610 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:26:35,610 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:26:35,611 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:26:35,612 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:26:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 23:26:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:26:35,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:35,659 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] [2019-11-15 23:26:35,661 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-15 23:26:35,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:35,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287925756] [2019-11-15 23:26:35,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:35,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:35,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:36,051 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 23:26:36,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287925756] [2019-11-15 23:26:36,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:36,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:36,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289814335] [2019-11-15 23:26:36,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:26:36,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:26:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:36,072 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 23:26:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:38,271 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-11-15 23:26:38,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:26:38,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:26:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:38,290 INFO L225 Difference]: With dead ends: 973 [2019-11-15 23:26:38,290 INFO L226 Difference]: Without dead ends: 607 [2019-11-15 23:26:38,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-15 23:26:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-11-15 23:26:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-15 23:26:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-11-15 23:26:38,374 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 36 [2019-11-15 23:26:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:38,374 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-11-15 23:26:38,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:26:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-11-15 23:26:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:26:38,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:38,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:38,379 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -464053414, now seen corresponding path program 1 times [2019-11-15 23:26:38,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:38,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463922139] [2019-11-15 23:26:38,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:38,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:38,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:38,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463922139] [2019-11-15 23:26:38,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:38,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:26:38,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588020085] [2019-11-15 23:26:38,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:26:38,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:26:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:38,595 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-11-15 23:26:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:40,188 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-11-15 23:26:40,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:26:40,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 23:26:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:40,199 INFO L225 Difference]: With dead ends: 2328 [2019-11-15 23:26:40,200 INFO L226 Difference]: Without dead ends: 1726 [2019-11-15 23:26:40,202 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 23:26:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-15 23:26:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-11-15 23:26:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-15 23:26:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-11-15 23:26:40,254 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 104 [2019-11-15 23:26:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:40,254 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-11-15 23:26:40,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:26:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-11-15 23:26:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 23:26:40,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:40,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:40,259 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 898348729, now seen corresponding path program 1 times [2019-11-15 23:26:40,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:40,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323030678] [2019-11-15 23:26:40,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:40,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:40,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:40,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323030678] [2019-11-15 23:26:40,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:40,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:40,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773930408] [2019-11-15 23:26:40,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:40,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:40,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:40,404 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-11-15 23:26:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:41,369 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-11-15 23:26:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:41,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-15 23:26:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:41,387 INFO L225 Difference]: With dead ends: 4707 [2019-11-15 23:26:41,388 INFO L226 Difference]: Without dead ends: 2999 [2019-11-15 23:26:41,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-15 23:26:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-11-15 23:26:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-15 23:26:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-11-15 23:26:41,463 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 130 [2019-11-15 23:26:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:41,464 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-11-15 23:26:41,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-11-15 23:26:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 23:26:41,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:41,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:41,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1163752101, now seen corresponding path program 1 times [2019-11-15 23:26:41,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:41,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222692058] [2019-11-15 23:26:41,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:41,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:26:41,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222692058] [2019-11-15 23:26:41,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964967543] [2019-11-15 23:26:41,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 23:26:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:41,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:26:41,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:41,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:26:41,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 23:26:41,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425728807] [2019-11-15 23:26:41,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:26:41,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:41,814 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-11-15 23:26:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:42,729 INFO L93 Difference]: Finished difference Result 7652 states and 9361 transitions. [2019-11-15 23:26:42,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:42,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 23:26:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:42,753 INFO L225 Difference]: With dead ends: 7652 [2019-11-15 23:26:42,753 INFO L226 Difference]: Without dead ends: 4655 [2019-11-15 23:26:42,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 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 23:26:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2019-11-15 23:26:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 3550. [2019-11-15 23:26:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-11-15 23:26:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4399 transitions. [2019-11-15 23:26:42,833 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4399 transitions. Word has length 158 [2019-11-15 23:26:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:42,834 INFO L462 AbstractCegarLoop]: Abstraction has 3550 states and 4399 transitions. [2019-11-15 23:26:42,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:26:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4399 transitions. [2019-11-15 23:26:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 23:26:42,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:42,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:43,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:26:43,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:43,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1754552329, now seen corresponding path program 1 times [2019-11-15 23:26:43,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:43,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742454219] [2019-11-15 23:26:43,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:43,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:43,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:43,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742454219] [2019-11-15 23:26:43,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:43,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:26:43,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605602103] [2019-11-15 23:26:43,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:26:43,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:26:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:43,164 INFO L87 Difference]: Start difference. First operand 3550 states and 4399 transitions. Second operand 4 states. [2019-11-15 23:26:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:44,579 INFO L93 Difference]: Finished difference Result 8407 states and 10478 transitions. [2019-11-15 23:26:44,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:26:44,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 23:26:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:44,603 INFO L225 Difference]: With dead ends: 8407 [2019-11-15 23:26:44,604 INFO L226 Difference]: Without dead ends: 4859 [2019-11-15 23:26:44,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2019-11-15 23:26:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4102. [2019-11-15 23:26:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-15 23:26:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5013 transitions. [2019-11-15 23:26:44,691 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5013 transitions. Word has length 163 [2019-11-15 23:26:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:44,692 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5013 transitions. [2019-11-15 23:26:44,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:26:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5013 transitions. [2019-11-15 23:26:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 23:26:44,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:44,698 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:26:44,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1310756102, now seen corresponding path program 1 times [2019-11-15 23:26:44,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:44,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182341315] [2019-11-15 23:26:44,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:44,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:44,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:45,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182341315] [2019-11-15 23:26:45,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705610059] [2019-11-15 23:26:45,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 23:26:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:45,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:26:45,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:45,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:45,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:45,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:26:45,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-11-15 23:26:45,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101001090] [2019-11-15 23:26:45,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:26:45,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:26:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:26:45,771 INFO L87 Difference]: Start difference. First operand 4102 states and 5013 transitions. Second operand 8 states. [2019-11-15 23:26:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:52,674 INFO L93 Difference]: Finished difference Result 17803 states and 21348 transitions. [2019-11-15 23:26:52,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:26:52,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-11-15 23:26:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:26:52,736 INFO L225 Difference]: With dead ends: 17803 [2019-11-15 23:26:52,736 INFO L226 Difference]: Without dead ends: 13334 [2019-11-15 23:26:52,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:26:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13334 states. [2019-11-15 23:26:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13334 to 11847. [2019-11-15 23:26:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-11-15 23:26:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13963 transitions. [2019-11-15 23:26:52,971 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13963 transitions. Word has length 248 [2019-11-15 23:26:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:26:52,971 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13963 transitions. [2019-11-15 23:26:52,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:26:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13963 transitions. [2019-11-15 23:26:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-11-15 23:26:52,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:26:52,988 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:26:53,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:26:53,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:26:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1638131916, now seen corresponding path program 1 times [2019-11-15 23:26:53,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727032842] [2019-11-15 23:26:53,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 218 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:53,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727032842] [2019-11-15 23:26:53,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382326157] [2019-11-15 23:26:53,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 23:26:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:53,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:26:53,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:53,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:53,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:54,209 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-11-15 23:26:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 101 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 23:26:54,689 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:26:54,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-15 23:26:54,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376596325] [2019-11-15 23:26:54,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:26:54,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:26:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:26:54,691 INFO L87 Difference]: Start difference. First operand 11847 states and 13963 transitions. Second operand 9 states. [2019-11-15 23:27:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:01,466 INFO L93 Difference]: Finished difference Result 30168 states and 35764 transitions. [2019-11-15 23:27:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:27:01,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2019-11-15 23:27:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:01,516 INFO L225 Difference]: With dead ends: 30168 [2019-11-15 23:27:01,517 INFO L226 Difference]: Without dead ends: 20354 [2019-11-15 23:27:01,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:27:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20354 states. [2019-11-15 23:27:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20354 to 17011. [2019-11-15 23:27:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17011 states. [2019-11-15 23:27:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 19720 transitions. [2019-11-15 23:27:01,804 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 19720 transitions. Word has length 345 [2019-11-15 23:27:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:01,805 INFO L462 AbstractCegarLoop]: Abstraction has 17011 states and 19720 transitions. [2019-11-15 23:27:01,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:27:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 19720 transitions. [2019-11-15 23:27:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-15 23:27:01,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:01,824 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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 23:27:02,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:02,028 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -620962545, now seen corresponding path program 1 times [2019-11-15 23:27:02,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:02,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606911837] [2019-11-15 23:27:02,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:02,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:02,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 23:27:02,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606911837] [2019-11-15 23:27:02,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:02,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:27:02,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667385565] [2019-11-15 23:27:02,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:27:02,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:27:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:27:02,475 INFO L87 Difference]: Start difference. First operand 17011 states and 19720 transitions. Second operand 4 states. [2019-11-15 23:27:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:03,619 INFO L93 Difference]: Finished difference Result 37366 states and 43502 transitions. [2019-11-15 23:27:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:27:03,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-11-15 23:27:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:03,657 INFO L225 Difference]: With dead ends: 37366 [2019-11-15 23:27:03,657 INFO L226 Difference]: Without dead ends: 20725 [2019-11-15 23:27:03,674 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 23:27:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2019-11-15 23:27:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 19035. [2019-11-15 23:27:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19035 states. [2019-11-15 23:27:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19035 states to 19035 states and 21900 transitions. [2019-11-15 23:27:03,927 INFO L78 Accepts]: Start accepts. Automaton has 19035 states and 21900 transitions. Word has length 357 [2019-11-15 23:27:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:03,927 INFO L462 AbstractCegarLoop]: Abstraction has 19035 states and 21900 transitions. [2019-11-15 23:27:03,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:27:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19035 states and 21900 transitions. [2019-11-15 23:27:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-15 23:27:03,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:03,947 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:27:03,947 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:03,947 INFO L82 PathProgramCache]: Analyzing trace with hash -108272370, now seen corresponding path program 1 times [2019-11-15 23:27:03,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:03,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397991118] [2019-11-15 23:27:03,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:03,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:03,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 23:27:04,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397991118] [2019-11-15 23:27:04,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:04,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:27:04,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805167209] [2019-11-15 23:27:04,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:27:04,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:27:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:27:04,280 INFO L87 Difference]: Start difference. First operand 19035 states and 21900 transitions. Second operand 5 states. [2019-11-15 23:27:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:05,899 INFO L93 Difference]: Finished difference Result 36254 states and 41917 transitions. [2019-11-15 23:27:05,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:27:05,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 358 [2019-11-15 23:27:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:05,923 INFO L225 Difference]: With dead ends: 36254 [2019-11-15 23:27:05,923 INFO L226 Difference]: Without dead ends: 21099 [2019-11-15 23:27:05,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:27:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-11-15 23:27:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 19967. [2019-11-15 23:27:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19967 states. [2019-11-15 23:27:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19967 states to 19967 states and 22740 transitions. [2019-11-15 23:27:06,171 INFO L78 Accepts]: Start accepts. Automaton has 19967 states and 22740 transitions. Word has length 358 [2019-11-15 23:27:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:06,175 INFO L462 AbstractCegarLoop]: Abstraction has 19967 states and 22740 transitions. [2019-11-15 23:27:06,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:27:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19967 states and 22740 transitions. [2019-11-15 23:27:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-15 23:27:06,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:06,191 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:27:06,192 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 535880552, now seen corresponding path program 1 times [2019-11-15 23:27:06,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:06,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007859950] [2019-11-15 23:27:06,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:06,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:06,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 23:27:06,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007859950] [2019-11-15 23:27:06,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:06,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:27:06,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403113872] [2019-11-15 23:27:06,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:27:06,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:27:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:27:06,521 INFO L87 Difference]: Start difference. First operand 19967 states and 22740 transitions. Second operand 4 states. [2019-11-15 23:27:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:07,640 INFO L93 Difference]: Finished difference Result 39938 states and 45481 transitions. [2019-11-15 23:27:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:27:07,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-15 23:27:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:07,659 INFO L225 Difference]: With dead ends: 39938 [2019-11-15 23:27:07,659 INFO L226 Difference]: Without dead ends: 19973 [2019-11-15 23:27:07,673 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 23:27:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-11-15 23:27:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 17942. [2019-11-15 23:27:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17942 states. [2019-11-15 23:27:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 20269 transitions. [2019-11-15 23:27:07,903 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 20269 transitions. Word has length 361 [2019-11-15 23:27:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:07,903 INFO L462 AbstractCegarLoop]: Abstraction has 17942 states and 20269 transitions. [2019-11-15 23:27:07,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:27:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 20269 transitions. [2019-11-15 23:27:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-11-15 23:27:07,917 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:07,918 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:07,918 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash 19325802, now seen corresponding path program 1 times [2019-11-15 23:27:07,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:07,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464897353] [2019-11-15 23:27:07,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:07,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:07,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 23:27:08,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464897353] [2019-11-15 23:27:08,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:08,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:27:08,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531806147] [2019-11-15 23:27:08,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:27:08,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:27:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:27:08,203 INFO L87 Difference]: Start difference. First operand 17942 states and 20269 transitions. Second operand 3 states. [2019-11-15 23:27:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:09,398 INFO L93 Difference]: Finished difference Result 34770 states and 39330 transitions. [2019-11-15 23:27:09,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:27:09,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-11-15 23:27:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:09,416 INFO L225 Difference]: With dead ends: 34770 [2019-11-15 23:27:09,416 INFO L226 Difference]: Without dead ends: 19044 [2019-11-15 23:27:09,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:27:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2019-11-15 23:27:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 17743. [2019-11-15 23:27:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17743 states. [2019-11-15 23:27:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17743 states to 17743 states and 19773 transitions. [2019-11-15 23:27:09,637 INFO L78 Accepts]: Start accepts. Automaton has 17743 states and 19773 transitions. Word has length 395 [2019-11-15 23:27:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:09,638 INFO L462 AbstractCegarLoop]: Abstraction has 17743 states and 19773 transitions. [2019-11-15 23:27:09,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:27:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17743 states and 19773 transitions. [2019-11-15 23:27:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-11-15 23:27:09,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:09,656 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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 23:27:09,657 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash -168560213, now seen corresponding path program 1 times [2019-11-15 23:27:09,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:09,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185713809] [2019-11-15 23:27:09,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:09,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:09,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 388 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:10,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185713809] [2019-11-15 23:27:10,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998942410] [2019-11-15 23:27:10,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/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 23:27:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:10,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:27:10,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:10,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:10,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 191 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:11,199 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:11,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-15 23:27:11,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662327975] [2019-11-15 23:27:11,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:27:11,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:11,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:27:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:27:11,201 INFO L87 Difference]: Start difference. First operand 17743 states and 19773 transitions. Second operand 10 states. [2019-11-15 23:27:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:16,749 INFO L93 Difference]: Finished difference Result 36971 states and 41074 transitions. [2019-11-15 23:27:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:27:16,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 431 [2019-11-15 23:27:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:16,768 INFO L225 Difference]: With dead ends: 36971 [2019-11-15 23:27:16,768 INFO L226 Difference]: Without dead ends: 22921 [2019-11-15 23:27:16,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:27:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22921 states. [2019-11-15 23:27:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22921 to 16448. [2019-11-15 23:27:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16448 states. [2019-11-15 23:27:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 18237 transitions. [2019-11-15 23:27:16,976 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 18237 transitions. Word has length 431 [2019-11-15 23:27:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:16,977 INFO L462 AbstractCegarLoop]: Abstraction has 16448 states and 18237 transitions. [2019-11-15 23:27:16,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:27:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 18237 transitions. [2019-11-15 23:27:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-11-15 23:27:16,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:16,997 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:17,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:17,199 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:17,199 INFO L82 PathProgramCache]: Analyzing trace with hash -794974525, now seen corresponding path program 1 times [2019-11-15 23:27:17,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:17,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620294573] [2019-11-15 23:27:17,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:17,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-15 23:27:17,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620294573] [2019-11-15 23:27:17,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:17,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:27:17,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004942918] [2019-11-15 23:27:17,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:27:17,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:27:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:27:17,702 INFO L87 Difference]: Start difference. First operand 16448 states and 18237 transitions. Second operand 5 states. [2019-11-15 23:27:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:19,096 INFO L93 Difference]: Finished difference Result 36769 states and 40703 transitions. [2019-11-15 23:27:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:27:19,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 527 [2019-11-15 23:27:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:19,112 INFO L225 Difference]: With dead ends: 36769 [2019-11-15 23:27:19,112 INFO L226 Difference]: Without dead ends: 22353 [2019-11-15 23:27:19,121 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 23:27:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2019-11-15 23:27:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 17921. [2019-11-15 23:27:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17921 states. [2019-11-15 23:27:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17921 states to 17921 states and 19769 transitions. [2019-11-15 23:27:19,309 INFO L78 Accepts]: Start accepts. Automaton has 17921 states and 19769 transitions. Word has length 527 [2019-11-15 23:27:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:19,310 INFO L462 AbstractCegarLoop]: Abstraction has 17921 states and 19769 transitions. [2019-11-15 23:27:19,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:27:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17921 states and 19769 transitions. [2019-11-15 23:27:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-11-15 23:27:19,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:19,328 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:19,329 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1413485239, now seen corresponding path program 1 times [2019-11-15 23:27:19,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:19,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423257981] [2019-11-15 23:27:19,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:19,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:19,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-15 23:27:19,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423257981] [2019-11-15 23:27:19,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:19,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:27:19,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190920054] [2019-11-15 23:27:19,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:27:19,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:27:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:27:19,694 INFO L87 Difference]: Start difference. First operand 17921 states and 19769 transitions. Second operand 3 states. [2019-11-15 23:27:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:20,364 INFO L93 Difference]: Finished difference Result 36390 states and 40168 transitions. [2019-11-15 23:27:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:27:20,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 553 [2019-11-15 23:27:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:20,365 INFO L225 Difference]: With dead ends: 36390 [2019-11-15 23:27:20,365 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:27:20,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:27:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:27:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:27:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:27:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:27:20,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 553 [2019-11-15 23:27:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:20,373 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:27:20,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:27:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:27:20,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:27:20,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:27:21,272 WARN L191 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 514 DAG size of output: 347 [2019-11-15 23:27:22,069 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 514 DAG size of output: 347 [2019-11-15 23:27:23,565 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 325 DAG size of output: 72 [2019-11-15 23:27:24,885 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 325 DAG size of output: 72 [2019-11-15 23:27:24,887 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:27:24,887 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 23:27:24,887 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 23:27:24,888 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 23:27:24,889 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse7 (= 10 ~a25~0))) (let ((.cse3 (= 12 ~a25~0)) (.cse8 (<= ~a29~0 275)) (.cse2 (<= ~a23~0 312)) (.cse0 (= ~a25~0 13)) (.cse9 (<= (+ ~a23~0 43) 0)) (.cse6 (not .cse7)) (.cse10 (<= ~a29~0 245)) (.cse5 (exists ((v_~a29~0_502 Int)) (let ((.cse11 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse11 299861) 300138)) (<= 0 .cse11))))) (.cse4 (= ~a4~0 1)) (.cse1 (= 1 ~a4~0))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse2 .cse3 .cse4) (and .cse2 (<= ~a29~0 140)) (and .cse5 .cse1 .cse6) (and (<= ~a29~0 130) .cse7) (and .cse3 .cse8) (and .cse1 (= ~a25~0 11)) (and (= ~a25~0 9) .cse1) (and .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse10) (and .cse4 .cse7 .cse9) (and (not .cse0) (<= ~a29~0 599998) .cse9 .cse6) (and (or (<= ~a23~0 138) .cse10) .cse5 .cse4) (and (< 306 ~a23~0) .cse7 .cse1)))) [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,890 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,891 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,892 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,893 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,894 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,895 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,896 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,897 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,898 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,899 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,900 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,903 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,904 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:27:24,905 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 23:27:24,906 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,907 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:27:24,908 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,909 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,910 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,911 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 23:27:24,912 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:27:24,913 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,914 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:27:24,915 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,916 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,917 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 23:27:24,918 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,919 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,919 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,919 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse7 (= 10 ~a25~0))) (let ((.cse3 (= 12 ~a25~0)) (.cse8 (<= ~a29~0 275)) (.cse2 (<= ~a23~0 312)) (.cse0 (= ~a25~0 13)) (.cse9 (<= (+ ~a23~0 43) 0)) (.cse6 (not .cse7)) (.cse10 (<= ~a29~0 245)) (.cse5 (exists ((v_~a29~0_502 Int)) (let ((.cse11 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse11 299861) 300138)) (<= 0 .cse11))))) (.cse4 (= ~a4~0 1)) (.cse1 (= 1 ~a4~0))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse2 .cse3 .cse4) (and .cse2 (<= ~a29~0 140)) (and .cse5 .cse1 .cse6) (and (<= ~a29~0 130) .cse7) (and .cse3 .cse8) (and .cse1 (= ~a25~0 11)) (and (= ~a25~0 9) .cse1) (and .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse10) (and .cse4 .cse7 .cse9) (and (not .cse0) (<= ~a29~0 599998) .cse9 .cse6) (and (or (<= ~a23~0 138) .cse10) .cse5 .cse4) (and (< 306 ~a23~0) .cse7 .cse1)))) [2019-11-15 23:27:24,919 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,919 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,920 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:27:24,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:24,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:27:24 BoogieIcfgContainer [2019-11-15 23:27:24,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:27:24,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:27:24,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:27:24,948 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:27:24,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:35" (3/4) ... [2019-11-15 23:27:24,952 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:27:24,978 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:27:24,980 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:27:25,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) [2019-11-15 23:27:25,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) [2019-11-15 23:27:25,136 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d1df6f22-d713-4f64-8be0-4ce768722ed5/bin/uautomizer/witness.graphml [2019-11-15 23:27:25,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:27:25,138 INFO L168 Benchmark]: Toolchain (without parser) took 52474.04 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 944.7 MB in the beginning and 1.7 GB in the end (delta: -753.9 MB). Peak memory consumption was 908.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,138 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:27:25,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,139 INFO L168 Benchmark]: Boogie Preprocessor took 160.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,139 INFO L168 Benchmark]: RCFGBuilder took 1733.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 869.8 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,140 INFO L168 Benchmark]: TraceAbstraction took 49416.35 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 869.8 MB in the beginning and 1.7 GB in the end (delta: -875.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,140 INFO L168 Benchmark]: Witness Printer took 188.73 ms. Allocated memory is still 2.7 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:25,142 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 160.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1733.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 869.8 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49416.35 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 869.8 MB in the beginning and 1.7 GB in the end (delta: -875.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 188.73 ms. Allocated memory is still 2.7 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 114]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 23:27:25,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 23:27:25,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-15 23:27:25,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || ((a23 <= 312 && 12 == a25) && a4 == 1)) || (a23 <= 312 && a29 <= 140)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(10 == a25))) || (a29 <= 130 && 10 == a25)) || (12 == a25 && a29 <= 275)) || (1 == a4 && a25 == 11)) || (a25 == 9 && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(10 == a25))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(10 == a25))) || (((a23 <= 138 || a29 <= 245) && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && a4 == 1)) || ((306 < a23 && 10 == a25) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 49.3s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, HoareTripleCheckerStatistics: 1976 SDtfs, 10836 SDslu, 944 SDs, 0 SdLazy, 28259 SolverSat, 4459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 1212 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19967occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23770 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 250 NumberOfFragments, 359 HoareAnnotationTreeSize, 3 FomulaSimplifications, 34624 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 18156 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 5348 NumberOfCodeBlocks, 5348 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5330 ConstructedInterpolants, 432 QuantifiedInterpolants, 10143979 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1597 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 4564/5418 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...