./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label28.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_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/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 fbb1e06d5cba6e6a6afd48c5da6c687c5c87d864 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:55:18,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:18,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:18,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:18,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:18,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:18,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:18,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:18,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:18,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:18,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:18,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:18,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:18,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:18,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:18,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:18,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:18,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:18,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:18,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:18,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:18,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:18,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:18,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:18,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:18,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:18,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:18,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:18,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:18,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:18,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:18,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:18,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:18,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:18,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:18,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:18,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:18,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:18,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:18,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:18,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:18,710 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:55:18,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:18,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:18,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:18,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:18,737 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:18,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:18,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:55:18,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:55:18,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:55:18,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:18,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:55:18,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:55:18,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:55:18,739 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:55:18,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:18,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:18,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:55:18,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:18,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:18,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:55:18,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:55:18,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:55:18,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:18,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:55:18,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:55:18,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:55:18,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:55:18,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:55:18,743 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_e43c73d3-6006-48b5-8a91-5b439746897d/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 -> fbb1e06d5cba6e6a6afd48c5da6c687c5c87d864 [2019-11-15 23:55:18,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:18,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:18,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:18,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:18,798 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:18,799 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2019-11-15 23:55:18,859 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/data/e7030b889/6325314e37754069a7273d70606fac8b/FLAGc530a5105 [2019-11-15 23:55:19,407 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:19,408 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2019-11-15 23:55:19,421 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/data/e7030b889/6325314e37754069a7273d70606fac8b/FLAGc530a5105 [2019-11-15 23:55:19,680 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/data/e7030b889/6325314e37754069a7273d70606fac8b [2019-11-15 23:55:19,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:19,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:19,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:19,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:19,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:19,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:19" (1/1) ... [2019-11-15 23:55:19,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572e2db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:19, skipping insertion in model container [2019-11-15 23:55:19,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:19" (1/1) ... [2019-11-15 23:55:19,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:19,765 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:20,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:20,327 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:20,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:20,552 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:20,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20 WrapperNode [2019-11-15 23:55:20,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:20,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:20,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:20,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:20,562 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:55:20" (1/1) ... [2019-11-15 23:55:20,588 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:55:20" (1/1) ... [2019-11-15 23:55:20,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:20,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:20,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:20,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:20,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... [2019-11-15 23:55:20,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:20,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:20,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:20,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:20,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/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:55:20,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:20,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:22,862 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:22,862 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:55:22,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:22 BoogieIcfgContainer [2019-11-15 23:55:22,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:22,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:55:22,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:55:22,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:55:22,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:55:19" (1/3) ... [2019-11-15 23:55:22,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c05d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:22, skipping insertion in model container [2019-11-15 23:55:22,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:20" (2/3) ... [2019-11-15 23:55:22,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c05d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:22, skipping insertion in model container [2019-11-15 23:55:22,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:22" (3/3) ... [2019-11-15 23:55:22,873 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2019-11-15 23:55:22,882 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:55:22,890 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:55:22,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:55:22,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:55:22,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:55:22,934 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:55:22,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:22,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:22,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:55:22,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:22,935 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:55:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 23:55:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:55:22,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:22,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:22,977 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2019-11-15 23:55:22,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:22,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974159421] [2019-11-15 23:55:22,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:22,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:22,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:23,385 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:55:23,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974159421] [2019-11-15 23:55:23,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:23,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:23,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205139510] [2019-11-15 23:55:23,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:23,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:23,408 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 23:55:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:25,535 INFO L93 Difference]: Finished difference Result 968 states and 1740 transitions. [2019-11-15 23:55:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:25,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 23:55:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:25,571 INFO L225 Difference]: With dead ends: 968 [2019-11-15 23:55:25,572 INFO L226 Difference]: Without dead ends: 602 [2019-11-15 23:55:25,580 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:55:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-15 23:55:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 407. [2019-11-15 23:55:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 23:55:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 590 transitions. [2019-11-15 23:55:25,673 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 590 transitions. Word has length 48 [2019-11-15 23:55:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:25,673 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 590 transitions. [2019-11-15 23:55:25,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 590 transitions. [2019-11-15 23:55:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:55:25,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:25,679 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:55:25,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2122398730, now seen corresponding path program 1 times [2019-11-15 23:55:25,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:25,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908706750] [2019-11-15 23:55:25,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:25,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:25,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908706750] [2019-11-15 23:55:25,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:25,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:25,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72956895] [2019-11-15 23:55:25,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:25,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:25,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:25,892 INFO L87 Difference]: Start difference. First operand 407 states and 590 transitions. Second operand 4 states. [2019-11-15 23:55:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:27,335 INFO L93 Difference]: Finished difference Result 1567 states and 2285 transitions. [2019-11-15 23:55:27,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:27,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-15 23:55:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:27,342 INFO L225 Difference]: With dead ends: 1567 [2019-11-15 23:55:27,342 INFO L226 Difference]: Without dead ends: 1162 [2019-11-15 23:55:27,344 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:55:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-15 23:55:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1148. [2019-11-15 23:55:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-11-15 23:55:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1565 transitions. [2019-11-15 23:55:27,390 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1565 transitions. Word has length 116 [2019-11-15 23:55:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:27,390 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 1565 transitions. [2019-11-15 23:55:27,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1565 transitions. [2019-11-15 23:55:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 23:55:27,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:27,398 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,398 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1068723632, now seen corresponding path program 1 times [2019-11-15 23:55:27,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:27,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130379076] [2019-11-15 23:55:27,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:27,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:27,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130379076] [2019-11-15 23:55:27,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:27,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:27,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605743322] [2019-11-15 23:55:27,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:27,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:27,646 INFO L87 Difference]: Start difference. First operand 1148 states and 1565 transitions. Second operand 4 states. [2019-11-15 23:55:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:29,208 INFO L93 Difference]: Finished difference Result 4144 states and 5715 transitions. [2019-11-15 23:55:29,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:29,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-15 23:55:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:29,225 INFO L225 Difference]: With dead ends: 4144 [2019-11-15 23:55:29,225 INFO L226 Difference]: Without dead ends: 2998 [2019-11-15 23:55:29,228 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:55:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-11-15 23:55:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2019-11-15 23:55:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-11-15 23:55:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3663 transitions. [2019-11-15 23:55:29,297 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3663 transitions. Word has length 141 [2019-11-15 23:55:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:29,298 INFO L462 AbstractCegarLoop]: Abstraction has 2998 states and 3663 transitions. [2019-11-15 23:55:29,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3663 transitions. [2019-11-15 23:55:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-15 23:55:29,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:29,303 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:55:29,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash -381057166, now seen corresponding path program 1 times [2019-11-15 23:55:29,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:29,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358764484] [2019-11-15 23:55:29,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:29,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:29,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:29,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358764484] [2019-11-15 23:55:29,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:29,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:29,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119443707] [2019-11-15 23:55:29,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:29,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:29,623 INFO L87 Difference]: Start difference. First operand 2998 states and 3663 transitions. Second operand 4 states. [2019-11-15 23:55:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:31,121 INFO L93 Difference]: Finished difference Result 7485 states and 9308 transitions. [2019-11-15 23:55:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:31,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-15 23:55:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:31,146 INFO L225 Difference]: With dead ends: 7485 [2019-11-15 23:55:31,146 INFO L226 Difference]: Without dead ends: 4673 [2019-11-15 23:55:31,150 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:55:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2019-11-15 23:55:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4470. [2019-11-15 23:55:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2019-11-15 23:55:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5440 transitions. [2019-11-15 23:55:31,239 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5440 transitions. Word has length 236 [2019-11-15 23:55:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:31,240 INFO L462 AbstractCegarLoop]: Abstraction has 4470 states and 5440 transitions. [2019-11-15 23:55:31,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5440 transitions. [2019-11-15 23:55:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-15 23:55:31,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:31,246 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:55:31,247 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash -356634931, now seen corresponding path program 1 times [2019-11-15 23:55:31,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:31,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882009274] [2019-11-15 23:55:31,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:31,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:31,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 23:55:31,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882009274] [2019-11-15 23:55:31,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:31,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:55:31,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422127167] [2019-11-15 23:55:31,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:31,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:31,476 INFO L87 Difference]: Start difference. First operand 4470 states and 5440 transitions. Second operand 3 states. [2019-11-15 23:55:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:32,355 INFO L93 Difference]: Finished difference Result 10041 states and 12450 transitions. [2019-11-15 23:55:32,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:32,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-11-15 23:55:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:32,383 INFO L225 Difference]: With dead ends: 10041 [2019-11-15 23:55:32,383 INFO L226 Difference]: Without dead ends: 5757 [2019-11-15 23:55:32,388 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:55:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-11-15 23:55:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5572. [2019-11-15 23:55:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-11-15 23:55:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 6703 transitions. [2019-11-15 23:55:32,493 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 6703 transitions. Word has length 251 [2019-11-15 23:55:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:32,493 INFO L462 AbstractCegarLoop]: Abstraction has 5572 states and 6703 transitions. [2019-11-15 23:55:32,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 6703 transitions. [2019-11-15 23:55:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-15 23:55:32,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:32,499 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:55:32,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1030741549, now seen corresponding path program 1 times [2019-11-15 23:55:32,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:32,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880537022] [2019-11-15 23:55:32,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:32,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:32,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 66 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:33,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880537022] [2019-11-15 23:55:33,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682005889] [2019-11-15 23:55:33,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/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:55:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:33,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:55:33,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:33,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:33,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:33,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:33,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 23:55:33,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35710701] [2019-11-15 23:55:33,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:33,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:33,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:33,887 INFO L87 Difference]: Start difference. First operand 5572 states and 6703 transitions. Second operand 4 states. [2019-11-15 23:55:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:36,267 INFO L93 Difference]: Finished difference Result 15571 states and 18826 transitions. [2019-11-15 23:55:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:36,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-11-15 23:55:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:36,320 INFO L225 Difference]: With dead ends: 15571 [2019-11-15 23:55:36,320 INFO L226 Difference]: Without dead ends: 10185 [2019-11-15 23:55:36,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10185 states. [2019-11-15 23:55:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10185 to 9443. [2019-11-15 23:55:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2019-11-15 23:55:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 11279 transitions. [2019-11-15 23:55:36,625 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 11279 transitions. Word has length 267 [2019-11-15 23:55:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:36,633 INFO L462 AbstractCegarLoop]: Abstraction has 9443 states and 11279 transitions. [2019-11-15 23:55:36,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 11279 transitions. [2019-11-15 23:55:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 23:55:36,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:36,640 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:55:36,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:36,855 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:36,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1546626242, now seen corresponding path program 1 times [2019-11-15 23:55:36,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:36,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076021662] [2019-11-15 23:55:36,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:36,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:36,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 23:55:37,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076021662] [2019-11-15 23:55:37,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433965669] [2019-11-15 23:55:37,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/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:55:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:37,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:37,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 23:55:37,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:37,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-15 23:55:37,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503169146] [2019-11-15 23:55:37,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:37,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:37,270 INFO L87 Difference]: Start difference. First operand 9443 states and 11279 transitions. Second operand 3 states. [2019-11-15 23:55:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:38,159 INFO L93 Difference]: Finished difference Result 18514 states and 22156 transitions. [2019-11-15 23:55:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:38,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-15 23:55:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:38,198 INFO L225 Difference]: With dead ends: 18514 [2019-11-15 23:55:38,198 INFO L226 Difference]: Without dead ends: 9257 [2019-11-15 23:55:38,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 279 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:55:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2019-11-15 23:55:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 9257. [2019-11-15 23:55:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9257 states. [2019-11-15 23:55:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9257 states to 9257 states and 10788 transitions. [2019-11-15 23:55:38,341 INFO L78 Accepts]: Start accepts. Automaton has 9257 states and 10788 transitions. Word has length 278 [2019-11-15 23:55:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:38,342 INFO L462 AbstractCegarLoop]: Abstraction has 9257 states and 10788 transitions. [2019-11-15 23:55:38,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9257 states and 10788 transitions. [2019-11-15 23:55:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 23:55:38,349 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:38,350 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:55:38,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:38,554 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 627435673, now seen corresponding path program 1 times [2019-11-15 23:55:38,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:38,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146960514] [2019-11-15 23:55:38,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:38,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:38,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:38,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146960514] [2019-11-15 23:55:38,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:38,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:38,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234961589] [2019-11-15 23:55:38,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:38,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:38,935 INFO L87 Difference]: Start difference. First operand 9257 states and 10788 transitions. Second operand 4 states. [2019-11-15 23:55:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:40,108 INFO L93 Difference]: Finished difference Result 19084 states and 22277 transitions. [2019-11-15 23:55:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:40,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-15 23:55:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:40,133 INFO L225 Difference]: With dead ends: 19084 [2019-11-15 23:55:40,133 INFO L226 Difference]: Without dead ends: 10013 [2019-11-15 23:55:40,142 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:55:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-11-15 23:55:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 9627. [2019-11-15 23:55:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9627 states. [2019-11-15 23:55:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 11195 transitions. [2019-11-15 23:55:40,264 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 11195 transitions. Word has length 281 [2019-11-15 23:55:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:40,265 INFO L462 AbstractCegarLoop]: Abstraction has 9627 states and 11195 transitions. [2019-11-15 23:55:40,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 11195 transitions. [2019-11-15 23:55:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 23:55:40,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:40,275 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:40,275 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1328057524, now seen corresponding path program 1 times [2019-11-15 23:55:40,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:40,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185871535] [2019-11-15 23:55:40,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:40,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:40,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 107 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:40,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185871535] [2019-11-15 23:55:40,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100396378] [2019-11-15 23:55:40,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/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:55:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:40,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:55:40,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:40,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-11-15 23:55:41,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:41,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-15 23:55:41,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517499724] [2019-11-15 23:55:41,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:41,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:55:41,255 INFO L87 Difference]: Start difference. First operand 9627 states and 11195 transitions. Second operand 3 states. [2019-11-15 23:55:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:59,955 INFO L93 Difference]: Finished difference Result 22211 states and 25973 transitions. [2019-11-15 23:55:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:59,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-15 23:55:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:59,980 INFO L225 Difference]: With dead ends: 22211 [2019-11-15 23:55:59,981 INFO L226 Difference]: Without dead ends: 12034 [2019-11-15 23:55:59,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:56:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2019-11-15 23:56:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 11847. [2019-11-15 23:56:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-11-15 23:56:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13776 transitions. [2019-11-15 23:56:00,154 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13776 transitions. Word has length 305 [2019-11-15 23:56:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:00,154 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13776 transitions. [2019-11-15 23:56:00,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13776 transitions. [2019-11-15 23:56:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 23:56:00,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:00,165 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:00,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:00,377 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 510288335, now seen corresponding path program 1 times [2019-11-15 23:56:00,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:00,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617339000] [2019-11-15 23:56:00,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:00,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:00,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 23:56:00,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617339000] [2019-11-15 23:56:00,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:00,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:00,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603273450] [2019-11-15 23:56:00,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:00,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:00,563 INFO L87 Difference]: Start difference. First operand 11847 states and 13776 transitions. Second operand 3 states. [2019-11-15 23:56:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:01,627 INFO L93 Difference]: Finished difference Result 25531 states and 29712 transitions. [2019-11-15 23:56:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:01,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-15 23:56:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:01,654 INFO L225 Difference]: With dead ends: 25531 [2019-11-15 23:56:01,655 INFO L226 Difference]: Without dead ends: 13134 [2019-11-15 23:56:01,667 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:56:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13134 states. [2019-11-15 23:56:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13134 to 10914. [2019-11-15 23:56:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10914 states. [2019-11-15 23:56:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10914 states to 10914 states and 12544 transitions. [2019-11-15 23:56:01,931 INFO L78 Accepts]: Start accepts. Automaton has 10914 states and 12544 transitions. Word has length 310 [2019-11-15 23:56:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:01,932 INFO L462 AbstractCegarLoop]: Abstraction has 10914 states and 12544 transitions. [2019-11-15 23:56:01,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10914 states and 12544 transitions. [2019-11-15 23:56:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-15 23:56:01,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:01,948 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:01,949 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2040805826, now seen corresponding path program 1 times [2019-11-15 23:56:01,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775138741] [2019-11-15 23:56:01,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-15 23:56:02,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775138741] [2019-11-15 23:56:02,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:02,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:02,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127420983] [2019-11-15 23:56:02,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:02,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:02,219 INFO L87 Difference]: Start difference. First operand 10914 states and 12544 transitions. Second operand 3 states. [2019-11-15 23:56:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:03,167 INFO L93 Difference]: Finished difference Result 22200 states and 25551 transitions. [2019-11-15 23:56:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:03,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-15 23:56:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:03,185 INFO L225 Difference]: With dead ends: 22200 [2019-11-15 23:56:03,185 INFO L226 Difference]: Without dead ends: 11104 [2019-11-15 23:56:03,198 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:56:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2019-11-15 23:56:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10182. [2019-11-15 23:56:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-11-15 23:56:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 11676 transitions. [2019-11-15 23:56:03,319 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 11676 transitions. Word has length 335 [2019-11-15 23:56:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:03,320 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 11676 transitions. [2019-11-15 23:56:03,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 11676 transitions. [2019-11-15 23:56:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-15 23:56:03,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:03,333 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:03,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:03,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1721381139, now seen corresponding path program 1 times [2019-11-15 23:56:03,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:03,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215897936] [2019-11-15 23:56:03,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 23:56:03,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215897936] [2019-11-15 23:56:03,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:03,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:03,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782990637] [2019-11-15 23:56:03,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:03,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:03,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:03,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:03,581 INFO L87 Difference]: Start difference. First operand 10182 states and 11676 transitions. Second operand 4 states. [2019-11-15 23:56:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:04,874 INFO L93 Difference]: Finished difference Result 20750 states and 23777 transitions. [2019-11-15 23:56:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:04,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-11-15 23:56:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:04,893 INFO L225 Difference]: With dead ends: 20750 [2019-11-15 23:56:04,893 INFO L226 Difference]: Without dead ends: 10754 [2019-11-15 23:56:04,900 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:56:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10754 states. [2019-11-15 23:56:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10754 to 10182. [2019-11-15 23:56:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-11-15 23:56:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 11490 transitions. [2019-11-15 23:56:05,119 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 11490 transitions. Word has length 336 [2019-11-15 23:56:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:05,120 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 11490 transitions. [2019-11-15 23:56:05,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 11490 transitions. [2019-11-15 23:56:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-15 23:56:05,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:05,133 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:05,134 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1682522593, now seen corresponding path program 1 times [2019-11-15 23:56:05,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:05,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446789727] [2019-11-15 23:56:05,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 46 proven. 391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:05,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446789727] [2019-11-15 23:56:05,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708844876] [2019-11-15 23:56:05,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/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:56:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:05,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:56:05,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 23:56:06,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:56:06,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 23:56:06,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65221216] [2019-11-15 23:56:06,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:06,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:06,164 INFO L87 Difference]: Start difference. First operand 10182 states and 11490 transitions. Second operand 4 states. [2019-11-15 23:56:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:07,912 INFO L93 Difference]: Finished difference Result 22762 states and 25749 transitions. [2019-11-15 23:56:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:07,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-15 23:56:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:07,925 INFO L225 Difference]: With dead ends: 22762 [2019-11-15 23:56:07,925 INFO L226 Difference]: Without dead ends: 12766 [2019-11-15 23:56:07,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12766 states. [2019-11-15 23:56:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12766 to 12024. [2019-11-15 23:56:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12024 states. [2019-11-15 23:56:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 13467 transitions. [2019-11-15 23:56:08,056 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 13467 transitions. Word has length 379 [2019-11-15 23:56:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:08,057 INFO L462 AbstractCegarLoop]: Abstraction has 12024 states and 13467 transitions. [2019-11-15 23:56:08,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 13467 transitions. [2019-11-15 23:56:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-15 23:56:08,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:08,067 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:08,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:08,270 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 732027564, now seen corresponding path program 1 times [2019-11-15 23:56:08,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:08,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905769394] [2019-11-15 23:56:08,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 23:56:08,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905769394] [2019-11-15 23:56:08,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:08,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:08,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881763636] [2019-11-15 23:56:08,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:08,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:08,532 INFO L87 Difference]: Start difference. First operand 12024 states and 13467 transitions. Second operand 4 states. [2019-11-15 23:56:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:10,166 INFO L93 Difference]: Finished difference Result 24059 states and 26951 transitions. [2019-11-15 23:56:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:10,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-15 23:56:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:10,179 INFO L225 Difference]: With dead ends: 24059 [2019-11-15 23:56:10,179 INFO L226 Difference]: Without dead ends: 12221 [2019-11-15 23:56:10,186 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:56:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12221 states. [2019-11-15 23:56:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12221 to 12024. [2019-11-15 23:56:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12024 states. [2019-11-15 23:56:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 13243 transitions. [2019-11-15 23:56:10,324 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 13243 transitions. Word has length 379 [2019-11-15 23:56:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:10,324 INFO L462 AbstractCegarLoop]: Abstraction has 12024 states and 13243 transitions. [2019-11-15 23:56:10,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 13243 transitions. [2019-11-15 23:56:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-11-15 23:56:10,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:10,335 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:56:10,335 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:10,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1821887244, now seen corresponding path program 1 times [2019-11-15 23:56:10,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:10,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568707118] [2019-11-15 23:56:10,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:10,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:10,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 443 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:10,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568707118] [2019-11-15 23:56:10,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200495899] [2019-11-15 23:56:10,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:10,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:56:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 23:56:11,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:56:11,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 23:56:11,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792703128] [2019-11-15 23:56:11,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:11,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:56:11,205 INFO L87 Difference]: Start difference. First operand 12024 states and 13243 transitions. Second operand 3 states. [2019-11-15 23:56:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:12,086 INFO L93 Difference]: Finished difference Result 24052 states and 26514 transitions. [2019-11-15 23:56:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:12,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-11-15 23:56:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:12,094 INFO L225 Difference]: With dead ends: 24052 [2019-11-15 23:56:12,094 INFO L226 Difference]: Without dead ends: 12214 [2019-11-15 23:56:12,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:56:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-11-15 23:56:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12210. [2019-11-15 23:56:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12210 states. [2019-11-15 23:56:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12210 states to 12210 states and 13440 transitions. [2019-11-15 23:56:12,220 INFO L78 Accepts]: Start accepts. Automaton has 12210 states and 13440 transitions. Word has length 384 [2019-11-15 23:56:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:12,221 INFO L462 AbstractCegarLoop]: Abstraction has 12210 states and 13440 transitions. [2019-11-15 23:56:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 12210 states and 13440 transitions. [2019-11-15 23:56:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-11-15 23:56:12,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:12,234 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:12,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:12,437 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:12,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1802628130, now seen corresponding path program 1 times [2019-11-15 23:56:12,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:12,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055623361] [2019-11-15 23:56:12,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:12,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:12,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 42 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:13,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055623361] [2019-11-15 23:56:13,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645487160] [2019-11-15 23:56:13,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:13,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:56:13,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 242 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:14,602 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:14,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2019-11-15 23:56:14,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280750673] [2019-11-15 23:56:14,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:56:14,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:56:14,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:56:14,604 INFO L87 Difference]: Start difference. First operand 12210 states and 13440 transitions. Second operand 17 states. [2019-11-15 23:56:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,378 INFO L93 Difference]: Finished difference Result 35933 states and 39469 transitions. [2019-11-15 23:56:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:56:25,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 415 [2019-11-15 23:56:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,395 INFO L225 Difference]: With dead ends: 35933 [2019-11-15 23:56:25,395 INFO L226 Difference]: Without dead ends: 23909 [2019-11-15 23:56:25,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 23:56:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23909 states. [2019-11-15 23:56:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23909 to 15154. [2019-11-15 23:56:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15154 states. [2019-11-15 23:56:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15154 states to 15154 states and 16548 transitions. [2019-11-15 23:56:25,599 INFO L78 Accepts]: Start accepts. Automaton has 15154 states and 16548 transitions. Word has length 415 [2019-11-15 23:56:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,600 INFO L462 AbstractCegarLoop]: Abstraction has 15154 states and 16548 transitions. [2019-11-15 23:56:25,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:56:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 15154 states and 16548 transitions. [2019-11-15 23:56:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-11-15 23:56:25,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,615 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-15 23:56:25,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:25,822 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash 930313157, now seen corresponding path program 1 times [2019-11-15 23:56:25,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:25,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224136896] [2019-11-15 23:56:25,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 23:56:26,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224136896] [2019-11-15 23:56:26,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:26,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:26,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589922213] [2019-11-15 23:56:26,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:26,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:26,210 INFO L87 Difference]: Start difference. First operand 15154 states and 16548 transitions. Second operand 4 states. [2019-11-15 23:56:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:27,594 INFO L93 Difference]: Finished difference Result 32532 states and 35532 transitions. [2019-11-15 23:56:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:27,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 432 [2019-11-15 23:56:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:27,608 INFO L225 Difference]: With dead ends: 32532 [2019-11-15 23:56:27,609 INFO L226 Difference]: Without dead ends: 17012 [2019-11-15 23:56:27,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17012 states. [2019-11-15 23:56:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17012 to 14974. [2019-11-15 23:56:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14974 states. [2019-11-15 23:56:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14974 states to 14974 states and 16173 transitions. [2019-11-15 23:56:27,761 INFO L78 Accepts]: Start accepts. Automaton has 14974 states and 16173 transitions. Word has length 432 [2019-11-15 23:56:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:27,762 INFO L462 AbstractCegarLoop]: Abstraction has 14974 states and 16173 transitions. [2019-11-15 23:56:27,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 14974 states and 16173 transitions. [2019-11-15 23:56:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-11-15 23:56:27,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:27,777 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:56:27,777 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash -82825745, now seen corresponding path program 1 times [2019-11-15 23:56:27,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:27,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059800071] [2019-11-15 23:56:27,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:27,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:27,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 88 proven. 723 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:29,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059800071] [2019-11-15 23:56:29,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917927753] [2019-11-15 23:56:29,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:29,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:56:29,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:29,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:29,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:29,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 543 proven. 222 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 23:56:30,430 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:30,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2019-11-15 23:56:30,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849847479] [2019-11-15 23:56:30,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:56:30,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:56:30,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:56:30,433 INFO L87 Difference]: Start difference. First operand 14974 states and 16173 transitions. Second operand 18 states. [2019-11-15 23:56:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:47,663 INFO L93 Difference]: Finished difference Result 48279 states and 52136 transitions. [2019-11-15 23:56:47,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-15 23:56:47,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 534 [2019-11-15 23:56:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:47,694 INFO L225 Difference]: With dead ends: 48279 [2019-11-15 23:56:47,695 INFO L226 Difference]: Without dead ends: 33491 [2019-11-15 23:56:47,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 529 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1289, Invalid=3541, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 23:56:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33491 states. [2019-11-15 23:56:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33491 to 13308. [2019-11-15 23:56:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13308 states. [2019-11-15 23:56:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13308 states to 13308 states and 14289 transitions. [2019-11-15 23:56:47,876 INFO L78 Accepts]: Start accepts. Automaton has 13308 states and 14289 transitions. Word has length 534 [2019-11-15 23:56:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:47,877 INFO L462 AbstractCegarLoop]: Abstraction has 13308 states and 14289 transitions. [2019-11-15 23:56:47,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:56:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 13308 states and 14289 transitions. [2019-11-15 23:56:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-11-15 23:56:47,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:47,884 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:48,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:48,086 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash 762866496, now seen corresponding path program 1 times [2019-11-15 23:56:48,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:48,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422406163] [2019-11-15 23:56:48,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:48,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:48,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 101 proven. 488 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-15 23:56:48,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422406163] [2019-11-15 23:56:48,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529723310] [2019-11-15 23:56:48,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:48,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:56:48,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 235 proven. 452 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:56:49,466 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:49,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-15 23:56:49,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970518718] [2019-11-15 23:56:49,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:56:49,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:56:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:49,468 INFO L87 Difference]: Start difference. First operand 13308 states and 14289 transitions. Second operand 8 states. [2019-11-15 23:56:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:52,075 INFO L93 Difference]: Finished difference Result 37133 states and 39785 transitions. [2019-11-15 23:56:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:56:52,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 570 [2019-11-15 23:56:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:52,091 INFO L225 Difference]: With dead ends: 37133 [2019-11-15 23:56:52,092 INFO L226 Difference]: Without dead ends: 24565 [2019-11-15 23:56:52,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:52,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24565 states. [2019-11-15 23:56:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24565 to 14600. [2019-11-15 23:56:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-11-15 23:56:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 15687 transitions. [2019-11-15 23:56:52,270 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 15687 transitions. Word has length 570 [2019-11-15 23:56:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:52,271 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 15687 transitions. [2019-11-15 23:56:52,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:56:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 15687 transitions. [2019-11-15 23:56:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-11-15 23:56:52,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:52,278 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:52,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:52,479 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1272720062, now seen corresponding path program 1 times [2019-11-15 23:56:52,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:52,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179477670] [2019-11-15 23:56:52,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:52,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:52,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 655 proven. 496 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:56:52,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179477670] [2019-11-15 23:56:52,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497926281] [2019-11-15 23:56:52,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:53,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:56:53,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:55,331 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-11-15 23:56:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 785 proven. 96 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-11-15 23:56:55,727 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:55,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-15 23:56:55,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818162556] [2019-11-15 23:56:55,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:56:55,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:55,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:56:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:56:55,729 INFO L87 Difference]: Start difference. First operand 14600 states and 15687 transitions. Second operand 12 states. [2019-11-15 23:57:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:03,376 INFO L93 Difference]: Finished difference Result 41558 states and 44483 transitions. [2019-11-15 23:57:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:57:03,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 574 [2019-11-15 23:57:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:03,396 INFO L225 Difference]: With dead ends: 41558 [2019-11-15 23:57:03,396 INFO L226 Difference]: Without dead ends: 27698 [2019-11-15 23:57:03,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:57:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27698 states. [2019-11-15 23:57:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27698 to 13114. [2019-11-15 23:57:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13114 states. [2019-11-15 23:57:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 13937 transitions. [2019-11-15 23:57:03,599 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 13937 transitions. Word has length 574 [2019-11-15 23:57:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:03,599 INFO L462 AbstractCegarLoop]: Abstraction has 13114 states and 13937 transitions. [2019-11-15 23:57:03,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:57:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 13937 transitions. [2019-11-15 23:57:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-11-15 23:57:03,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:03,611 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1] [2019-11-15 23:57:03,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:03,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1877441688, now seen corresponding path program 1 times [2019-11-15 23:57:03,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:03,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068574157] [2019-11-15 23:57:03,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:03,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:03,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 826 proven. 250 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 23:57:04,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068574157] [2019-11-15 23:57:04,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137484541] [2019-11-15 23:57:04,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:04,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:57:04,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:04,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:04,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 747 proven. 237 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 23:57:05,024 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:05,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 8 [2019-11-15 23:57:05,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689222832] [2019-11-15 23:57:05,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:57:05,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:57:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:05,026 INFO L87 Difference]: Start difference. First operand 13114 states and 13937 transitions. Second operand 8 states. [2019-11-15 23:57:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:07,874 INFO L93 Difference]: Finished difference Result 34704 states and 36826 transitions. [2019-11-15 23:57:07,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:57:07,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 641 [2019-11-15 23:57:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:07,890 INFO L225 Difference]: With dead ends: 34704 [2019-11-15 23:57:07,890 INFO L226 Difference]: Without dead ends: 18276 [2019-11-15 23:57:07,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:57:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-11-15 23:57:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11818. [2019-11-15 23:57:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11818 states. [2019-11-15 23:57:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11818 states to 11818 states and 12363 transitions. [2019-11-15 23:57:08,018 INFO L78 Accepts]: Start accepts. Automaton has 11818 states and 12363 transitions. Word has length 641 [2019-11-15 23:57:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:08,018 INFO L462 AbstractCegarLoop]: Abstraction has 11818 states and 12363 transitions. [2019-11-15 23:57:08,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:57:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 11818 states and 12363 transitions. [2019-11-15 23:57:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2019-11-15 23:57:08,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:08,032 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:08,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:08,235 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash 809804742, now seen corresponding path program 1 times [2019-11-15 23:57:08,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:08,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457389809] [2019-11-15 23:57:08,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:08,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:08,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 540 proven. 1728 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-11-15 23:57:09,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457389809] [2019-11-15 23:57:09,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721828594] [2019-11-15 23:57:09,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:10,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:57:10,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:10,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:10,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:10,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 390 proven. 1976 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-15 23:57:12,076 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:12,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 23:57:12,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543511019] [2019-11-15 23:57:12,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:57:12,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:57:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:57:12,078 INFO L87 Difference]: Start difference. First operand 11818 states and 12363 transitions. Second operand 16 states. [2019-11-15 23:57:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:20,889 INFO L93 Difference]: Finished difference Result 35827 states and 37512 transitions. [2019-11-15 23:57:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 23:57:20,891 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 982 [2019-11-15 23:57:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:20,892 INFO L225 Difference]: With dead ends: 35827 [2019-11-15 23:57:20,892 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:57:20,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 975 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 23:57:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:57:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:57:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:57:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:57:20,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 982 [2019-11-15 23:57:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:20,903 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:20,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:57:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:57:20,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:57:21,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:21,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:57:25,161 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 1157 DAG size of output: 942 [2019-11-15 23:57:29,073 WARN L191 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 1157 DAG size of output: 942 [2019-11-15 23:57:38,299 WARN L191 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 900 DAG size of output: 170 [2019-11-15 23:57:47,530 WARN L191 SmtUtils]: Spent 9.23 s on a formula simplification. DAG size of input: 900 DAG size of output: 170 [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,532 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 23:57:47,533 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse27 (+ ~a23~0 43))) (let ((.cse20 (= 12 ~a25~0)) (.cse5 (<= ~a4~0 0)) (.cse11 (<= .cse27 0)) (.cse23 (= ~a25~0 9)) (.cse2 (= 1 ~a3~0)) (.cse24 (= 1 ~a4~0))) (let ((.cse7 (<= 0 (+ ~a23~0 600262))) (.cse18 (<= 0 (+ ~a23~0 577712))) (.cse3 (<= (+ ~a23~0 127599) 0)) (.cse0 (<= 0 (+ (div (+ ~a23~0 577632) 5) 42))) (.cse9 (= ~a25~0 13)) (.cse16 (exists ((v_~a29~0_500 Int)) (let ((.cse28 (mod v_~a29~0_500 15))) (and (<= (+ .cse28 260) ~a29~0) (<= 130 v_~a29~0_500) (= 0 .cse28))))) (.cse17 (= ~a25~0 11)) (.cse25 (and .cse23 .cse2 .cse24)) (.cse22 (< 0 .cse27)) (.cse12 (<= ~a29~0 140)) (.cse13 (< 138 ~a23~0)) (.cse15 (<= 0 (+ ~a23~0 16))) (.cse21 (<= ~a23~0 247)) (.cse6 (= ~a25~0 12)) (.cse19 (exists ((v_~a29~0_505 Int)) (and (<= 0 v_~a29~0_505) (< 140 v_~a29~0_505) (<= (+ (mod v_~a29~0_505 15) 256) ~a29~0)))) (.cse1 (and .cse20 .cse5 .cse11)) (.cse8 (<= ~a29~0 277)) (.cse10 (= ~a4~0 1)) (.cse14 (= 10 ~a25~0)) (.cse4 (= 15 ~a8~0))) (or (and (and .cse0 .cse1) .cse2 .cse3 .cse4) (and .cse5 .cse4 .cse6 .cse2 .cse7 .cse8) (and (and .cse9 .cse2 .cse10 .cse4 (<= 130 ~a29~0) .cse11) .cse8) (and .cse12 .cse5 .cse2 (not .cse9) .cse7 .cse4 .cse11) (and .cse9 .cse2 .cse10 .cse4 .cse13) (and .cse10 .cse14 .cse11) (and (<= 437925 ~a23~0) .cse10 .cse4 .cse6 .cse2 (<= ~a29~0 220)) (and .cse15 (and (and .cse16 .cse2 .cse10 .cse17) .cse4)) (and .cse2 (and .cse12 .cse5 .cse14) .cse7 .cse4) (and .cse5 .cse4 .cse18 .cse17 .cse19 .cse2 .cse8 .cse11) (and (and (or (and .cse20 .cse2 .cse10 .cse8 .cse13) (and (and .cse2 .cse10 .cse17) .cse8)) (< 140 ~a29~0) .cse4) .cse18) (and .cse3 .cse4 (and .cse5 .cse16 .cse2 .cse0 .cse17)) (and .cse5 .cse4 .cse21 .cse12 (not .cse17) .cse22 .cse2) (and .cse9 .cse5 .cse4 .cse21 .cse22 .cse2) (and (or (and (and (and .cse23 .cse16 .cse24) .cse2) .cse4) (and .cse19 .cse25 (<= 0 (+ ~a23~0 599717)) .cse4)) (<= 0 (+ ~a23~0 599908))) (and .cse12 .cse23 .cse24 .cse13) (and .cse12 .cse20 .cse2 .cse10 .cse4 (exists ((v_~a23~0_472 Int)) (and (<= ~a23~0 (+ (* 4 (div (* v_~a23~0_472 (- 2)) 10)) 4)) (< 306 v_~a23~0_472) (< 0 (* 2 v_~a23~0_472)) (not (= (mod (* v_~a23~0_472 8) 10) 0))))) (and .cse2 .cse10 (<= ~a23~0 306) .cse4 .cse17 .cse13) (and (and .cse25 .cse4) .cse22) (and (and .cse2 (and .cse12 .cse20 .cse10) .cse4) .cse15 .cse21) (and .cse20 .cse2 .cse10 .cse4 .cse21 .cse13) (and .cse5 .cse15 .cse4 .cse21 .cse6 .cse2) (and (or (and .cse19 .cse1 .cse2 .cse8) (and .cse23 (exists ((v_~a29~0_503 Int)) (let ((.cse26 (mod v_~a29~0_503 299861))) (and (<= (+ .cse26 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse26)))) .cse5 .cse2 .cse11)) .cse4) (and (and .cse10 .cse14) .cse2 .cse4))))) [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,534 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,535 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,536 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:57:47,537 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,538 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,539 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 23:57:47,540 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,541 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,542 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,543 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 23:57:47,544 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,545 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:57:47,546 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 23:57:47,547 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,548 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,549 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,550 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,551 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 23:57:47,552 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:57:47,553 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,554 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 23:57:47,555 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,556 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,557 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,558 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:57:47,559 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-15 23:57:47,560 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,561 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 23:57:47,561 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:57:47,561 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 23:57:47,561 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,561 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,561 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse27 (+ ~a23~0 43))) (let ((.cse20 (= 12 ~a25~0)) (.cse5 (<= ~a4~0 0)) (.cse11 (<= .cse27 0)) (.cse23 (= ~a25~0 9)) (.cse2 (= 1 ~a3~0)) (.cse24 (= 1 ~a4~0))) (let ((.cse7 (<= 0 (+ ~a23~0 600262))) (.cse18 (<= 0 (+ ~a23~0 577712))) (.cse3 (<= (+ ~a23~0 127599) 0)) (.cse0 (<= 0 (+ (div (+ ~a23~0 577632) 5) 42))) (.cse9 (= ~a25~0 13)) (.cse16 (exists ((v_~a29~0_500 Int)) (let ((.cse28 (mod v_~a29~0_500 15))) (and (<= (+ .cse28 260) ~a29~0) (<= 130 v_~a29~0_500) (= 0 .cse28))))) (.cse17 (= ~a25~0 11)) (.cse25 (and .cse23 .cse2 .cse24)) (.cse22 (< 0 .cse27)) (.cse12 (<= ~a29~0 140)) (.cse13 (< 138 ~a23~0)) (.cse15 (<= 0 (+ ~a23~0 16))) (.cse21 (<= ~a23~0 247)) (.cse6 (= ~a25~0 12)) (.cse19 (exists ((v_~a29~0_505 Int)) (and (<= 0 v_~a29~0_505) (< 140 v_~a29~0_505) (<= (+ (mod v_~a29~0_505 15) 256) ~a29~0)))) (.cse1 (and .cse20 .cse5 .cse11)) (.cse8 (<= ~a29~0 277)) (.cse10 (= ~a4~0 1)) (.cse14 (= 10 ~a25~0)) (.cse4 (= 15 ~a8~0))) (or (and (and .cse0 .cse1) .cse2 .cse3 .cse4) (and .cse5 .cse4 .cse6 .cse2 .cse7 .cse8) (and (and .cse9 .cse2 .cse10 .cse4 (<= 130 ~a29~0) .cse11) .cse8) (and .cse12 .cse5 .cse2 (not .cse9) .cse7 .cse4 .cse11) (and .cse9 .cse2 .cse10 .cse4 .cse13) (and .cse10 .cse14 .cse11) (and (<= 437925 ~a23~0) .cse10 .cse4 .cse6 .cse2 (<= ~a29~0 220)) (and .cse15 (and (and .cse16 .cse2 .cse10 .cse17) .cse4)) (and .cse2 (and .cse12 .cse5 .cse14) .cse7 .cse4) (and .cse5 .cse4 .cse18 .cse17 .cse19 .cse2 .cse8 .cse11) (and (and (or (and .cse20 .cse2 .cse10 .cse8 .cse13) (and (and .cse2 .cse10 .cse17) .cse8)) (< 140 ~a29~0) .cse4) .cse18) (and .cse3 .cse4 (and .cse5 .cse16 .cse2 .cse0 .cse17)) (and .cse5 .cse4 .cse21 .cse12 (not .cse17) .cse22 .cse2) (and .cse9 .cse5 .cse4 .cse21 .cse22 .cse2) (and (or (and (and (and .cse23 .cse16 .cse24) .cse2) .cse4) (and .cse19 .cse25 (<= 0 (+ ~a23~0 599717)) .cse4)) (<= 0 (+ ~a23~0 599908))) (and .cse12 .cse23 .cse24 .cse13) (and .cse12 .cse20 .cse2 .cse10 .cse4 (exists ((v_~a23~0_472 Int)) (and (<= ~a23~0 (+ (* 4 (div (* v_~a23~0_472 (- 2)) 10)) 4)) (< 306 v_~a23~0_472) (< 0 (* 2 v_~a23~0_472)) (not (= (mod (* v_~a23~0_472 8) 10) 0))))) (and .cse2 .cse10 (<= ~a23~0 306) .cse4 .cse17 .cse13) (and (and .cse25 .cse4) .cse22) (and (and .cse2 (and .cse12 .cse20 .cse10) .cse4) .cse15 .cse21) (and .cse20 .cse2 .cse10 .cse4 .cse21 .cse13) (and .cse5 .cse15 .cse4 .cse21 .cse6 .cse2) (and (or (and .cse19 .cse1 .cse2 .cse8) (and .cse23 (exists ((v_~a29~0_503 Int)) (let ((.cse26 (mod v_~a29~0_503 299861))) (and (<= (+ .cse26 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse26)))) .cse5 .cse2 .cse11)) .cse4) (and (and .cse10 .cse14) .cse2 .cse4))))) [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,562 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:57:47,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:57:47 BoogieIcfgContainer [2019-11-15 23:57:47,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:57:47,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:47,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:47,634 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:47,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:22" (3/4) ... [2019-11-15 23:57:47,637 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:57:47,661 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:57:47,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:57:47,691 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) [2019-11-15 23:57:47,694 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) [2019-11-15 23:57:47,814 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e43c73d3-6006-48b5-8a91-5b439746897d/bin/uautomizer/witness.graphml [2019-11-15 23:57:47,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:47,816 INFO L168 Benchmark]: Toolchain (without parser) took 148131.53 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 939.4 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 23:57:47,816 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:47,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:47,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:47,817 INFO L168 Benchmark]: Boogie Preprocessor took 133.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:47,817 INFO L168 Benchmark]: RCFGBuilder took 2029.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.1 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:57:47,818 INFO L168 Benchmark]: TraceAbstraction took 144767.86 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 902.1 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:57:47,818 INFO L168 Benchmark]: Witness Printer took 181.48 ms. Allocated memory is still 4.3 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:47,820 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 867.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 147.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2029.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144767.86 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 902.1 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 181.48 ms. Allocated memory is still 4.3 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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:57:47,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 23:57:47,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-15 23:57:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 23:57:47,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-15 23:57:47,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-15 23:57:47,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 144.6s, OverallIterations: 22, TraceHistogramMax: 8, AutomataDifference: 90.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.4s, HoareTripleCheckerStatistics: 3590 SDtfs, 30562 SDslu, 1761 SDs, 0 SdLazy, 69913 SolverSat, 7909 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 72.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5594 GetRequests, 5343 SyntacticMatches, 8 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15154occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 68552 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 348 NumberOfFragments, 1423 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13051324 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7411496 FormulaSimplificationTreeSizeReductionInter, 18.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 13523 NumberOfCodeBlocks, 13523 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 13490 ConstructedInterpolants, 564 QuantifiedInterpolants, 40342360 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6925 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 12360/20429 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...