./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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 6a0026f8c6b7a380d23358cfd36c0fa51e5f8b48 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:26:30,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:30,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:30,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:30,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:30,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:30,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:30,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:30,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:30,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:30,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:30,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:30,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:30,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:30,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:30,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:30,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:30,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:30,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:30,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:30,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:30,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:30,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:30,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:30,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:30,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:30,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:30,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:30,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:30,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:30,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:30,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:30,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:30,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:30,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:30,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:30,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:30,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:30,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:30,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:30,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:30,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:26:30,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:30,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:30,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:30,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:30,768 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:30,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:30,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:30,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:30,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:30,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:30,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:26:30,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:30,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:26:30,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:30,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:30,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:30,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:26:30,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:30,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:30,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:30,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:30,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:30,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:30,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:30,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:26:30,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:26:30,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:26:30,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:26:30,774 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_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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 -> 6a0026f8c6b7a380d23358cfd36c0fa51e5f8b48 [2019-11-16 00:26:30,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:30,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:30,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:30,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:30,845 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:30,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label11.c [2019-11-16 00:26:30,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/data/1e1e1f65f/b49b3b545a3e4cabb037f2a32957b63f/FLAG71a1ab2d5 [2019-11-16 00:26:31,570 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:31,570 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/sv-benchmarks/c/eca-rers2012/Problem16_label11.c [2019-11-16 00:26:31,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/data/1e1e1f65f/b49b3b545a3e4cabb037f2a32957b63f/FLAG71a1ab2d5 [2019-11-16 00:26:31,668 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/data/1e1e1f65f/b49b3b545a3e4cabb037f2a32957b63f [2019-11-16 00:26:31,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:31,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:26:31,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:31,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:31,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:31,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:31" (1/1) ... [2019-11-16 00:26:31,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faf513d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:31, skipping insertion in model container [2019-11-16 00:26:31,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:31" (1/1) ... [2019-11-16 00:26:31,695 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:31,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:32,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:32,606 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:32,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:32,885 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:32,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32 WrapperNode [2019-11-16 00:26:32,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:32,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:32,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:26:32,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:26:32,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:32,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:33,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:33,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:33,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:33,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... [2019-11-16 00:26:33,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:33,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:33,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:33,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:33,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:36,150 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:36,151 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:26:36,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:36 BoogieIcfgContainer [2019-11-16 00:26:36,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:36,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:26:36,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:26:36,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:26:36,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:31" (1/3) ... [2019-11-16 00:26:36,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd96b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:36, skipping insertion in model container [2019-11-16 00:26:36,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:32" (2/3) ... [2019-11-16 00:26:36,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd96b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:36, skipping insertion in model container [2019-11-16 00:26:36,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:36" (3/3) ... [2019-11-16 00:26:36,160 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label11.c [2019-11-16 00:26:36,171 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:26:36,180 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:26:36,192 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:26:36,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:26:36,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:26:36,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:26:36,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:36,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:36,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:26:36,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:36,242 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:26:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-16 00:26:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:26:36,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:36,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:36,293 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2019-11-16 00:26:36,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:36,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926880898] [2019-11-16 00:26:36,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:36,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:36,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:36,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926880898] [2019-11-16 00:26:36,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:36,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:36,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366783240] [2019-11-16 00:26:36,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:36,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:36,730 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-11-16 00:26:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:40,557 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-11-16 00:26:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:40,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:26:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:40,588 INFO L225 Difference]: With dead ends: 1454 [2019-11-16 00:26:40,588 INFO L226 Difference]: Without dead ends: 991 [2019-11-16 00:26:40,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-16 00:26:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-16 00:26:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-16 00:26:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1567 transitions. [2019-11-16 00:26:40,708 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1567 transitions. Word has length 55 [2019-11-16 00:26:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:40,708 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1567 transitions. [2019-11-16 00:26:40,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1567 transitions. [2019-11-16 00:26:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-16 00:26:40,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:40,723 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:40,723 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash -307424911, now seen corresponding path program 1 times [2019-11-16 00:26:40,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:40,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093227554] [2019-11-16 00:26:40,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:41,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093227554] [2019-11-16 00:26:41,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:41,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:26:41,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466127218] [2019-11-16 00:26:41,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:26:41,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:26:41,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:41,479 INFO L87 Difference]: Start difference. First operand 991 states and 1567 transitions. Second operand 7 states. [2019-11-16 00:26:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:44,763 INFO L93 Difference]: Finished difference Result 2320 states and 3550 transitions. [2019-11-16 00:26:44,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:26:44,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2019-11-16 00:26:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:44,775 INFO L225 Difference]: With dead ends: 2320 [2019-11-16 00:26:44,776 INFO L226 Difference]: Without dead ends: 1331 [2019-11-16 00:26:44,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-11-16 00:26:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1320. [2019-11-16 00:26:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-11-16 00:26:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1902 transitions. [2019-11-16 00:26:44,837 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1902 transitions. Word has length 186 [2019-11-16 00:26:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:44,841 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1902 transitions. [2019-11-16 00:26:44,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:26:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1902 transitions. [2019-11-16 00:26:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-16 00:26:44,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:44,861 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:44,861 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 631169663, now seen corresponding path program 1 times [2019-11-16 00:26:44,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:44,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951910789] [2019-11-16 00:26:44,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:44,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:44,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:45,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951910789] [2019-11-16 00:26:45,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:45,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:45,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970924973] [2019-11-16 00:26:45,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:45,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:45,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:45,192 INFO L87 Difference]: Start difference. First operand 1320 states and 1902 transitions. Second operand 3 states. [2019-11-16 00:26:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:47,033 INFO L93 Difference]: Finished difference Result 3296 states and 5031 transitions. [2019-11-16 00:26:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:47,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-11-16 00:26:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:47,069 INFO L225 Difference]: With dead ends: 3296 [2019-11-16 00:26:47,069 INFO L226 Difference]: Without dead ends: 2307 [2019-11-16 00:26:47,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-16 00:26:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-16 00:26:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-16 00:26:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3034 transitions. [2019-11-16 00:26:47,130 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3034 transitions. Word has length 273 [2019-11-16 00:26:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:47,131 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3034 transitions. [2019-11-16 00:26:47,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3034 transitions. [2019-11-16 00:26:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-16 00:26:47,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:47,139 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:47,139 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:47,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash 21087107, now seen corresponding path program 1 times [2019-11-16 00:26:47,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:47,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172486729] [2019-11-16 00:26:47,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:47,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:47,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:26:47,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172486729] [2019-11-16 00:26:47,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:47,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:47,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453419836] [2019-11-16 00:26:47,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:47,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:47,410 INFO L87 Difference]: Start difference. First operand 2307 states and 3034 transitions. Second operand 3 states. [2019-11-16 00:26:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:49,115 INFO L93 Difference]: Finished difference Result 6257 states and 8427 transitions. [2019-11-16 00:26:49,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:49,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-16 00:26:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:49,139 INFO L225 Difference]: With dead ends: 6257 [2019-11-16 00:26:49,139 INFO L226 Difference]: Without dead ends: 3623 [2019-11-16 00:26:49,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2019-11-16 00:26:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2019-11-16 00:26:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2019-11-16 00:26:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3964 transitions. [2019-11-16 00:26:49,237 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3964 transitions. Word has length 315 [2019-11-16 00:26:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:49,238 INFO L462 AbstractCegarLoop]: Abstraction has 3623 states and 3964 transitions. [2019-11-16 00:26:49,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3964 transitions. [2019-11-16 00:26:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-11-16 00:26:49,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:49,245 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:49,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1477368184, now seen corresponding path program 1 times [2019-11-16 00:26:49,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:49,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113505715] [2019-11-16 00:26:49,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:49,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:49,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:50,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113505715] [2019-11-16 00:26:50,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144651324] [2019-11-16 00:26:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:50,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:26:50,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-16 00:26:50,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:50,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-16 00:26:50,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890581015] [2019-11-16 00:26:50,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:50,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:26:50,890 INFO L87 Difference]: Start difference. First operand 3623 states and 3964 transitions. Second operand 3 states. [2019-11-16 00:26:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:52,345 INFO L93 Difference]: Finished difference Result 7902 states and 8658 transitions. [2019-11-16 00:26:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:52,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2019-11-16 00:26:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:52,374 INFO L225 Difference]: With dead ends: 7902 [2019-11-16 00:26:52,374 INFO L226 Difference]: Without dead ends: 4610 [2019-11-16 00:26:52,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:26:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2019-11-16 00:26:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2019-11-16 00:26:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2019-11-16 00:26:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4939 transitions. [2019-11-16 00:26:52,493 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4939 transitions. Word has length 355 [2019-11-16 00:26:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:52,494 INFO L462 AbstractCegarLoop]: Abstraction has 4610 states and 4939 transitions. [2019-11-16 00:26:52,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4939 transitions. [2019-11-16 00:26:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-11-16 00:26:52,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:52,507 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:52,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:52,714 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:52,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1073728449, now seen corresponding path program 1 times [2019-11-16 00:26:52,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:52,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305573962] [2019-11-16 00:26:52,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:52,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:52,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 234 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-16 00:26:53,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305573962] [2019-11-16 00:26:53,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944278268] [2019-11-16 00:26:53,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:53,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:26:53,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-16 00:26:53,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:53,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:26:53,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834868760] [2019-11-16 00:26:53,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:53,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:26:53,685 INFO L87 Difference]: Start difference. First operand 4610 states and 4939 transitions. Second operand 3 states. [2019-11-16 00:26:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:55,042 INFO L93 Difference]: Finished difference Result 8889 states and 9545 transitions. [2019-11-16 00:26:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:55,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-11-16 00:26:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:55,072 INFO L225 Difference]: With dead ends: 8889 [2019-11-16 00:26:55,073 INFO L226 Difference]: Without dead ends: 4610 [2019-11-16 00:26:55,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:26:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2019-11-16 00:26:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2019-11-16 00:26:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2019-11-16 00:26:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4910 transitions. [2019-11-16 00:26:55,348 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4910 transitions. Word has length 480 [2019-11-16 00:26:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:55,349 INFO L462 AbstractCegarLoop]: Abstraction has 4610 states and 4910 transitions. [2019-11-16 00:26:55,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4910 transitions. [2019-11-16 00:26:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-11-16 00:26:55,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:55,362 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:26:55,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:55,576 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -86315415, now seen corresponding path program 1 times [2019-11-16 00:26:55,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:55,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178863771] [2019-11-16 00:26:55,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:55,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:55,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-11-16 00:26:56,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178863771] [2019-11-16 00:26:56,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109929328] [2019-11-16 00:26:56,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:26:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:56,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:26:56,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:56,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-16 00:26:57,514 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:57,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-16 00:26:57,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012590814] [2019-11-16 00:26:57,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:26:57,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:26:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:57,516 INFO L87 Difference]: Start difference. First operand 4610 states and 4910 transitions. Second operand 8 states. [2019-11-16 00:27:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:00,119 INFO L93 Difference]: Finished difference Result 9547 states and 10168 transitions. [2019-11-16 00:27:00,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:27:00,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 509 [2019-11-16 00:27:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:00,148 INFO L225 Difference]: With dead ends: 9547 [2019-11-16 00:27:00,148 INFO L226 Difference]: Without dead ends: 5268 [2019-11-16 00:27:00,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2019-11-16 00:27:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 4610. [2019-11-16 00:27:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2019-11-16 00:27:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4874 transitions. [2019-11-16 00:27:00,279 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4874 transitions. Word has length 509 [2019-11-16 00:27:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:00,280 INFO L462 AbstractCegarLoop]: Abstraction has 4610 states and 4874 transitions. [2019-11-16 00:27:00,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:27:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4874 transitions. [2019-11-16 00:27:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-11-16 00:27:00,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:00,309 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:00,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:00,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:00,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151622, now seen corresponding path program 1 times [2019-11-16 00:27:00,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:00,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887221535] [2019-11-16 00:27:00,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:00,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:00,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 752 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-16 00:27:01,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887221535] [2019-11-16 00:27:01,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:01,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:27:01,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658020532] [2019-11-16 00:27:01,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:01,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:01,272 INFO L87 Difference]: Start difference. First operand 4610 states and 4874 transitions. Second operand 4 states. [2019-11-16 00:27:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:03,114 INFO L93 Difference]: Finished difference Result 11521 states and 12255 transitions. [2019-11-16 00:27:03,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:03,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 664 [2019-11-16 00:27:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:03,154 INFO L225 Difference]: With dead ends: 11521 [2019-11-16 00:27:03,155 INFO L226 Difference]: Without dead ends: 7242 [2019-11-16 00:27:03,161 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-16 00:27:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2019-11-16 00:27:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 6913. [2019-11-16 00:27:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2019-11-16 00:27:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7262 transitions. [2019-11-16 00:27:03,284 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7262 transitions. Word has length 664 [2019-11-16 00:27:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:03,285 INFO L462 AbstractCegarLoop]: Abstraction has 6913 states and 7262 transitions. [2019-11-16 00:27:03,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7262 transitions. [2019-11-16 00:27:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-11-16 00:27:03,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:03,299 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:03,299 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash 429370668, now seen corresponding path program 1 times [2019-11-16 00:27:03,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:03,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247789841] [2019-11-16 00:27:03,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:03,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:03,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 931 proven. 130 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-16 00:27:05,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247789841] [2019-11-16 00:27:05,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731125345] [2019-11-16 00:27:05,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:05,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:05,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 676 proven. 0 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2019-11-16 00:27:06,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:06,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-16 00:27:06,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279439743] [2019-11-16 00:27:06,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:06,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:06,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:06,085 INFO L87 Difference]: Start difference. First operand 6913 states and 7262 transitions. Second operand 3 states. [2019-11-16 00:27:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:07,364 INFO L93 Difference]: Finished difference Result 13495 states and 14191 transitions. [2019-11-16 00:27:07,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:07,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2019-11-16 00:27:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:07,401 INFO L225 Difference]: With dead ends: 13495 [2019-11-16 00:27:07,401 INFO L226 Difference]: Without dead ends: 6913 [2019-11-16 00:27:07,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 758 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2019-11-16 00:27:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6913. [2019-11-16 00:27:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2019-11-16 00:27:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7214 transitions. [2019-11-16 00:27:07,511 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7214 transitions. Word has length 758 [2019-11-16 00:27:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:07,513 INFO L462 AbstractCegarLoop]: Abstraction has 6913 states and 7214 transitions. [2019-11-16 00:27:07,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7214 transitions. [2019-11-16 00:27:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2019-11-16 00:27:07,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:07,532 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:07,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:07,747 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash 974388700, now seen corresponding path program 1 times [2019-11-16 00:27:07,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:07,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029064403] [2019-11-16 00:27:07,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:07,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:07,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 1261 proven. 130 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-11-16 00:27:09,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029064403] [2019-11-16 00:27:09,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055124290] [2019-11-16 00:27:09,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:09,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2019-11-16 00:27:10,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:10,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-16 00:27:10,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919604564] [2019-11-16 00:27:10,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:10,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:10,619 INFO L87 Difference]: Start difference. First operand 6913 states and 7214 transitions. Second operand 3 states. [2019-11-16 00:27:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:11,681 INFO L93 Difference]: Finished difference Result 15469 states and 16159 transitions. [2019-11-16 00:27:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:11,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 920 [2019-11-16 00:27:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:11,694 INFO L225 Difference]: With dead ends: 15469 [2019-11-16 00:27:11,694 INFO L226 Difference]: Without dead ends: 7571 [2019-11-16 00:27:11,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 929 GetRequests, 920 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-16 00:27:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-16 00:27:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-16 00:27:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7840 transitions. [2019-11-16 00:27:11,792 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7840 transitions. Word has length 920 [2019-11-16 00:27:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:11,793 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 7840 transitions. [2019-11-16 00:27:11,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7840 transitions. [2019-11-16 00:27:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2019-11-16 00:27:11,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:11,813 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, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:12,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:12,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1003912974, now seen corresponding path program 1 times [2019-11-16 00:27:12,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:12,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712026788] [2019-11-16 00:27:12,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:12,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:12,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 1659 proven. 130 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-11-16 00:27:14,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712026788] [2019-11-16 00:27:14,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25863187] [2019-11-16 00:27:14,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:14,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 1193 proven. 0 refuted. 0 times theorem prover too weak. 1610 trivial. 0 not checked. [2019-11-16 00:27:15,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:15,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-16 00:27:15,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91358170] [2019-11-16 00:27:15,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:15,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:15,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:15,064 INFO L87 Difference]: Start difference. First operand 7571 states and 7840 transitions. Second operand 3 states. [2019-11-16 00:27:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:16,030 INFO L93 Difference]: Finished difference Result 14811 states and 15347 transitions. [2019-11-16 00:27:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:16,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1131 [2019-11-16 00:27:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:16,044 INFO L225 Difference]: With dead ends: 14811 [2019-11-16 00:27:16,044 INFO L226 Difference]: Without dead ends: 7571 [2019-11-16 00:27:16,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 1131 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-16 00:27:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-16 00:27:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-16 00:27:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7790 transitions. [2019-11-16 00:27:16,151 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7790 transitions. Word has length 1131 [2019-11-16 00:27:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:16,152 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 7790 transitions. [2019-11-16 00:27:16,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7790 transitions. [2019-11-16 00:27:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460 [2019-11-16 00:27:16,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:16,184 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:16,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:16,389 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash 481614819, now seen corresponding path program 1 times [2019-11-16 00:27:16,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:16,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508478102] [2019-11-16 00:27:16,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:16,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:16,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3931 backedges. 2081 proven. 130 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2019-11-16 00:27:18,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508478102] [2019-11-16 00:27:18,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934662506] [2019-11-16 00:27:18,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:19,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:27:19,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3931 backedges. 1845 proven. 0 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2019-11-16 00:27:20,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:20,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-16 00:27:20,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213185693] [2019-11-16 00:27:20,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:20,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:20,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:20,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:20,700 INFO L87 Difference]: Start difference. First operand 7571 states and 7790 transitions. Second operand 3 states. [2019-11-16 00:27:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:21,787 INFO L93 Difference]: Finished difference Result 16456 states and 16943 transitions. [2019-11-16 00:27:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:21,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1459 [2019-11-16 00:27:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:21,800 INFO L225 Difference]: With dead ends: 16456 [2019-11-16 00:27:21,800 INFO L226 Difference]: Without dead ends: 9216 [2019-11-16 00:27:21,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1468 GetRequests, 1459 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-11-16 00:27:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2019-11-16 00:27:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9216 states. [2019-11-16 00:27:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9452 transitions. [2019-11-16 00:27:21,926 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9452 transitions. Word has length 1459 [2019-11-16 00:27:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:21,927 INFO L462 AbstractCegarLoop]: Abstraction has 9216 states and 9452 transitions. [2019-11-16 00:27:21,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9452 transitions. [2019-11-16 00:27:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1845 [2019-11-16 00:27:21,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:21,972 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:22,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:22,186 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -524306115, now seen corresponding path program 1 times [2019-11-16 00:27:22,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:22,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812897478] [2019-11-16 00:27:22,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:22,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5620 backedges. 3862 proven. 0 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [2019-11-16 00:27:26,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812897478] [2019-11-16 00:27:26,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:26,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:27:26,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025211040] [2019-11-16 00:27:26,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:27:26,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:26,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:27:26,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:26,238 INFO L87 Difference]: Start difference. First operand 9216 states and 9452 transitions. Second operand 6 states. [2019-11-16 00:27:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:28,432 INFO L93 Difference]: Finished difference Result 18771 states and 19262 transitions. [2019-11-16 00:27:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:28,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1844 [2019-11-16 00:27:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:28,445 INFO L225 Difference]: With dead ends: 18771 [2019-11-16 00:27:28,445 INFO L226 Difference]: Without dead ends: 9886 [2019-11-16 00:27:28,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2019-11-16 00:27:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 9874. [2019-11-16 00:27:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-11-16 00:27:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10123 transitions. [2019-11-16 00:27:28,583 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10123 transitions. Word has length 1844 [2019-11-16 00:27:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:28,585 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 10123 transitions. [2019-11-16 00:27:28,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:27:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10123 transitions. [2019-11-16 00:27:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1931 [2019-11-16 00:27:28,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:28,643 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:28,644 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1614570132, now seen corresponding path program 1 times [2019-11-16 00:27:28,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:28,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808198071] [2019-11-16 00:27:28,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:28,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:28,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6203 backedges. 4674 proven. 385 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2019-11-16 00:27:33,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808198071] [2019-11-16 00:27:33,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66209436] [2019-11-16 00:27:33,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:34,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 2204 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:27:34,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6203 backedges. 3851 proven. 0 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-11-16 00:27:36,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:36,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-16 00:27:36,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280846194] [2019-11-16 00:27:36,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:36,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:36,117 INFO L87 Difference]: Start difference. First operand 9874 states and 10123 transitions. Second operand 3 states. [2019-11-16 00:27:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:37,231 INFO L93 Difference]: Finished difference Result 19746 states and 20250 transitions. [2019-11-16 00:27:37,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:37,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1930 [2019-11-16 00:27:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:37,245 INFO L225 Difference]: With dead ends: 19746 [2019-11-16 00:27:37,245 INFO L226 Difference]: Without dead ends: 10203 [2019-11-16 00:27:37,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1937 GetRequests, 1930 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2019-11-16 00:27:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 9874. [2019-11-16 00:27:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-11-16 00:27:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10091 transitions. [2019-11-16 00:27:37,377 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10091 transitions. Word has length 1930 [2019-11-16 00:27:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:37,378 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 10091 transitions. [2019-11-16 00:27:37,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10091 transitions. [2019-11-16 00:27:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2024 [2019-11-16 00:27:37,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:37,424 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:37,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:37,637 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1477308186, now seen corresponding path program 1 times [2019-11-16 00:27:37,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:37,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795349415] [2019-11-16 00:27:37,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:37,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:37,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7932 backedges. 2100 proven. 0 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2019-11-16 00:27:41,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795349415] [2019-11-16 00:27:41,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:41,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:41,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594676219] [2019-11-16 00:27:41,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:41,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:41,341 INFO L87 Difference]: Start difference. First operand 9874 states and 10091 transitions. Second operand 3 states. [2019-11-16 00:27:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:42,480 INFO L93 Difference]: Finished difference Result 23694 states and 24249 transitions. [2019-11-16 00:27:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:42,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2023 [2019-11-16 00:27:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:42,495 INFO L225 Difference]: With dead ends: 23694 [2019-11-16 00:27:42,495 INFO L226 Difference]: Without dead ends: 14151 [2019-11-16 00:27:42,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2019-11-16 00:27:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13164. [2019-11-16 00:27:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-11-16 00:27:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13435 transitions. [2019-11-16 00:27:42,674 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13435 transitions. Word has length 2023 [2019-11-16 00:27:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:42,676 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 13435 transitions. [2019-11-16 00:27:42,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13435 transitions. [2019-11-16 00:27:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2133 [2019-11-16 00:27:42,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:42,727 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2019-11-16 00:27:42,727 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -497879742, now seen corresponding path program 1 times [2019-11-16 00:27:42,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:42,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088786637] [2019-11-16 00:27:42,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8468 backedges. 3267 proven. 243 refuted. 0 times theorem prover too weak. 4958 trivial. 0 not checked. [2019-11-16 00:27:47,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088786637] [2019-11-16 00:27:47,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996485978] [2019-11-16 00:27:47,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:47,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:27:47,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8468 backedges. 3160 proven. 0 refuted. 0 times theorem prover too weak. 5308 trivial. 0 not checked. [2019-11-16 00:27:51,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:51,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-16 00:27:51,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476429821] [2019-11-16 00:27:51,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:51,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:51,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:51,624 INFO L87 Difference]: Start difference. First operand 13164 states and 13435 transitions. Second operand 3 states. [2019-11-16 00:27:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:52,739 INFO L93 Difference]: Finished difference Result 25997 states and 26537 transitions. [2019-11-16 00:27:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:52,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2132 [2019-11-16 00:27:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:52,751 INFO L225 Difference]: With dead ends: 25997 [2019-11-16 00:27:52,752 INFO L226 Difference]: Without dead ends: 13164 [2019-11-16 00:27:52,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2138 GetRequests, 2132 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-11-16 00:27:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2019-11-16 00:27:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-11-16 00:27:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13434 transitions. [2019-11-16 00:27:52,919 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13434 transitions. Word has length 2132 [2019-11-16 00:27:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:52,920 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 13434 transitions. [2019-11-16 00:27:52,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13434 transitions. [2019-11-16 00:27:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2224 [2019-11-16 00:27:52,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:52,963 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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] [2019-11-16 00:27:53,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:53,169 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1125289394, now seen corresponding path program 1 times [2019-11-16 00:27:53,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:53,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950199479] [2019-11-16 00:27:53,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:53,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:53,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9638 backedges. 6222 proven. 319 refuted. 0 times theorem prover too weak. 3097 trivial. 0 not checked. [2019-11-16 00:27:57,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950199479] [2019-11-16 00:27:57,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354179324] [2019-11-16 00:27:57,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:27:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:58,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 2561 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:27:58,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9638 backedges. 5536 proven. 0 refuted. 0 times theorem prover too weak. 4102 trivial. 0 not checked. [2019-11-16 00:28:00,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:00,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:28:00,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280379666] [2019-11-16 00:28:00,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:00,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:00,902 INFO L87 Difference]: Start difference. First operand 13164 states and 13434 transitions. Second operand 3 states. [2019-11-16 00:28:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:02,056 INFO L93 Difference]: Finished difference Result 26655 states and 27204 transitions. [2019-11-16 00:28:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:02,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2223 [2019-11-16 00:28:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:02,067 INFO L225 Difference]: With dead ends: 26655 [2019-11-16 00:28:02,067 INFO L226 Difference]: Without dead ends: 13822 [2019-11-16 00:28:02,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2237 GetRequests, 2225 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2019-11-16 00:28:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2019-11-16 00:28:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-11-16 00:28:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13433 transitions. [2019-11-16 00:28:02,231 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13433 transitions. Word has length 2223 [2019-11-16 00:28:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:02,232 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 13433 transitions. [2019-11-16 00:28:02,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13433 transitions. [2019-11-16 00:28:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2437 [2019-11-16 00:28:02,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:02,276 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:02,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:02,477 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash -461976213, now seen corresponding path program 1 times [2019-11-16 00:28:02,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:02,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991307851] [2019-11-16 00:28:02,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:02,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:02,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10990 backedges. 3315 proven. 4267 refuted. 0 times theorem prover too weak. 3408 trivial. 0 not checked. [2019-11-16 00:28:12,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991307851] [2019-11-16 00:28:12,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116461575] [2019-11-16 00:28:12,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/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-16 00:28:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:13,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 2774 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:28:13,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:13,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:13,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10990 backedges. 5697 proven. 0 refuted. 0 times theorem prover too weak. 5293 trivial. 0 not checked. [2019-11-16 00:28:17,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:17,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-16 00:28:17,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91317182] [2019-11-16 00:28:17,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:17,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:17,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:28:17,965 INFO L87 Difference]: Start difference. First operand 13164 states and 13433 transitions. Second operand 3 states. [2019-11-16 00:28:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:19,647 INFO L93 Difference]: Finished difference Result 28627 states and 29224 transitions. [2019-11-16 00:28:19,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:19,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2436 [2019-11-16 00:28:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:19,649 INFO L225 Difference]: With dead ends: 28627 [2019-11-16 00:28:19,649 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:28:19,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2457 GetRequests, 2437 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:28:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:28:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:28:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:28:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:28:19,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2436 [2019-11-16 00:28:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:19,661 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:19,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:28:19,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:28:19,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:19,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:28:20,001 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 115 [2019-11-16 00:28:20,183 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 114 [2019-11-16 00:28:20,913 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-11-16 00:28:21,509 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-11-16 00:28:22,071 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2019-11-16 00:28:22,073 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,073 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,073 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,073 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,073 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,073 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:28:22,074 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:28:22,075 INFO L439 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse12 (= ~a16~0 8))) (let ((.cse1 (= ~a12~0 5)) (.cse8 (exists ((v_~a18~0_901 Int)) (let ((.cse14 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse13 (* 5 .cse14))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse13) (<= (div (* .cse14 5) 5) ~a18~0) (<= 0 .cse13)))))) (.cse0 (= 3 ~a15~0)) (.cse10 (<= ~a16~0 11)) (.cse2 (not .cse12)) (.cse11 (= 5 ~a12~0)) (.cse4 (+ ~a18~0 79)) (.cse5 (<= 4 ~a15~0)) (.cse6 (<= ~a18~0 134)) (.cse7 (<= ~a16~0 9)) (.cse9 (not (= ~a12~0 8))) (.cse3 (<= 6 ~a12~0))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (and (or (<= (+ ~a18~0 156) 0) (< 0 .cse4)) .cse5 .cse6 .cse7 .cse3) (and .cse5 .cse7 .cse8 .cse9 .cse3) (and .cse10 .cse2 .cse5 .cse11 .cse8) (and .cse10 .cse5 (= ~a12~0 6)) (and .cse12 .cse0 .cse9) (and (= ~a15~0 4) .cse12 .cse1) (and .cse0 .cse8 .cse3) (and .cse2 .cse5 .cse7 .cse3) (and .cse2 .cse7 .cse0) (and .cse10 .cse2 .cse5 .cse11 (<= .cse4 0)) (and .cse5 .cse6 .cse7 .cse9 .cse3)))) [2019-11-16 00:28:22,075 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,075 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,075 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,075 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,076 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,077 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,078 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,079 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,080 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:28:22,081 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,081 INFO L439 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse12 (= ~a16~0 8))) (let ((.cse10 (exists ((v_~a18~0_901 Int)) (let ((.cse14 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse13 (* 5 .cse14))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse13) (<= (div (* .cse14 5) 5) ~a18~0) (<= 0 .cse13)))))) (.cse1 (= ~a12~0 5)) (.cse0 (= 3 ~a15~0)) (.cse8 (<= ~a16~0 11)) (.cse2 (not .cse12)) (.cse9 (= 5 ~a12~0)) (.cse4 (+ ~a18~0 79)) (.cse5 (<= 4 ~a15~0)) (.cse6 (<= ~a18~0 134)) (.cse7 (<= ~a16~0 9)) (.cse11 (not (= ~a12~0 8))) (.cse3 (<= 6 ~a12~0))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (and (or (<= (+ ~a18~0 156) 0) (< 0 .cse4)) .cse5 .cse6 .cse7 .cse3) (and .cse8 .cse2 .cse5 .cse9 .cse10) (and .cse5 .cse7 .cse10 .cse11 .cse3) (and .cse8 .cse5 (= ~a12~0 6)) (and .cse12 .cse0 .cse11) (and .cse0 .cse10 .cse3) (and (= ~a15~0 4) .cse12 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse6) .cse1) (and .cse2 .cse5 .cse7 .cse3) (and .cse2 .cse7 .cse0) (and .cse8 .cse2 .cse5 .cse9 (<= .cse4 0)) (and .cse5 .cse6 .cse7 .cse11 .cse3)))) [2019-11-16 00:28:22,081 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,081 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,081 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,081 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,081 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,082 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L446 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,083 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,084 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:28:22,085 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,085 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,085 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,085 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,087 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,088 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,088 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,088 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,088 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,088 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,089 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,089 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,089 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,089 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,089 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,089 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,090 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:28:22,090 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:28:22,090 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:28:22,090 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse12 (= ~a16~0 8))) (let ((.cse1 (= ~a12~0 5)) (.cse8 (exists ((v_~a18~0_901 Int)) (let ((.cse14 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse13 (* 5 .cse14))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse13) (<= (div (* .cse14 5) 5) ~a18~0) (<= 0 .cse13)))))) (.cse0 (= 3 ~a15~0)) (.cse10 (<= ~a16~0 11)) (.cse2 (not .cse12)) (.cse11 (= 5 ~a12~0)) (.cse4 (+ ~a18~0 79)) (.cse5 (<= 4 ~a15~0)) (.cse6 (<= ~a18~0 134)) (.cse7 (<= ~a16~0 9)) (.cse9 (not (= ~a12~0 8))) (.cse3 (<= 6 ~a12~0))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (and (or (<= (+ ~a18~0 156) 0) (< 0 .cse4)) .cse5 .cse6 .cse7 .cse3) (and .cse5 .cse7 .cse8 .cse9 .cse3) (and .cse10 .cse2 .cse5 .cse11 .cse8) (and .cse10 .cse5 (= ~a12~0 6)) (and .cse12 .cse0 .cse9) (and (= ~a15~0 4) .cse12 .cse1) (and .cse0 .cse8 .cse3) (and .cse2 .cse5 .cse7 .cse3) (and .cse2 .cse7 .cse0) (and .cse10 .cse2 .cse5 .cse11 (<= .cse4 0)) (and .cse5 .cse6 .cse7 .cse9 .cse3)))) [2019-11-16 00:28:22,091 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,091 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,091 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,091 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,091 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,091 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,092 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,092 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,092 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,092 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,092 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,092 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,093 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,093 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:28:22,093 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,093 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:28:22,093 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,093 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:28:22,094 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:28:22,094 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,094 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,094 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,094 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,094 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,095 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,095 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,095 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,095 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,095 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,095 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,096 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,096 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-16 00:28:22,096 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,096 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,096 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,096 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,097 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,097 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:28:22,097 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:28:22,097 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:28:22,097 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,098 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,098 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,098 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,098 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,098 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,098 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,099 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,099 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,099 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,099 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,099 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,099 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,100 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:28:22,100 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,100 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:28:22,100 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:28:22,100 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,100 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,101 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,101 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,101 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:28:22,101 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,101 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,101 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,102 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,102 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,102 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,102 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,102 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,102 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,103 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,103 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:28:22,103 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:28:22,103 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:28:22,103 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,103 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,104 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,104 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,104 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,104 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,104 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,104 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,105 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,105 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,105 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,105 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,105 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,105 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,106 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:28:22,106 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,106 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:28:22,106 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:28:22,106 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,107 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,107 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,107 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,107 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,107 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,107 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,108 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,108 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,108 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,108 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,108 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,108 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,109 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,109 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:28:22,109 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:28:22,109 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:28:22,109 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,109 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,110 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,110 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,110 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,110 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,110 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,110 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,111 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,111 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,111 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,111 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,111 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,111 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,112 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,112 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:28:22,112 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:28:22,112 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,112 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,112 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,113 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,113 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,113 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,113 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,113 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,113 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,114 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,114 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,114 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,114 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:28:22,114 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,115 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,116 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,116 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,116 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,116 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,116 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,116 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,117 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,117 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,117 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,117 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:28:22,117 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:28:22,117 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,118 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,118 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,118 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,118 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,118 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,118 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,119 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,119 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,119 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,119 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,119 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:28:22,119 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:28:22,120 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,120 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,120 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,120 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,120 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:28:22,120 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,121 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,121 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,121 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,121 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,121 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,121 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,122 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,122 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,122 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,122 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,122 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,122 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,123 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:28:22,123 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:28:22,123 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,123 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,123 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,123 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,124 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,124 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,124 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,124 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,124 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,124 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:28:22,125 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:28:22,126 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:28:22,126 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,126 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,126 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,126 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,126 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,127 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,127 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,127 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,127 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,127 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,127 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,128 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,128 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,128 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,128 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,128 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:28:22,128 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:28:22,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:28:22,129 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:28:22,129 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,129 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,129 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,129 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,130 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,130 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,130 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,130 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,130 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,130 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,131 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,132 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,132 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:28:22,132 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:28:22,132 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:28:22,132 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,132 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,133 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,133 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,133 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,133 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,133 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,133 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,134 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-16 00:28:22,134 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,134 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:28:22,134 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:28:22,134 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:28:22,134 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,135 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-16 00:28:22,135 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,135 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-16 00:28:22,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:28:22 BoogieIcfgContainer [2019-11-16 00:28:22,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:28:22,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:28:22,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:28:22,207 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:28:22,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:36" (3/4) ... [2019-11-16 00:28:22,213 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:28:22,279 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:28:22,284 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:28:22,333 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((3 == a15 && a12 == 5) || ((!(a16 == 8) && 3 == a15) && 6 <= a12)) || (((((a18 + 156 <= 0 || 0 < a18 + 79) && 4 <= a15) && a18 <= 134) && a16 <= 9) && 6 <= a12)) || ((((4 <= a15 && a16 <= 9) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && !(a12 == 8)) && 6 <= a12)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a16 == 8 && 3 == a15) && !(a12 == 8))) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((3 == a15 && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 6 <= a12)) || (((!(a16 == 8) && 4 <= a15) && a16 <= 9) && 6 <= a12)) || ((!(a16 == 8) && a16 <= 9) && 3 == a15)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || ((((4 <= a15 && a18 <= 134) && a16 <= 9) && !(a12 == 8)) && 6 <= a12) [2019-11-16 00:28:22,339 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((3 == a15 && a12 == 5) || ((!(a16 == 8) && 3 == a15) && 6 <= a12)) || (((((a18 + 156 <= 0 || 0 < a18 + 79) && 4 <= a15) && a18 <= 134) && a16 <= 9) && 6 <= a12)) || ((((4 <= a15 && a16 <= 9) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && !(a12 == 8)) && 6 <= a12)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a16 == 8 && 3 == a15) && !(a12 == 8))) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((3 == a15 && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 6 <= a12)) || (((!(a16 == 8) && 4 <= a15) && a16 <= 9) && 6 <= a12)) || ((!(a16 == 8) && a16 <= 9) && 3 == a15)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || ((((4 <= a15 && a18 <= 134) && a16 <= 9) && !(a12 == 8)) && 6 <= a12) [2019-11-16 00:28:22,356 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((3 == a15 && a12 == 5) || ((!(a16 == 8) && 3 == a15) && 6 <= a12)) || (((((a18 + 156 <= 0 || 0 < a18 + 79) && 4 <= a15) && a18 <= 134) && a16 <= 9) && 6 <= a12)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((((4 <= a15 && a16 <= 9) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && !(a12 == 8)) && 6 <= a12)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a16 == 8 && 3 == a15) && !(a12 == 8))) || ((3 == a15 && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 6 <= a12)) || (((a15 == 4 && a16 == 8) && (!(3 == input) || a18 <= 134)) && a12 == 5)) || (((!(a16 == 8) && 4 <= a15) && a16 <= 9) && 6 <= a12)) || ((!(a16 == 8) && a16 <= 9) && 3 == a15)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || ((((4 <= a15 && a18 <= 134) && a16 <= 9) && !(a12 == 8)) && 6 <= a12) [2019-11-16 00:28:22,659 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_10df7a71-1a41-4a88-8647-ca7a1d8b9197/bin/uautomizer/witness.graphml [2019-11-16 00:28:22,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:28:22,661 INFO L168 Benchmark]: Toolchain (without parser) took 110987.53 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 939.4 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,661 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:22,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1210.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,663 INFO L168 Benchmark]: Boogie Preprocessor took 151.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,663 INFO L168 Benchmark]: RCFGBuilder took 2918.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 31.9 MB). Peak memory consumption was 187.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,664 INFO L168 Benchmark]: TraceAbstraction took 106052.85 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,664 INFO L168 Benchmark]: Witness Printer took 453.21 ms. Allocated memory is still 5.1 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:22,666 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1210.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 194.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 151.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2918.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 31.9 MB). Peak memory consumption was 187.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 106052.85 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 453.21 ms. Allocated memory is still 5.1 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.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_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:28:22,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((3 == a15 && a12 == 5) || ((!(a16 == 8) && 3 == a15) && 6 <= a12)) || (((((a18 + 156 <= 0 || 0 < a18 + 79) && 4 <= a15) && a18 <= 134) && a16 <= 9) && 6 <= a12)) || ((((4 <= a15 && a16 <= 9) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && !(a12 == 8)) && 6 <= a12)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a16 == 8 && 3 == a15) && !(a12 == 8))) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((3 == a15 && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 6 <= a12)) || (((!(a16 == 8) && 4 <= a15) && a16 <= 9) && 6 <= a12)) || ((!(a16 == 8) && a16 <= 9) && 3 == a15)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || ((((4 <= a15 && a18 <= 134) && a16 <= 9) && !(a12 == 8)) && 6 <= a12) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-16 00:28:22,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((3 == a15 && a12 == 5) || ((!(a16 == 8) && 3 == a15) && 6 <= a12)) || (((((a18 + 156 <= 0 || 0 < a18 + 79) && 4 <= a15) && a18 <= 134) && a16 <= 9) && 6 <= a12)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((((4 <= a15 && a16 <= 9) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && !(a12 == 8)) && 6 <= a12)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a16 == 8 && 3 == a15) && !(a12 == 8))) || ((3 == a15 && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 6 <= a12)) || (((a15 == 4 && a16 == 8) && (!(3 == input) || a18 <= 134)) && a12 == 5)) || (((!(a16 == 8) && 4 <= a15) && a16 <= 9) && 6 <= a12)) || ((!(a16 == 8) && a16 <= 9) && 3 == a15)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || ((((4 <= a15 && a18 <= 134) && a16 <= 9) && !(a12 == 8)) && 6 <= a12) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-16 00:28:22,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-16 00:28:22,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((3 == a15 && a12 == 5) || ((!(a16 == 8) && 3 == a15) && 6 <= a12)) || (((((a18 + 156 <= 0 || 0 < a18 + 79) && 4 <= a15) && a18 <= 134) && a16 <= 9) && 6 <= a12)) || ((((4 <= a15 && a16 <= 9) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && !(a12 == 8)) && 6 <= a12)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a16 == 8 && 3 == a15) && !(a12 == 8))) || ((a15 == 4 && a16 == 8) && a12 == 5)) || ((3 == a15 && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 6 <= a12)) || (((!(a16 == 8) && 4 <= a15) && a16 <= 9) && 6 <= a12)) || ((!(a16 == 8) && a16 <= 9) && 3 == a15)) || ((((a16 <= 11 && !(a16 == 8)) && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || ((((4 <= a15 && a18 <= 134) && a16 <= 9) && !(a12 == 8)) && 6 <= a12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 105.8s, OverallIterations: 18, TraceHistogramMax: 13, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, HoareTripleCheckerStatistics: 4849 SDtfs, 7260 SDslu, 152 SDs, 0 SdLazy, 19335 SolverSat, 2979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14473 GetRequests, 14349 SyntacticMatches, 27 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13164occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 2984 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 169 NumberOfFragments, 843 HoareAnnotationTreeSize, 4 FomulaSimplifications, 7983 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2340 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 30.0s InterpolantComputationTime, 34026 NumberOfCodeBlocks, 34026 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 33997 ConstructedInterpolants, 111 QuantifiedInterpolants, 142235166 SizeOfPredicates, 6 NumberOfNonLiveVariables, 16649 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 101595/107439 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...