./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label19.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_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/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 edeea1f74999e0c407ee107c2e6c77e98295c642 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:54:53,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:54:53,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:54:53,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:54:53,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:54:53,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:54:53,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:54:53,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:54:53,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:54:53,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:54:53,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:54:53,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:54:53,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:54:53,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:54:53,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:54:53,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:54:53,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:54:53,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:54:53,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:54:53,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:54:53,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:54:53,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:54:53,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:54:53,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:54:53,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:54:53,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:54:53,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:54:53,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:54:53,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:54:53,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:54:53,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:54:53,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:54:53,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:54:53,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:54:53,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:54:53,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:54:53,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:54:53,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:54:53,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:54:53,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:54:53,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:54:53,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:54:53,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:54:53,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:54:53,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:54:53,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:54:53,334 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:54:53,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:54:53,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:54:53,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:54:53,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:54:53,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:54:53,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:54:53,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:54:53,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:54:53,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:54:53,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:54:53,336 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:54:53,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:54:53,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:54:53,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:54:53,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:54:53,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:54:53,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:54:53,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:54:53,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:54:53,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:54:53,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:54:53,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:54:53,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:54:53,338 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_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/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 -> edeea1f74999e0c407ee107c2e6c77e98295c642 [2019-11-15 23:54:53,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:54:53,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:54:53,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:54:53,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:54:53,388 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:54:53,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2019-11-15 23:54:53,438 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/data/a4c466cc6/43b7c76d27274d928f2b5b07abccd490/FLAG135689351 [2019-11-15 23:54:53,977 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:54:53,977 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2019-11-15 23:54:53,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/data/a4c466cc6/43b7c76d27274d928f2b5b07abccd490/FLAG135689351 [2019-11-15 23:54:54,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/data/a4c466cc6/43b7c76d27274d928f2b5b07abccd490 [2019-11-15 23:54:54,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:54:54,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:54:54,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:54,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:54:54,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:54:54,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:54" (1/1) ... [2019-11-15 23:54:54,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30af59e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:54, skipping insertion in model container [2019-11-15 23:54:54,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:54" (1/1) ... [2019-11-15 23:54:54,215 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:54:54,300 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:54:55,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:55,191 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:54:55,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:55,458 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:54:55,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55 WrapperNode [2019-11-15 23:54:55,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:55,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:55,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:54:55,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:54:55,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:55,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:54:55,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:54:55,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:54:55,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... [2019-11-15 23:54:55,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:54:55,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:54:55,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:54:55,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:54:55,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:54:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:54:55,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:54:58,769 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:54:58,770 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:54:58,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:58 BoogieIcfgContainer [2019-11-15 23:54:58,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:54:58,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:54:58,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:54:58,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:54:58,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:54:54" (1/3) ... [2019-11-15 23:54:58,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231c40ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:54:58, skipping insertion in model container [2019-11-15 23:54:58,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:55" (2/3) ... [2019-11-15 23:54:58,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231c40ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:54:58, skipping insertion in model container [2019-11-15 23:54:58,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:58" (3/3) ... [2019-11-15 23:54:58,781 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label19.c [2019-11-15 23:54:58,791 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:54:58,800 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:54:58,809 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:54:58,844 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:54:58,844 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:54:58,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:54:58,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:54:58,845 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:54:58,845 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:54:58,845 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:54:58,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:54:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 23:54:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:54:58,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:58,889 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] [2019-11-15 23:54:58,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-11-15 23:54:58,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:58,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858331079] [2019-11-15 23:54:58,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:58,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:58,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:59,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858331079] [2019-11-15 23:54:59,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:59,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:59,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557673661] [2019-11-15 23:54:59,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:59,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:59,242 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 23:55:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:02,986 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-11-15 23:55:02,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:02,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 23:55:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:03,012 INFO L225 Difference]: With dead ends: 1514 [2019-11-15 23:55:03,012 INFO L226 Difference]: Without dead ends: 1008 [2019-11-15 23:55:03,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-15 23:55:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-11-15 23:55:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-15 23:55:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-11-15 23:55:03,101 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 45 [2019-11-15 23:55:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:03,102 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-11-15 23:55:03,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-11-15 23:55:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 23:55:03,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:03,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:03,107 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 416619247, now seen corresponding path program 1 times [2019-11-15 23:55:03,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:03,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174310524] [2019-11-15 23:55:03,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:03,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:03,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:03,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174310524] [2019-11-15 23:55:03,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:03,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:03,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247538030] [2019-11-15 23:55:03,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:03,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:03,369 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-11-15 23:55:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:08,326 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-11-15 23:55:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:08,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-15 23:55:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:08,336 INFO L225 Difference]: With dead ends: 2303 [2019-11-15 23:55:08,336 INFO L226 Difference]: Without dead ends: 1628 [2019-11-15 23:55:08,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-11-15 23:55:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-11-15 23:55:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-11-15 23:55:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-11-15 23:55:08,378 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 110 [2019-11-15 23:55:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:08,379 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-11-15 23:55:08,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-11-15 23:55:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 23:55:08,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:08,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:08,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1808654100, now seen corresponding path program 1 times [2019-11-15 23:55:08,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:08,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128457714] [2019-11-15 23:55:08,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:08,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:08,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:08,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128457714] [2019-11-15 23:55:08,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:08,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:08,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493887306] [2019-11-15 23:55:08,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:08,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:08,473 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-11-15 23:55:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:11,633 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-11-15 23:55:11,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:11,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-15 23:55:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:11,649 INFO L225 Difference]: With dead ends: 3777 [2019-11-15 23:55:11,649 INFO L226 Difference]: Without dead ends: 2790 [2019-11-15 23:55:11,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-11-15 23:55:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-11-15 23:55:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-11-15 23:55:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-11-15 23:55:11,710 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 111 [2019-11-15 23:55:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:11,712 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-11-15 23:55:11,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-11-15 23:55:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 23:55:11,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:11,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:11,717 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash 399406558, now seen corresponding path program 1 times [2019-11-15 23:55:11,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:11,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498798179] [2019-11-15 23:55:11,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:11,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:11,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:11,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498798179] [2019-11-15 23:55:11,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:11,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:11,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562979773] [2019-11-15 23:55:11,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:11,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:11,863 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-11-15 23:55:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:15,796 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-11-15 23:55:15,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:15,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 23:55:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:15,821 INFO L225 Difference]: With dead ends: 7368 [2019-11-15 23:55:15,822 INFO L226 Difference]: Without dead ends: 5484 [2019-11-15 23:55:15,825 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-15 23:55:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-11-15 23:55:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-11-15 23:55:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-11-15 23:55:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-11-15 23:55:15,926 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 115 [2019-11-15 23:55:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:15,926 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-11-15 23:55:15,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-11-15 23:55:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-15 23:55:15,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:15,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:15,929 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1837727490, now seen corresponding path program 1 times [2019-11-15 23:55:15,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:15,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995816562] [2019-11-15 23:55:15,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995816562] [2019-11-15 23:55:16,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:16,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138767236] [2019-11-15 23:55:16,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:16,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:16,069 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 3 states. [2019-11-15 23:55:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:17,959 INFO L93 Difference]: Finished difference Result 14842 states and 19263 transitions. [2019-11-15 23:55:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:17,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-15 23:55:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:17,995 INFO L225 Difference]: With dead ends: 14842 [2019-11-15 23:55:17,995 INFO L226 Difference]: Without dead ends: 7571 [2019-11-15 23:55:18,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-15 23:55:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-15 23:55:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-15 23:55:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8705 transitions. [2019-11-15 23:55:18,163 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8705 transitions. Word has length 136 [2019-11-15 23:55:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:18,164 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 8705 transitions. [2019-11-15 23:55:18,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8705 transitions. [2019-11-15 23:55:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 23:55:18,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:18,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:18,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1954499346, now seen corresponding path program 1 times [2019-11-15 23:55:18,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:18,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917702339] [2019-11-15 23:55:18,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:18,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917702339] [2019-11-15 23:55:18,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:18,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:18,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664789052] [2019-11-15 23:55:18,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:18,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:18,601 INFO L87 Difference]: Start difference. First operand 7571 states and 8705 transitions. Second operand 5 states. [2019-11-15 23:55:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:21,478 INFO L93 Difference]: Finished difference Result 22038 states and 25652 transitions. [2019-11-15 23:55:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:21,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2019-11-15 23:55:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:21,524 INFO L225 Difference]: With dead ends: 22038 [2019-11-15 23:55:21,525 INFO L226 Difference]: Without dead ends: 13871 [2019-11-15 23:55:21,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-11-15 23:55:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 10566. [2019-11-15 23:55:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10566 states. [2019-11-15 23:55:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10566 states to 10566 states and 12187 transitions. [2019-11-15 23:55:21,840 INFO L78 Accepts]: Start accepts. Automaton has 10566 states and 12187 transitions. Word has length 278 [2019-11-15 23:55:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:21,841 INFO L462 AbstractCegarLoop]: Abstraction has 10566 states and 12187 transitions. [2019-11-15 23:55:21,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 10566 states and 12187 transitions. [2019-11-15 23:55:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-15 23:55:21,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:21,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:21,847 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash 81761830, now seen corresponding path program 1 times [2019-11-15 23:55:21,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:21,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814075056] [2019-11-15 23:55:21,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:21,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:21,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:22,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814075056] [2019-11-15 23:55:22,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924100798] [2019-11-15 23:55:22,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:22,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:22,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 23:55:22,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:22,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-15 23:55:22,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233684764] [2019-11-15 23:55:22,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:22,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:22,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:22,943 INFO L87 Difference]: Start difference. First operand 10566 states and 12187 transitions. Second operand 3 states. [2019-11-15 23:55:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:24,529 INFO L93 Difference]: Finished difference Result 23529 states and 26930 transitions. [2019-11-15 23:55:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:24,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-15 23:55:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:24,555 INFO L225 Difference]: With dead ends: 23529 [2019-11-15 23:55:24,555 INFO L226 Difference]: Without dead ends: 12965 [2019-11-15 23:55:24,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12965 states. [2019-11-15 23:55:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12965 to 12663. [2019-11-15 23:55:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12663 states. [2019-11-15 23:55:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12663 states to 12663 states and 14296 transitions. [2019-11-15 23:55:24,893 INFO L78 Accepts]: Start accepts. Automaton has 12663 states and 14296 transitions. Word has length 315 [2019-11-15 23:55:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:24,893 INFO L462 AbstractCegarLoop]: Abstraction has 12663 states and 14296 transitions. [2019-11-15 23:55:24,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12663 states and 14296 transitions. [2019-11-15 23:55:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-11-15 23:55:24,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:24,901 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:55:25,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:25,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1938559075, now seen corresponding path program 1 times [2019-11-15 23:55:25,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:25,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061508889] [2019-11-15 23:55:25,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:25,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:25,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 23:55:25,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061508889] [2019-11-15 23:55:25,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:25,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:25,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490050606] [2019-11-15 23:55:25,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:25,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:25,619 INFO L87 Difference]: Start difference. First operand 12663 states and 14296 transitions. Second operand 5 states. [2019-11-15 23:55:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:27,685 INFO L93 Difference]: Finished difference Result 25924 states and 29231 transitions. [2019-11-15 23:55:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:27,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 363 [2019-11-15 23:55:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:27,714 INFO L225 Difference]: With dead ends: 25924 [2019-11-15 23:55:27,714 INFO L226 Difference]: Without dead ends: 13562 [2019-11-15 23:55:27,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13562 states. [2019-11-15 23:55:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13562 to 13560. [2019-11-15 23:55:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13560 states. [2019-11-15 23:55:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 15200 transitions. [2019-11-15 23:55:28,033 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 15200 transitions. Word has length 363 [2019-11-15 23:55:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:28,034 INFO L462 AbstractCegarLoop]: Abstraction has 13560 states and 15200 transitions. [2019-11-15 23:55:28,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 15200 transitions. [2019-11-15 23:55:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-15 23:55:28,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:28,043 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:28,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1680735344, now seen corresponding path program 1 times [2019-11-15 23:55:28,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:28,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780116620] [2019-11-15 23:55:28,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:28,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:28,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 23:55:28,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780116620] [2019-11-15 23:55:28,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:28,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:28,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218644073] [2019-11-15 23:55:28,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:28,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:28,313 INFO L87 Difference]: Start difference. First operand 13560 states and 15200 transitions. Second operand 4 states. [2019-11-15 23:55:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:30,291 INFO L93 Difference]: Finished difference Result 26824 states and 30109 transitions. [2019-11-15 23:55:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:30,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-11-15 23:55:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:30,313 INFO L225 Difference]: With dead ends: 26824 [2019-11-15 23:55:30,314 INFO L226 Difference]: Without dead ends: 13565 [2019-11-15 23:55:30,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13565 states. [2019-11-15 23:55:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13565 to 9965. [2019-11-15 23:55:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9965 states. [2019-11-15 23:55:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9965 states to 9965 states and 10838 transitions. [2019-11-15 23:55:30,451 INFO L78 Accepts]: Start accepts. Automaton has 9965 states and 10838 transitions. Word has length 422 [2019-11-15 23:55:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:30,452 INFO L462 AbstractCegarLoop]: Abstraction has 9965 states and 10838 transitions. [2019-11-15 23:55:30,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9965 states and 10838 transitions. [2019-11-15 23:55:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-11-15 23:55:30,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:30,465 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:30,465 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash 81446721, now seen corresponding path program 1 times [2019-11-15 23:55:30,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:30,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109505267] [2019-11-15 23:55:30,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:30,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:30,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 285 proven. 70 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 23:55:31,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109505267] [2019-11-15 23:55:31,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141598789] [2019-11-15 23:55:31,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:31,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:31,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-15 23:55:31,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:31,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 23:55:31,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580541738] [2019-11-15 23:55:31,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:31,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:31,744 INFO L87 Difference]: Start difference. First operand 9965 states and 10838 transitions. Second operand 3 states. [2019-11-15 23:55:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:32,982 INFO L93 Difference]: Finished difference Result 22618 states and 24825 transitions. [2019-11-15 23:55:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:32,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2019-11-15 23:55:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:32,995 INFO L225 Difference]: With dead ends: 22618 [2019-11-15 23:55:32,995 INFO L226 Difference]: Without dead ends: 12655 [2019-11-15 23:55:33,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 506 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2019-11-15 23:55:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 10861. [2019-11-15 23:55:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-15 23:55:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11939 transitions. [2019-11-15 23:55:33,126 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11939 transitions. Word has length 506 [2019-11-15 23:55:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:33,127 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11939 transitions. [2019-11-15 23:55:33,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11939 transitions. [2019-11-15 23:55:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-15 23:55:33,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:33,145 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:33,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:33,348 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash -459851816, now seen corresponding path program 1 times [2019-11-15 23:55:33,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:33,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67803163] [2019-11-15 23:55:33,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:33,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 23:55:33,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67803163] [2019-11-15 23:55:33,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:33,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:33,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61431201] [2019-11-15 23:55:33,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:33,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:33,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:33,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:33,955 INFO L87 Difference]: Start difference. First operand 10861 states and 11939 transitions. Second operand 4 states. [2019-11-15 23:55:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:36,145 INFO L93 Difference]: Finished difference Result 28299 states and 31302 transitions. [2019-11-15 23:55:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:36,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 551 [2019-11-15 23:55:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:36,157 INFO L225 Difference]: With dead ends: 28299 [2019-11-15 23:55:36,157 INFO L226 Difference]: Without dead ends: 17440 [2019-11-15 23:55:36,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17440 states. [2019-11-15 23:55:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17440 to 17141. [2019-11-15 23:55:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17141 states. [2019-11-15 23:55:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17141 states to 17141 states and 18393 transitions. [2019-11-15 23:55:36,321 INFO L78 Accepts]: Start accepts. Automaton has 17141 states and 18393 transitions. Word has length 551 [2019-11-15 23:55:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:36,322 INFO L462 AbstractCegarLoop]: Abstraction has 17141 states and 18393 transitions. [2019-11-15 23:55:36,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17141 states and 18393 transitions. [2019-11-15 23:55:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-11-15 23:55:36,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:36,335 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:36,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -225226931, now seen corresponding path program 1 times [2019-11-15 23:55:36,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:36,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702804115] [2019-11-15 23:55:36,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:36,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:36,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 23:55:36,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702804115] [2019-11-15 23:55:36,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:36,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:36,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725928675] [2019-11-15 23:55:36,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:36,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:36,837 INFO L87 Difference]: Start difference. First operand 17141 states and 18393 transitions. Second operand 4 states. [2019-11-15 23:55:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:39,203 INFO L93 Difference]: Finished difference Result 34283 states and 36790 transitions. [2019-11-15 23:55:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:39,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-11-15 23:55:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:39,215 INFO L225 Difference]: With dead ends: 34283 [2019-11-15 23:55:39,216 INFO L226 Difference]: Without dead ends: 17144 [2019-11-15 23:55:39,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17144 states. [2019-11-15 23:55:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17144 to 16241. [2019-11-15 23:55:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16241 states. [2019-11-15 23:55:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16241 states to 16241 states and 17255 transitions. [2019-11-15 23:55:39,391 INFO L78 Accepts]: Start accepts. Automaton has 16241 states and 17255 transitions. Word has length 609 [2019-11-15 23:55:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:39,392 INFO L462 AbstractCegarLoop]: Abstraction has 16241 states and 17255 transitions. [2019-11-15 23:55:39,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16241 states and 17255 transitions. [2019-11-15 23:55:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-11-15 23:55:39,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:39,404 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:39,404 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 335196122, now seen corresponding path program 1 times [2019-11-15 23:55:39,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:39,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194682809] [2019-11-15 23:55:39,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:39,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:39,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 516 proven. 173 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 23:55:40,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194682809] [2019-11-15 23:55:40,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726230265] [2019-11-15 23:55:40,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:40,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:55:40,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:40,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:55:40,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:40,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:40,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:40,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:40,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 602 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 23:55:41,388 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:55:41,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-15 23:55:41,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781419092] [2019-11-15 23:55:41,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:55:41,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:55:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:41,391 INFO L87 Difference]: Start difference. First operand 16241 states and 17255 transitions. Second operand 9 states. [2019-11-15 23:55:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:56,377 INFO L93 Difference]: Finished difference Result 53460 states and 56374 transitions. [2019-11-15 23:55:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:55:56,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 661 [2019-11-15 23:55:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:56,410 INFO L225 Difference]: With dead ends: 53460 [2019-11-15 23:55:56,410 INFO L226 Difference]: Without dead ends: 36623 [2019-11-15 23:55:56,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 680 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:55:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36623 states. [2019-11-15 23:55:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36623 to 22230. [2019-11-15 23:55:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22230 states. [2019-11-15 23:55:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22230 states to 22230 states and 23279 transitions. [2019-11-15 23:55:56,663 INFO L78 Accepts]: Start accepts. Automaton has 22230 states and 23279 transitions. Word has length 661 [2019-11-15 23:55:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:56,664 INFO L462 AbstractCegarLoop]: Abstraction has 22230 states and 23279 transitions. [2019-11-15 23:55:56,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:55:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 22230 states and 23279 transitions. [2019-11-15 23:55:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-11-15 23:55:56,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:56,677 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:56,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:56,885 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 378264636, now seen corresponding path program 1 times [2019-11-15 23:55:56,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:56,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353175833] [2019-11-15 23:55:56,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 107 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:58,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353175833] [2019-11-15 23:55:58,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101518460] [2019-11-15 23:55:58,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:58,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:55:58,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:58,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:58,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-11-15 23:55:59,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:59,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-15 23:55:59,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404817956] [2019-11-15 23:55:59,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:59,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:55:59,362 INFO L87 Difference]: Start difference. First operand 22230 states and 23279 transitions. Second operand 3 states. [2019-11-15 23:56:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:02,477 INFO L93 Difference]: Finished difference Result 26418 states and 27562 transitions. [2019-11-15 23:56:02,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:02,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-11-15 23:56:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:02,494 INFO L225 Difference]: With dead ends: 26418 [2019-11-15 23:56:02,494 INFO L226 Difference]: Without dead ends: 26416 [2019-11-15 23:56:02,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 688 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:56:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26416 states. [2019-11-15 23:56:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26416 to 22529. [2019-11-15 23:56:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22529 states. [2019-11-15 23:56:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22529 states to 22529 states and 23580 transitions. [2019-11-15 23:56:02,692 INFO L78 Accepts]: Start accepts. Automaton has 22529 states and 23580 transitions. Word has length 689 [2019-11-15 23:56:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:02,694 INFO L462 AbstractCegarLoop]: Abstraction has 22529 states and 23580 transitions. [2019-11-15 23:56:02,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 22529 states and 23580 transitions. [2019-11-15 23:56:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-11-15 23:56:02,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:02,705 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:02,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:02,908 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash 151347988, now seen corresponding path program 1 times [2019-11-15 23:56:02,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:02,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736969951] [2019-11-15 23:56:02,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 572 proven. 106 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-15 23:56:04,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736969951] [2019-11-15 23:56:04,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871671926] [2019-11-15 23:56:04,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:04,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:56:04,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:04,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:04,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:06,644 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_826 Int)) (let ((.cse1 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (= (mod (+ .cse0 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse0 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (= 0 (mod .cse1 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse3 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse2 (div .cse3 5))) (and (<= 278886 .cse2) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse2 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse2 (- 278887)) 5)) (<= 0 .cse3))))) (exists ((v_~a0~0_826 Int)) (let ((.cse5 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< .cse4 278886) (not (= (mod (+ .cse4 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse4 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse4 (- 278887)) 5)) (<= 0 .cse5))))) (exists ((v_~a0~0_826 Int)) (let ((.cse7 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (<= 278887 .cse6) (< .cse6 278886) (not (= (mod (+ .cse6 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse6 (- 278887)) 5)) (<= 0 .cse7))))) (exists ((v_~a0~0_826 Int)) (let ((.cse9 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (<= 278886 .cse8) (<= 278887 .cse8) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (= 0 (mod .cse9 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse11 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (<= 278886 .cse10) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse10 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (= 0 (mod .cse11 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse13 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (<= 278886 .cse12) (not (= 0 (mod .cse13 5))) (not (= 0 (mod (+ .cse12 3) 5))) (< .cse13 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse12 278887) (<= c_~a0~0 (div (+ .cse12 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse15 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (<= 278887 .cse14) (< .cse14 278886) (not (= (mod (+ .cse14 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (= 0 (mod .cse15 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse17 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (not (= 0 (mod (+ .cse16 3) 5))) (< .cse16 278886) (not (= (mod (+ .cse16 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse17 5)) (< .cse16 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse19 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (<= 278887 .cse18) (= (mod (+ .cse18 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse18 (- 278887)) 5)) (<= 0 .cse19))))) (exists ((v_~a0~0_826 Int)) (let ((.cse21 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (<= 278886 .cse20) (<= 278887 .cse20) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)) (<= 0 .cse21))))) (exists ((v_~a0~0_826 Int)) (let ((.cse22 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse23 (div .cse22 5))) (and (not (= 0 (mod .cse22 5))) (< .cse23 278886) (not (= (mod (+ .cse23 4) 5) 0)) (< .cse22 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse23 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse23 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse25 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< .cse24 278886) (not (= (mod (+ .cse24 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse24 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse24 (- 278887)) 5)) (= 0 (mod .cse25 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse26 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse27 (div .cse26 5))) (and (not (= 0 (mod .cse26 5))) (not (= 0 (mod (+ .cse27 3) 5))) (< .cse27 278886) (not (= (mod (+ .cse27 4) 5) 0)) (< .cse26 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse27 (- 278886)) 5) 1)) (< .cse27 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse29 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (<= 278886 .cse28) (not (= 0 (mod .cse29 5))) (< .cse29 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse28 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse31 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (= (mod (+ .cse30 4) 5) 0) (not (= 0 (mod (+ .cse30 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse30 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse31) (< .cse30 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse33 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278887 .cse32) (not (= 0 (mod .cse33 5))) (= (mod (+ .cse32 4) 5) 0) (< .cse33 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse35 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (<= 278886 .cse34) (<= 278887 .cse34) (not (= 0 (mod .cse35 5))) (< .cse35 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse34 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse37 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (not (= 0 (mod (+ .cse36 3) 5))) (< .cse36 278886) (not (= (mod (+ .cse36 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse37) (< .cse36 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse39 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (<= 278886 .cse38) (not (= 0 (mod (+ .cse38 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse38 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse39 5)) (< .cse38 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse41 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (= (mod (+ .cse40 4) 5) 0) (not (= 0 (mod (+ .cse40 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse41 5)) (< .cse40 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse43 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= 278887 .cse42) (= (mod (+ .cse42 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (= 0 (mod .cse43 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse45 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (<= 278887 .cse44) (not (= 0 (mod .cse45 5))) (< .cse44 278886) (not (= (mod (+ .cse44 4) 5) 0)) (< .cse45 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse44 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse47 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (<= 278886 .cse46) (not (= 0 (mod (+ .cse46 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse46 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse47) (< .cse46 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse49 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (= (mod (+ .cse48 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse48 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= 0 .cse49))))) (exists ((v_~a0~0_826 Int)) (let ((.cse50 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse51 (div .cse50 5))) (and (not (= 0 (mod .cse50 5))) (= (mod (+ .cse51 4) 5) 0) (not (= 0 (mod (+ .cse51 3) 5))) (< .cse50 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse51 278887) (<= c_~a0~0 (div (+ .cse51 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse52 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse53 (div .cse52 5))) (and (not (= 0 (mod .cse52 5))) (= (mod (+ .cse53 4) 5) 0) (< .cse52 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse53 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse53 (- 278886)) 5))))))) is different from false [2019-11-15 23:56:08,716 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_826 Int)) (let ((.cse1 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (= (mod (+ .cse0 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse0 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (= 0 (mod .cse1 5)))))) (exists ((v_prenex_18 Int)) (let ((.cse3 (div (* v_prenex_18 (- 250)) 9))) (let ((.cse2 (div .cse3 5))) (and (< 0 (+ v_prenex_18 147)) (<= c_~a0~0 (+ (div (+ .cse2 (- 278887)) 5) 1)) (< .cse2 278887) (<= (* 250 v_prenex_18) 0) (not (= 0 (mod (+ .cse2 3) 5))) (not (= (mod (+ .cse2 4) 5) 0)) (<= 0 .cse3) (< .cse2 278886) (<= (+ v_prenex_18 98) 0))))) (exists ((v_prenex_8 Int)) (let ((.cse5 (div (* v_prenex_8 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (<= (* 250 v_prenex_8) 0) (< .cse4 278887) (= 0 (mod .cse5 5)) (< .cse4 278886) (not (= (mod (+ .cse4 4) 5) 0)) (<= (+ v_prenex_8 98) 0) (not (= 0 (mod (+ .cse4 3) 5))) (< 0 (+ v_prenex_8 147)) (<= c_~a0~0 (+ (div (+ .cse4 (- 278887)) 5) 1)))))) (exists ((v_prenex_11 Int)) (let ((.cse6 (div (* v_prenex_11 (- 250)) 9))) (let ((.cse7 (div .cse6 5))) (and (not (= 0 (mod .cse6 5))) (not (= (mod (+ .cse7 4) 5) 0)) (< 0 (+ v_prenex_11 147)) (<= (* 250 v_prenex_11) 0) (<= c_~a0~0 (+ (div (+ .cse7 (- 278886)) 5) 1)) (< .cse6 0) (< .cse7 278886) (<= (+ v_prenex_11 98) 0) (= 0 (mod (+ .cse7 3) 5)))))) (exists ((v_prenex_4 Int)) (let ((.cse9 (div (* v_prenex_4 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (< 0 (+ v_prenex_4 147)) (<= (+ v_prenex_4 98) 0) (<= 278886 .cse8) (= 0 (mod .cse9 5)) (<= 278887 .cse8) (<= (* 250 v_prenex_4) 0))))) (exists ((v_prenex_13 Int)) (let ((.cse11 (div (* v_prenex_13 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< .cse10 278886) (<= c_~a0~0 (+ (div (+ .cse10 (- 278886)) 5) 1)) (<= (+ v_prenex_13 98) 0) (< 0 (+ v_prenex_13 147)) (< .cse10 278887) (not (= 0 (mod .cse11 5))) (not (= 0 (mod (+ .cse10 3) 5))) (<= (* 250 v_prenex_13) 0) (not (= (mod (+ .cse10 4) 5) 0)) (< .cse11 0))))) (exists ((v_prenex_23 Int)) (let ((.cse13 (div (* v_prenex_23 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (<= 278886 .cse12) (<= (* 250 v_prenex_23) 0) (not (= 0 (mod (+ .cse12 3) 5))) (<= (+ v_prenex_23 98) 0) (<= c_~a0~0 (+ (div (+ .cse12 (- 278887)) 5) 1)) (< 0 (+ v_prenex_23 147)) (< .cse12 278887) (<= 0 .cse13))))) (exists ((v_prenex_20 Int)) (let ((.cse15 (div (* v_prenex_20 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (<= (+ v_prenex_20 98) 0) (= (mod (+ .cse14 4) 5) 0) (< .cse14 278887) (< 0 (+ v_prenex_20 147)) (not (= 0 (mod (+ .cse14 3) 5))) (<= c_~a0~0 (+ (div (+ .cse14 (- 278887)) 5) 1)) (<= (* 250 v_prenex_20) 0) (= 0 (mod .cse15 5)))))) (exists ((v_prenex_19 Int)) (let ((.cse17 (div (* v_prenex_19 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (not (= 0 (mod (+ .cse16 3) 5))) (<= 278886 .cse16) (<= (+ v_prenex_19 98) 0) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1)) (< .cse16 278887) (= 0 (mod .cse17 5)) (<= (* 250 v_prenex_19) 0) (< 0 (+ v_prenex_19 147)))))) (exists ((v_prenex_25 Int)) (let ((.cse18 (div (* v_prenex_25 (- 250)) 9))) (let ((.cse19 (div .cse18 5))) (and (<= (+ v_prenex_25 98) 0) (not (= 0 (mod .cse18 5))) (<= c_~a0~0 (div (+ .cse19 (- 278886)) 5)) (< 0 (+ v_prenex_25 147)) (< .cse18 0) (< .cse19 278887) (not (= 0 (mod (+ .cse19 3) 5))) (= (mod (+ .cse19 4) 5) 0) (<= (* 250 v_prenex_25) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse21 (div (* v_prenex_3 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< .cse20 278886) (not (= (mod (+ .cse20 4) 5) 0)) (<= (* 250 v_prenex_3) 0) (<= 0 .cse21) (<= (+ v_prenex_3 98) 0) (<= 278887 .cse20) (< 0 (+ v_prenex_3 147)) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)))))) (exists ((v_prenex_2 Int)) (let ((.cse23 (div (* v_prenex_2 (- 250)) 9))) (let ((.cse22 (div .cse23 5))) (and (< 0 (+ v_prenex_2 147)) (<= (+ v_prenex_2 98) 0) (<= (* 250 v_prenex_2) 0) (not (= (mod (+ .cse22 4) 5) 0)) (= 0 (mod (+ .cse22 3) 5)) (<= c_~a0~0 (div (+ .cse22 (- 278887)) 5)) (<= 0 .cse23) (< .cse22 278886))))) (exists ((v_prenex_22 Int)) (let ((.cse25 (div (* v_prenex_22 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (not (= (mod (+ .cse24 4) 5) 0)) (<= (* 250 v_prenex_22) 0) (< .cse25 0) (< .cse24 278886) (< 0 (+ v_prenex_22 147)) (<= 278887 .cse24) (<= (+ v_prenex_22 98) 0) (<= c_~a0~0 (+ (div (+ .cse24 (- 278886)) 5) 1)) (not (= 0 (mod .cse25 5))))))) (exists ((v_prenex_21 Int)) (let ((.cse26 (div (* v_prenex_21 (- 250)) 9))) (let ((.cse27 (div .cse26 5))) (and (<= (+ v_prenex_21 98) 0) (< 0 (+ v_prenex_21 147)) (= 0 (mod .cse26 5)) (<= c_~a0~0 (div (+ .cse27 (- 278887)) 5)) (= (mod (+ .cse27 4) 5) 0) (<= (* 250 v_prenex_21) 0) (<= 278887 .cse27))))) (exists ((v_prenex_26 Int)) (let ((.cse29 (div (* v_prenex_26 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (= 0 (mod (+ .cse28 3) 5)) (< 0 (+ v_prenex_26 147)) (not (= 0 (mod .cse29 5))) (= (mod (+ .cse28 4) 5) 0) (<= (+ v_prenex_26 98) 0) (< .cse29 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (<= (* 250 v_prenex_26) 0))))) (exists ((v_prenex_10 Int)) (let ((.cse31 (div (* v_prenex_10 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (<= 278886 .cse30) (<= (* 250 v_prenex_10) 0) (<= 0 .cse31) (<= (+ v_prenex_10 98) 0) (< 0 (+ v_prenex_10 147)) (<= c_~a0~0 (div (+ .cse30 (- 278887)) 5)) (<= 278887 .cse30))))) (exists ((v_prenex_5 Int)) (let ((.cse33 (div (* v_prenex_5 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278886 .cse32) (= 0 (mod .cse33 5)) (<= (+ v_prenex_5 98) 0) (= 0 (mod (+ .cse32 3) 5)) (<= (* 250 v_prenex_5) 0) (< 0 (+ v_prenex_5 147)) (<= c_~a0~0 (div (+ .cse32 (- 278887)) 5)))))) (exists ((v_prenex_24 Int)) (let ((.cse34 (div (* v_prenex_24 (- 250)) 9))) (let ((.cse35 (div .cse34 5))) (and (<= 0 .cse34) (< 0 (+ v_prenex_24 147)) (<= c_~a0~0 (div (+ .cse35 (- 278887)) 5)) (= (mod (+ .cse35 4) 5) 0) (<= (+ v_prenex_24 98) 0) (<= (* 250 v_prenex_24) 0) (= 0 (mod (+ .cse35 3) 5)))))) (exists ((v_prenex_12 Int)) (let ((.cse37 (div (* v_prenex_12 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (<= (* 250 v_prenex_12) 0) (<= c_~a0~0 (div (+ .cse36 (- 278887)) 5)) (= 0 (mod .cse37 5)) (< 0 (+ v_prenex_12 147)) (< .cse36 278886) (= 0 (mod (+ .cse36 3) 5)) (not (= (mod (+ .cse36 4) 5) 0)) (<= (+ v_prenex_12 98) 0))))) (exists ((v_prenex_1 Int)) (let ((.cse39 (div (* v_prenex_1 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (<= (* 250 v_prenex_1) 0) (<= (+ v_prenex_1 98) 0) (< 0 (+ v_prenex_1 147)) (= 0 (mod (+ .cse38 3) 5)) (<= 278886 .cse38) (<= c_~a0~0 (div (+ .cse38 (- 278887)) 5)) (<= 0 .cse39))))) (exists ((v_prenex_17 Int)) (let ((.cse40 (div (* v_prenex_17 (- 250)) 9))) (let ((.cse41 (div .cse40 5))) (and (<= (+ v_prenex_17 98) 0) (< 0 (+ v_prenex_17 147)) (not (= 0 (mod .cse40 5))) (<= 278886 .cse41) (<= 278887 .cse41) (< .cse40 0) (<= c_~a0~0 (div (+ .cse41 (- 278886)) 5)) (<= (* 250 v_prenex_17) 0))))) (exists ((v_prenex_14 Int)) (let ((.cse43 (div (* v_prenex_14 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= 278886 .cse42) (not (= 0 (mod .cse43 5))) (<= (+ v_prenex_14 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278886)) 5)) (< 0 (+ v_prenex_14 147)) (<= (* 250 v_prenex_14) 0) (< .cse43 0) (= 0 (mod (+ .cse42 3) 5)))))) (exists ((v_prenex_15 Int)) (let ((.cse45 (div (* v_prenex_15 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< .cse44 278887) (not (= 0 (mod (+ .cse44 3) 5))) (< 0 (+ v_prenex_15 147)) (<= 0 .cse45) (= (mod (+ .cse44 4) 5) 0) (<= c_~a0~0 (+ (div (+ .cse44 (- 278887)) 5) 1)) (<= (* 250 v_prenex_15) 0) (<= (+ v_prenex_15 98) 0))))) (exists ((v_prenex_9 Int)) (let ((.cse47 (div (* v_prenex_9 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (<= 278887 .cse46) (<= (+ v_prenex_9 98) 0) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)) (<= (* 250 v_prenex_9) 0) (<= 0 .cse47) (= (mod (+ .cse46 4) 5) 0) (< 0 (+ v_prenex_9 147)))))) (exists ((v_prenex_6 Int)) (let ((.cse49 (div (* v_prenex_6 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_prenex_6 147)) (<= (+ v_prenex_6 98) 0) (<= 278886 .cse48) (not (= 0 (mod (+ .cse48 3) 5))) (<= c_~a0~0 (div (+ .cse48 (- 278886)) 5)) (< .cse48 278887) (< .cse49 0) (<= (* 250 v_prenex_6) 0) (not (= 0 (mod .cse49 5))))))) (exists ((v_prenex_16 Int)) (let ((.cse51 (div (* v_prenex_16 (- 250)) 9))) (let ((.cse50 (div .cse51 5))) (and (< 0 (+ v_prenex_16 147)) (<= 278887 .cse50) (not (= 0 (mod .cse51 5))) (<= c_~a0~0 (div (+ .cse50 (- 278886)) 5)) (<= (+ v_prenex_16 98) 0) (<= (* 250 v_prenex_16) 0) (< .cse51 0) (= (mod (+ .cse50 4) 5) 0))))) (exists ((v_prenex_7 Int)) (let ((.cse53 (div (* v_prenex_7 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (<= (* 250 v_prenex_7) 0) (<= (+ v_prenex_7 98) 0) (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (not (= (mod (+ .cse52 4) 5) 0)) (= 0 (mod .cse53 5)) (< 0 (+ v_prenex_7 147)) (< .cse52 278886) (<= 278887 .cse52)))))) is different from false [2019-11-15 23:56:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 43 not checked. [2019-11-15 23:56:17,979 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:17,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2019-11-15 23:56:17,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047097656] [2019-11-15 23:56:17,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:56:17,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:56:17,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=80, Unknown=2, NotChecked=38, Total=156 [2019-11-15 23:56:17,982 INFO L87 Difference]: Start difference. First operand 22529 states and 23580 transitions. Second operand 13 states. [2019-11-15 23:56:24,691 WARN L838 $PredicateComparison]: unable to prove that (and (or (exists ((v_~a0~0_826 Int)) (let ((.cse1 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (= (mod (+ .cse0 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse0 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (= 0 (mod .cse1 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse3 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse2 (div .cse3 5))) (and (<= 278886 .cse2) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse2 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse2 (- 278887)) 5)) (<= 0 .cse3))))) (exists ((v_~a0~0_826 Int)) (let ((.cse5 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< .cse4 278886) (not (= (mod (+ .cse4 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse4 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse4 (- 278887)) 5)) (<= 0 .cse5))))) (exists ((v_~a0~0_826 Int)) (let ((.cse7 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (<= 278887 .cse6) (< .cse6 278886) (not (= (mod (+ .cse6 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse6 (- 278887)) 5)) (<= 0 .cse7))))) (exists ((v_~a0~0_826 Int)) (let ((.cse9 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (<= 278886 .cse8) (<= 278887 .cse8) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (= 0 (mod .cse9 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse11 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (<= 278886 .cse10) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse10 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (= 0 (mod .cse11 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse13 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (<= 278886 .cse12) (not (= 0 (mod .cse13 5))) (not (= 0 (mod (+ .cse12 3) 5))) (< .cse13 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse12 278887) (<= c_~a0~0 (div (+ .cse12 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse15 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (<= 278887 .cse14) (< .cse14 278886) (not (= (mod (+ .cse14 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (= 0 (mod .cse15 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse17 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (not (= 0 (mod (+ .cse16 3) 5))) (< .cse16 278886) (not (= (mod (+ .cse16 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse17 5)) (< .cse16 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse19 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (<= 278887 .cse18) (= (mod (+ .cse18 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse18 (- 278887)) 5)) (<= 0 .cse19))))) (exists ((v_~a0~0_826 Int)) (let ((.cse21 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (<= 278886 .cse20) (<= 278887 .cse20) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)) (<= 0 .cse21))))) (exists ((v_~a0~0_826 Int)) (let ((.cse22 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse23 (div .cse22 5))) (and (not (= 0 (mod .cse22 5))) (< .cse23 278886) (not (= (mod (+ .cse23 4) 5) 0)) (< .cse22 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse23 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse23 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse25 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< .cse24 278886) (not (= (mod (+ .cse24 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse24 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse24 (- 278887)) 5)) (= 0 (mod .cse25 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse26 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse27 (div .cse26 5))) (and (not (= 0 (mod .cse26 5))) (not (= 0 (mod (+ .cse27 3) 5))) (< .cse27 278886) (not (= (mod (+ .cse27 4) 5) 0)) (< .cse26 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse27 (- 278886)) 5) 1)) (< .cse27 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse29 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (<= 278886 .cse28) (not (= 0 (mod .cse29 5))) (< .cse29 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse28 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse31 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (= (mod (+ .cse30 4) 5) 0) (not (= 0 (mod (+ .cse30 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse30 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse31) (< .cse30 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse33 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278887 .cse32) (not (= 0 (mod .cse33 5))) (= (mod (+ .cse32 4) 5) 0) (< .cse33 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse35 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (<= 278886 .cse34) (<= 278887 .cse34) (not (= 0 (mod .cse35 5))) (< .cse35 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse34 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse37 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (not (= 0 (mod (+ .cse36 3) 5))) (< .cse36 278886) (not (= (mod (+ .cse36 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse37) (< .cse36 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse39 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (<= 278886 .cse38) (not (= 0 (mod (+ .cse38 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse38 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse39 5)) (< .cse38 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse41 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (= (mod (+ .cse40 4) 5) 0) (not (= 0 (mod (+ .cse40 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse41 5)) (< .cse40 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse43 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= 278887 .cse42) (= (mod (+ .cse42 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (= 0 (mod .cse43 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse45 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (<= 278887 .cse44) (not (= 0 (mod .cse45 5))) (< .cse44 278886) (not (= (mod (+ .cse44 4) 5) 0)) (< .cse45 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse44 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse47 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (<= 278886 .cse46) (not (= 0 (mod (+ .cse46 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse46 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse47) (< .cse46 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse49 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (= (mod (+ .cse48 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse48 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= 0 .cse49))))) (exists ((v_~a0~0_826 Int)) (let ((.cse50 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse51 (div .cse50 5))) (and (not (= 0 (mod .cse50 5))) (= (mod (+ .cse51 4) 5) 0) (not (= 0 (mod (+ .cse51 3) 5))) (< .cse50 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse51 278887) (<= c_~a0~0 (div (+ .cse51 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse52 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse53 (div .cse52 5))) (and (not (= 0 (mod .cse52 5))) (= (mod (+ .cse53 4) 5) 0) (< .cse52 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse53 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse53 (- 278886)) 5))))))) (<= (+ c_~a29~0 144) 0) (not (= 3 c_~a2~0))) is different from false [2019-11-15 23:56:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:29,365 INFO L93 Difference]: Finished difference Result 55478 states and 57915 transitions. [2019-11-15 23:56:29,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:56:29,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 697 [2019-11-15 23:56:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:29,390 INFO L225 Difference]: With dead ends: 55478 [2019-11-15 23:56:29,391 INFO L226 Difference]: Without dead ends: 32951 [2019-11-15 23:56:29,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 697 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=53, Invalid=138, Unknown=3, NotChecked=78, Total=272 [2019-11-15 23:56:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32951 states. [2019-11-15 23:56:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32951 to 24411. [2019-11-15 23:56:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24411 states. [2019-11-15 23:56:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24411 states to 24411 states and 25533 transitions. [2019-11-15 23:56:29,864 INFO L78 Accepts]: Start accepts. Automaton has 24411 states and 25533 transitions. Word has length 697 [2019-11-15 23:56:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:29,865 INFO L462 AbstractCegarLoop]: Abstraction has 24411 states and 25533 transitions. [2019-11-15 23:56:29,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:56:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 24411 states and 25533 transitions. [2019-11-15 23:56:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2019-11-15 23:56:29,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:29,875 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:30,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:30,075 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:30,075 INFO L82 PathProgramCache]: Analyzing trace with hash -717755273, now seen corresponding path program 1 times [2019-11-15 23:56:30,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:30,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121379988] [2019-11-15 23:56:30,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:30,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:30,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-15 23:56:30,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121379988] [2019-11-15 23:56:30,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:30,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:30,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985279188] [2019-11-15 23:56:30,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:30,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:30,543 INFO L87 Difference]: Start difference. First operand 24411 states and 25533 transitions. Second operand 3 states. [2019-11-15 23:56:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:31,617 INFO L93 Difference]: Finished difference Result 49117 states and 51367 transitions. [2019-11-15 23:56:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:31,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 718 [2019-11-15 23:56:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:31,634 INFO L225 Difference]: With dead ends: 49117 [2019-11-15 23:56:31,634 INFO L226 Difference]: Without dead ends: 24708 [2019-11-15 23:56:31,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24708 states. [2019-11-15 23:56:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24708 to 24409. [2019-11-15 23:56:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24409 states. [2019-11-15 23:56:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24409 states to 24409 states and 25529 transitions. [2019-11-15 23:56:31,838 INFO L78 Accepts]: Start accepts. Automaton has 24409 states and 25529 transitions. Word has length 718 [2019-11-15 23:56:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:31,839 INFO L462 AbstractCegarLoop]: Abstraction has 24409 states and 25529 transitions. [2019-11-15 23:56:31,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24409 states and 25529 transitions. [2019-11-15 23:56:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-11-15 23:56:31,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:31,860 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:31,860 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:31,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:31,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1690318276, now seen corresponding path program 1 times [2019-11-15 23:56:31,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:31,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974345052] [2019-11-15 23:56:31,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:31,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:31,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-15 23:56:32,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974345052] [2019-11-15 23:56:32,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:32,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:32,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44145965] [2019-11-15 23:56:32,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:32,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:32,654 INFO L87 Difference]: Start difference. First operand 24409 states and 25529 transitions. Second operand 5 states. [2019-11-15 23:56:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:35,012 INFO L93 Difference]: Finished difference Result 54506 states and 56872 transitions. [2019-11-15 23:56:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:56:35,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 842 [2019-11-15 23:56:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:35,053 INFO L225 Difference]: With dead ends: 54506 [2019-11-15 23:56:35,053 INFO L226 Difference]: Without dead ends: 29497 [2019-11-15 23:56:35,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29497 states. [2019-11-15 23:56:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29497 to 22610. [2019-11-15 23:56:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22610 states. [2019-11-15 23:56:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22610 states to 22610 states and 23415 transitions. [2019-11-15 23:56:35,418 INFO L78 Accepts]: Start accepts. Automaton has 22610 states and 23415 transitions. Word has length 842 [2019-11-15 23:56:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:35,418 INFO L462 AbstractCegarLoop]: Abstraction has 22610 states and 23415 transitions. [2019-11-15 23:56:35,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22610 states and 23415 transitions. [2019-11-15 23:56:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2019-11-15 23:56:35,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:35,433 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:35,433 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash 591902161, now seen corresponding path program 1 times [2019-11-15 23:56:35,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:35,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2197442] [2019-11-15 23:56:35,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:35,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:35,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-11-15 23:56:36,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2197442] [2019-11-15 23:56:36,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:36,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:36,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422481575] [2019-11-15 23:56:36,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:36,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:36,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:36,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:36,014 INFO L87 Difference]: Start difference. First operand 22610 states and 23415 transitions. Second operand 3 states. [2019-11-15 23:56:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:37,173 INFO L93 Difference]: Finished difference Result 47309 states and 48970 transitions. [2019-11-15 23:56:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:37,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 845 [2019-11-15 23:56:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:37,188 INFO L225 Difference]: With dead ends: 47309 [2019-11-15 23:56:37,189 INFO L226 Difference]: Without dead ends: 20802 [2019-11-15 23:56:37,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2019-11-15 23:56:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 20204. [2019-11-15 23:56:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20204 states. [2019-11-15 23:56:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20204 states to 20204 states and 20786 transitions. [2019-11-15 23:56:37,356 INFO L78 Accepts]: Start accepts. Automaton has 20204 states and 20786 transitions. Word has length 845 [2019-11-15 23:56:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:37,357 INFO L462 AbstractCegarLoop]: Abstraction has 20204 states and 20786 transitions. [2019-11-15 23:56:37,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 20204 states and 20786 transitions. [2019-11-15 23:56:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-15 23:56:37,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:37,370 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:37,370 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1103935205, now seen corresponding path program 1 times [2019-11-15 23:56:37,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:37,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26124574] [2019-11-15 23:56:37,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:37,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:37,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-15 23:56:37,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26124574] [2019-11-15 23:56:37,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:37,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:37,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467913115] [2019-11-15 23:56:37,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:37,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:37,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:37,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:37,958 INFO L87 Difference]: Start difference. First operand 20204 states and 20786 transitions. Second operand 3 states. [2019-11-15 23:56:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:38,892 INFO L93 Difference]: Finished difference Result 41298 states and 42530 transitions. [2019-11-15 23:56:38,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:38,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2019-11-15 23:56:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:38,908 INFO L225 Difference]: With dead ends: 41298 [2019-11-15 23:56:38,908 INFO L226 Difference]: Without dead ends: 22892 [2019-11-15 23:56:38,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22892 states. [2019-11-15 23:56:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22892 to 21696. [2019-11-15 23:56:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-11-15 23:56:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 22272 transitions. [2019-11-15 23:56:39,095 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 22272 transitions. Word has length 847 [2019-11-15 23:56:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:39,096 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 22272 transitions. [2019-11-15 23:56:39,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 22272 transitions. [2019-11-15 23:56:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-11-15 23:56:39,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:39,106 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:39,106 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 76724679, now seen corresponding path program 1 times [2019-11-15 23:56:39,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:39,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770644951] [2019-11-15 23:56:39,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:39,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:39,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 1000 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-11-15 23:56:40,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770644951] [2019-11-15 23:56:40,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:40,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:40,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40271940] [2019-11-15 23:56:40,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:40,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:40,259 INFO L87 Difference]: Start difference. First operand 21696 states and 22272 transitions. Second operand 5 states. [2019-11-15 23:56:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:41,861 INFO L93 Difference]: Finished difference Result 44014 states and 45186 transitions. [2019-11-15 23:56:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:56:41,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 861 [2019-11-15 23:56:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:41,882 INFO L225 Difference]: With dead ends: 44014 [2019-11-15 23:56:41,883 INFO L226 Difference]: Without dead ends: 22918 [2019-11-15 23:56:41,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:56:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22918 states. [2019-11-15 23:56:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22918 to 21696. [2019-11-15 23:56:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-11-15 23:56:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 22250 transitions. [2019-11-15 23:56:42,097 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 22250 transitions. Word has length 861 [2019-11-15 23:56:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:42,098 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 22250 transitions. [2019-11-15 23:56:42,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 22250 transitions. [2019-11-15 23:56:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-11-15 23:56:42,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:42,106 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:42,106 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:42,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1531465597, now seen corresponding path program 1 times [2019-11-15 23:56:42,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:42,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727878905] [2019-11-15 23:56:42,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:42,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:42,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-11-15 23:56:42,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727878905] [2019-11-15 23:56:42,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:42,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:42,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123018261] [2019-11-15 23:56:42,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:42,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:42,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:42,799 INFO L87 Difference]: Start difference. First operand 21696 states and 22250 transitions. Second operand 3 states. [2019-11-15 23:56:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:43,746 INFO L93 Difference]: Finished difference Result 43686 states and 44833 transitions. [2019-11-15 23:56:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:43,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 868 [2019-11-15 23:56:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:43,761 INFO L225 Difference]: With dead ends: 43686 [2019-11-15 23:56:43,761 INFO L226 Difference]: Without dead ends: 23489 [2019-11-15 23:56:43,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23489 states. [2019-11-15 23:56:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23489 to 21394. [2019-11-15 23:56:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21394 states. [2019-11-15 23:56:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 21903 transitions. [2019-11-15 23:56:43,941 INFO L78 Accepts]: Start accepts. Automaton has 21394 states and 21903 transitions. Word has length 868 [2019-11-15 23:56:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:43,942 INFO L462 AbstractCegarLoop]: Abstraction has 21394 states and 21903 transitions. [2019-11-15 23:56:43,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21394 states and 21903 transitions. [2019-11-15 23:56:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-11-15 23:56:43,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:43,951 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:43,951 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash -154291092, now seen corresponding path program 1 times [2019-11-15 23:56:43,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:43,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364694336] [2019-11-15 23:56:43,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:43,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:43,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 989 proven. 286 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-15 23:56:46,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364694336] [2019-11-15 23:56:46,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106250632] [2019-11-15 23:56:46,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:46,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:56:46,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:46,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:46,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:46,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:46,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:46,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:46,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:46,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 23:56:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1203 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-15 23:56:47,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:47,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-15 23:56:47,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916282790] [2019-11-15 23:56:47,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:56:47,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:47,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:56:47,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:56:47,168 INFO L87 Difference]: Start difference. First operand 21394 states and 21903 transitions. Second operand 16 states. [2019-11-15 23:56:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:54,699 INFO L93 Difference]: Finished difference Result 41538 states and 42493 transitions. [2019-11-15 23:56:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 23:56:54,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 887 [2019-11-15 23:56:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:54,715 INFO L225 Difference]: With dead ends: 41538 [2019-11-15 23:56:54,715 INFO L226 Difference]: Without dead ends: 21942 [2019-11-15 23:56:54,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 905 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 23:56:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21942 states. [2019-11-15 23:56:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21942 to 18688. [2019-11-15 23:56:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18688 states. [2019-11-15 23:56:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18688 states to 18688 states and 19098 transitions. [2019-11-15 23:56:54,885 INFO L78 Accepts]: Start accepts. Automaton has 18688 states and 19098 transitions. Word has length 887 [2019-11-15 23:56:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:54,886 INFO L462 AbstractCegarLoop]: Abstraction has 18688 states and 19098 transitions. [2019-11-15 23:56:54,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:56:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18688 states and 19098 transitions. [2019-11-15 23:56:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2019-11-15 23:56:54,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:54,894 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:55,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:55,095 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1903949696, now seen corresponding path program 1 times [2019-11-15 23:56:55,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:55,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319638943] [2019-11-15 23:56:55,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:55,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:55,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 996 proven. 198 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-11-15 23:56:56,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319638943] [2019-11-15 23:56:56,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340898885] [2019-11-15 23:56:56,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:56,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:56:56,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:56,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:56,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-11-15 23:56:57,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:56:57,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 23:56:57,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128253944] [2019-11-15 23:56:57,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:57,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:57,385 INFO L87 Difference]: Start difference. First operand 18688 states and 19098 transitions. Second operand 4 states. [2019-11-15 23:56:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:59,392 INFO L93 Difference]: Finished difference Result 41873 states and 42813 transitions. [2019-11-15 23:56:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:59,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 893 [2019-11-15 23:56:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:59,408 INFO L225 Difference]: With dead ends: 41873 [2019-11-15 23:56:59,408 INFO L226 Difference]: Without dead ends: 24598 [2019-11-15 23:56:59,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 894 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24598 states. [2019-11-15 23:56:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24598 to 20101. [2019-11-15 23:56:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20101 states. [2019-11-15 23:56:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20101 states to 20101 states and 20528 transitions. [2019-11-15 23:56:59,585 INFO L78 Accepts]: Start accepts. Automaton has 20101 states and 20528 transitions. Word has length 893 [2019-11-15 23:56:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:59,585 INFO L462 AbstractCegarLoop]: Abstraction has 20101 states and 20528 transitions. [2019-11-15 23:56:59,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20101 states and 20528 transitions. [2019-11-15 23:56:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-15 23:56:59,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:59,596 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:59,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:59,800 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1722502239, now seen corresponding path program 1 times [2019-11-15 23:56:59,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:59,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604789483] [2019-11-15 23:56:59,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:59,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:59,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 985 proven. 182 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-15 23:57:00,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604789483] [2019-11-15 23:57:00,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675173333] [2019-11-15 23:57:00,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:00,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:57:00,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:00,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-11-15 23:57:01,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:01,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-15 23:57:01,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485888911] [2019-11-15 23:57:01,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:01,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:01,430 INFO L87 Difference]: Start difference. First operand 20101 states and 20528 transitions. Second operand 4 states. [2019-11-15 23:57:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:02,910 INFO L93 Difference]: Finished difference Result 44400 states and 45367 transitions. [2019-11-15 23:57:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:02,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 922 [2019-11-15 23:57:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:02,927 INFO L225 Difference]: With dead ends: 44400 [2019-11-15 23:57:02,927 INFO L226 Difference]: Without dead ends: 25798 [2019-11-15 23:57:02,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 921 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25798 states. [2019-11-15 23:57:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25798 to 19204. [2019-11-15 23:57:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-15 23:57:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 19616 transitions. [2019-11-15 23:57:03,115 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 19616 transitions. Word has length 922 [2019-11-15 23:57:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:03,116 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 19616 transitions. [2019-11-15 23:57:03,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 19616 transitions. [2019-11-15 23:57:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-11-15 23:57:03,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:03,136 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:03,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:03,344 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash -175244572, now seen corresponding path program 1 times [2019-11-15 23:57:03,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:03,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624705091] [2019-11-15 23:57:03,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:03,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:03,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 978 proven. 144 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-15 23:57:04,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624705091] [2019-11-15 23:57:04,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560711411] [2019-11-15 23:57:04,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:04,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:57:04,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:04,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:04,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-15 23:57:05,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:05,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-15 23:57:05,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624075475] [2019-11-15 23:57:05,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:05,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:05,313 INFO L87 Difference]: Start difference. First operand 19204 states and 19616 transitions. Second operand 4 states. [2019-11-15 23:57:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:06,873 INFO L93 Difference]: Finished difference Result 45297 states and 46295 transitions. [2019-11-15 23:57:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:06,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1005 [2019-11-15 23:57:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:06,892 INFO L225 Difference]: With dead ends: 45297 [2019-11-15 23:57:06,892 INFO L226 Difference]: Without dead ends: 27592 [2019-11-15 23:57:06,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 1004 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27592 states. [2019-11-15 23:57:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27592 to 21299. [2019-11-15 23:57:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21299 states. [2019-11-15 23:57:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21299 states to 21299 states and 21777 transitions. [2019-11-15 23:57:07,090 INFO L78 Accepts]: Start accepts. Automaton has 21299 states and 21777 transitions. Word has length 1005 [2019-11-15 23:57:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:07,091 INFO L462 AbstractCegarLoop]: Abstraction has 21299 states and 21777 transitions. [2019-11-15 23:57:07,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 21299 states and 21777 transitions. [2019-11-15 23:57:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-15 23:57:07,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:07,102 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:07,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:07,303 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1147207921, now seen corresponding path program 1 times [2019-11-15 23:57:07,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:07,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235959422] [2019-11-15 23:57:07,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:07,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:07,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1093 proven. 343 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-11-15 23:57:09,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235959422] [2019-11-15 23:57:09,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21225345] [2019-11-15 23:57:09,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:10,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:57:10,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-11-15 23:57:10,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:10,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-11-15 23:57:10,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738854871] [2019-11-15 23:57:10,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:10,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:57:10,939 INFO L87 Difference]: Start difference. First operand 21299 states and 21777 transitions. Second operand 5 states. [2019-11-15 23:57:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:12,091 INFO L93 Difference]: Finished difference Result 41115 states and 42054 transitions. [2019-11-15 23:57:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:57:12,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1043 [2019-11-15 23:57:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:12,104 INFO L225 Difference]: With dead ends: 41115 [2019-11-15 23:57:12,104 INFO L226 Difference]: Without dead ends: 19513 [2019-11-15 23:57:12,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1042 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:57:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19513 states. [2019-11-15 23:57:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19513 to 19495. [2019-11-15 23:57:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19495 states. [2019-11-15 23:57:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19495 states to 19495 states and 19819 transitions. [2019-11-15 23:57:12,363 INFO L78 Accepts]: Start accepts. Automaton has 19495 states and 19819 transitions. Word has length 1043 [2019-11-15 23:57:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:12,364 INFO L462 AbstractCegarLoop]: Abstraction has 19495 states and 19819 transitions. [2019-11-15 23:57:12,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 19495 states and 19819 transitions. [2019-11-15 23:57:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2019-11-15 23:57:12,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:12,378 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:12,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:12,579 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,579 INFO L82 PathProgramCache]: Analyzing trace with hash -813641473, now seen corresponding path program 1 times [2019-11-15 23:57:12,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:12,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949016780] [2019-11-15 23:57:12,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 1403 proven. 102 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-11-15 23:57:14,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949016780] [2019-11-15 23:57:14,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485276696] [2019-11-15 23:57:14,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:57:14,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:20,707 WARN L191 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2019-11-15 23:57:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-11-15 23:57:21,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:21,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-15 23:57:21,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618487473] [2019-11-15 23:57:21,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:21,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:57:21,834 INFO L87 Difference]: Start difference. First operand 19495 states and 19819 transitions. Second operand 4 states. [2019-11-15 23:57:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:23,951 INFO L93 Difference]: Finished difference Result 40790 states and 41467 transitions. [2019-11-15 23:57:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:23,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1093 [2019-11-15 23:57:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:23,966 INFO L225 Difference]: With dead ends: 40790 [2019-11-15 23:57:23,966 INFO L226 Difference]: Without dead ends: 22495 [2019-11-15 23:57:23,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:57:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22495 states. [2019-11-15 23:57:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22495 to 14404. [2019-11-15 23:57:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14404 states. [2019-11-15 23:57:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14404 states to 14404 states and 14621 transitions. [2019-11-15 23:57:24,130 INFO L78 Accepts]: Start accepts. Automaton has 14404 states and 14621 transitions. Word has length 1093 [2019-11-15 23:57:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:24,131 INFO L462 AbstractCegarLoop]: Abstraction has 14404 states and 14621 transitions. [2019-11-15 23:57:24,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14404 states and 14621 transitions. [2019-11-15 23:57:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2019-11-15 23:57:24,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:24,142 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:24,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:24,343 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:24,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1246778028, now seen corresponding path program 1 times [2019-11-15 23:57:24,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:24,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024621626] [2019-11-15 23:57:24,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:24,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:24,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 1080 proven. 628 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-15 23:57:25,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024621626] [2019-11-15 23:57:25,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883237201] [2019-11-15 23:57:25,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:26,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:57:26,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:26,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:26,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 1158 proven. 86 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-11-15 23:57:29,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:29,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-11-15 23:57:29,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756995107] [2019-11-15 23:57:29,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:57:29,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:57:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:57:29,834 INFO L87 Difference]: Start difference. First operand 14404 states and 14621 transitions. Second operand 13 states. [2019-11-15 23:57:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:45,347 INFO L93 Difference]: Finished difference Result 39555 states and 40135 transitions. [2019-11-15 23:57:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-15 23:57:45,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1122 [2019-11-15 23:57:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:45,366 INFO L225 Difference]: With dead ends: 39555 [2019-11-15 23:57:45,366 INFO L226 Difference]: Without dead ends: 25448 [2019-11-15 23:57:45,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1159 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 23:57:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25448 states. [2019-11-15 23:57:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25448 to 14702. [2019-11-15 23:57:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-11-15 23:57:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 14883 transitions. [2019-11-15 23:57:45,555 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 14883 transitions. Word has length 1122 [2019-11-15 23:57:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:45,555 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 14883 transitions. [2019-11-15 23:57:45,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:57:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 14883 transitions. [2019-11-15 23:57:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-11-15 23:57:45,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:45,567 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:45,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:45,768 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash -848873680, now seen corresponding path program 1 times [2019-11-15 23:57:45,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:45,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217777937] [2019-11-15 23:57:45,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:45,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:45,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1323 proven. 231 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-15 23:57:47,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217777937] [2019-11-15 23:57:47,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074856685] [2019-11-15 23:57:47,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:47,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:57:47,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1065 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-15 23:57:48,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:48,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:57:48,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494281809] [2019-11-15 23:57:48,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:48,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:48,122 INFO L87 Difference]: Start difference. First operand 14702 states and 14883 transitions. Second operand 4 states. [2019-11-15 23:57:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:49,676 INFO L93 Difference]: Finished difference Result 31800 states and 32196 transitions. [2019-11-15 23:57:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:49,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1181 [2019-11-15 23:57:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:49,677 INFO L225 Difference]: With dead ends: 31800 [2019-11-15 23:57:49,678 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:57:49,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1186 GetRequests, 1180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:57:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:57:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:57:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:57:49,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1181 [2019-11-15 23:57:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:49,686 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:49,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:57:49,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:57:49,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:49,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:57:53,821 WARN L191 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 2082 DAG size of output: 1244 [2019-11-15 23:57:56,960 WARN L191 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 1531 DAG size of output: 1241 [2019-11-15 23:57:58,298 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 1008 DAG size of output: 888 [2019-11-15 23:58:12,874 WARN L191 SmtUtils]: Spent 14.57 s on a formula simplification. DAG size of input: 1184 DAG size of output: 189 [2019-11-15 23:58:27,144 WARN L191 SmtUtils]: Spent 14.26 s on a formula simplification. DAG size of input: 1181 DAG size of output: 189 [2019-11-15 23:58:35,149 WARN L191 SmtUtils]: Spent 8.00 s on a formula simplification. DAG size of input: 853 DAG size of output: 176 [2019-11-15 23:58:35,151 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,151 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,151 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,152 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,153 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,154 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-15 23:58:35,155 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 23:58:35,156 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,157 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,158 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,159 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-15 23:58:35,160 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,161 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,162 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,163 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 23:58:35,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 23:58:35,165 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 23:58:35,166 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-15 23:58:35,167 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,168 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,168 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,168 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,169 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse37 (+ ~a29~0 144)) (.cse40 (+ ~a4~0 86))) (let ((.cse12 (<= .cse40 0)) (.cse36 (< 0 .cse37)) (.cse39 (+ ~a29~0 16))) (let ((.cse7 (<= (+ ~a0~0 147) 0)) (.cse35 (not (= 1 ~a2~0))) (.cse23 (+ ~a0~0 44)) (.cse24 (+ ~a29~0 127)) (.cse33 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse19 (< 0 .cse40)) (.cse38 (<= .cse39 0)) (.cse9 (= 4 ~a2~0)) (.cse14 (= 2 ~a2~0)) (.cse25 (and .cse12 .cse36)) (.cse3 (= ~a2~0 1))) (let ((.cse21 (and .cse25 .cse3)) (.cse10 (and .cse12 .cse14)) (.cse4 (= 3 ~a2~0)) (.cse20 (and .cse12 .cse36 .cse9)) (.cse16 (<= ~a0~0 599920)) (.cse8 (< 0 .cse39)) (.cse15 (<= ~a0~0 599976)) (.cse26 (or .cse33 .cse19 .cse38)) (.cse6 (<= ~a29~0 43)) (.cse18 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse13 (and .cse38 .cse36)) (.cse0 (<= (+ ~a0~0 242851) 0)) (.cse1 (<= 0 .cse24)) (.cse11 (<= .cse37 0)) (.cse30 (<= (+ ~a0~0 98) 0)) (.cse29 (<= 0 (+ ~a0~0 146))) (.cse17 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse32 (<= 0 (+ ~a0~0 97))) (.cse22 (<= .cse23 0)) (.cse5 (<= (+ ~a0~0 61) 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse31 (and .cse36 .cse7 (not (= ~a2~0 3)) .cse35)) (.cse27 (= 5 ~a2~0)) (.cse28 (<= 4453 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse2 .cse4 .cse5) .cse6 .cse1) (and .cse7 .cse2 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse8 .cse9) (and (or (and .cse10 .cse11) (and (and (and .cse12 .cse13) .cse14) .cse1)) .cse15) (and .cse12 .cse9 .cse16 .cse17 .cse18) (and .cse8 .cse15 (and .cse2 .cse3 .cse19 .cse6)) (and .cse2 .cse8 (and .cse3 .cse7)) (and (and .cse8 (<= ~a29~0 42) .cse20) .cse15) (and (<= (+ ~a4~0 89) 0) (and .cse21 .cse22) (<= 0 .cse23) (<= .cse24 0) .cse1) (and .cse15 (and (and .cse25 .cse26 .cse27) .cse28)) (and .cse27 .cse5 .cse2 .cse29 .cse13) (and .cse30 .cse27 .cse1 .cse2 .cse29) (and (and .cse2 (and .cse31 .cse0)) .cse27) (and .cse5 .cse9 .cse2 .cse32 .cse13) (and .cse30 .cse2 .cse4) (and (and .cse12 .cse8 .cse4) .cse15) (and .cse5 .cse21) (and .cse5 .cse2 .cse3 .cse29 .cse13) (and .cse2 .cse7 .cse14) (and (or (and (and .cse10 .cse1) .cse33) (and .cse17 (and .cse12 .cse4))) .cse15) (and .cse20 .cse16) (and .cse30 .cse14 .cse1 .cse2) (and .cse5 .cse9 .cse1 .cse2 .cse32) (and .cse31 .cse14) (and .cse7 .cse12) (and .cse6 .cse14 .cse5 .cse1 .cse2) (and .cse8 .cse15 (and .cse26 (and (or .cse6 .cse18) .cse25) .cse27)) (and (or (and .cse13 .cse0 .cse1) .cse11) .cse2 .cse9 (exists ((v_~a0~0_830 Int)) (let ((.cse34 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse34 (- 278887)) 5) 1)) (< .cse34 278887) (not (= (mod (+ .cse34 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse30 .cse19 .cse2 .cse3 .cse29) (and .cse12 .cse17 .cse3 .cse32 .cse22) (and .cse12 .cse35 .cse5) (and (and .cse2 .cse31 .cse27) .cse28)))))) [2019-11-15 23:58:35,169 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 23:58:35,169 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 23:58:35,169 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,169 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,169 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 23:58:35,170 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,171 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-15 23:58:35,172 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-15 23:58:35,173 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,173 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,173 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,173 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,173 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,173 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,174 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse41 (+ ~a29~0 144)) (.cse42 (+ ~a4~0 86))) (let ((.cse40 (+ ~a0~0 44)) (.cse9 (<= .cse42 0)) (.cse39 (< 0 .cse41)) (.cse15 (+ ~a0~0 147))) (let ((.cse25 (= 4 ~a2~0)) (.cse21 (+ ~a29~0 127)) (.cse34 (< 0 .cse42)) (.cse16 (<= 0 (+ ~a0~0 146))) (.cse38 (+ ~a29~0 16)) (.cse7 (= 2 ~a2~0)) (.cse22 (<= .cse15 0)) (.cse37 (not (= 1 ~a2~0))) (.cse33 (and .cse9 .cse39)) (.cse18 (= ~a2~0 1)) (.cse20 (<= 0 .cse40)) (.cse24 (= 3 ~a2~0))) (let ((.cse4 (or (and .cse9 .cse24) (and .cse39 .cse20 .cse24))) (.cse11 (and .cse33 .cse18)) (.cse23 (<= 4453 ~a29~0)) (.cse6 (and .cse39 .cse22 (not (= ~a2~0 3)) .cse37)) (.cse0 (and .cse9 .cse7)) (.cse26 (<= (+ ~a0~0 242851) 0)) (.cse30 (<= .cse41 0)) (.cse12 (= 5 ~a2~0)) (.cse2 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse8 (< 0 .cse38)) (.cse5 (<= ~a0~0 599976)) (.cse32 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse28 (and .cse34 .cse16 .cse24)) (.cse27 (<= ~a29~0 43)) (.cse1 (<= 0 .cse21)) (.cse29 (and .cse9 .cse39 .cse25)) (.cse35 (<= ~a0~0 599920)) (.cse13 (<= (+ ~a0~0 98) 0)) (.cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse19 (<= .cse40 0)) (.cse14 (<= (+ ~a4~0 42) 0)) (.cse36 (<= 0 (+ ~a0~0 97))) (.cse17 (and (<= .cse38 0) .cse39)) (.cse10 (<= (+ ~a0~0 61) 0))) (or (and (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4)) .cse5) (and .cse6 .cse7) (and (and .cse8 (and .cse9 .cse4)) .cse5) (and .cse10 .cse11) (and .cse12 (and .cse13 .cse14 (< 0 .cse15) .cse1)) (and .cse12 .cse10 .cse14 .cse16 .cse17) (and .cse10 .cse14 .cse18 .cse16 .cse17) (and (and .cse11 .cse19) (<= (+ ~a4~0 89) 0) .cse20 (<= .cse21 0) .cse1) (and .cse22 .cse9) (and (and (and .cse14 .cse6) .cse12) .cse23) (and (and (and .cse9 .cse2 .cse12) .cse23) .cse5) (and (and .cse14 .cse17 .cse24 .cse10) .cse1) (and .cse14 .cse8 .cse22 .cse25) (and (and .cse14 (and .cse6 .cse26)) .cse12) (and .cse8 (and .cse14 .cse27 .cse28 .cse10)) (and (and .cse8 (<= ~a29~0 42) .cse29) .cse5) (and (or (and (and (and .cse9 .cse17) .cse7) .cse1) (and .cse0 .cse30)) .cse5) (and .cse14 (and .cse18 .cse22) .cse8) (and .cse26 .cse1 .cse14 .cse18) (and (and (or (and .cse26 .cse1) .cse30) .cse14 .cse25) (exists ((v_~a0~0_830 Int)) (let ((.cse31 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse31 (- 278887)) 5) 1)) (< .cse31 278887) (not (= (mod (+ .cse31 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse13 .cse8 .cse7 .cse14) (and .cse5 (and (and (and (or .cse27 .cse32) .cse33) .cse12 (or .cse2 .cse27)) .cse8)) (and (and .cse8 (and .cse14 (and .cse18 .cse34 .cse27))) .cse5) (and .cse9 .cse25 .cse35 .cse3 .cse32) (and .cse13 .cse14 .cse28) (and .cse10 .cse25 .cse1 .cse14 .cse36) (and .cse27 .cse7 .cse10 .cse1 .cse14) (and .cse14 (and .cse22 .cse24)) (and .cse29 .cse35) (and .cse13 .cse34 .cse14 .cse18 .cse16) (and .cse14 .cse22 .cse7) (and .cse9 .cse3 .cse18 .cse36 .cse19) (and .cse14 .cse36 .cse17 .cse10 .cse25) (and .cse9 .cse37 .cse10)))))) [2019-11-15 23:58:35,174 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,174 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 23:58:35,174 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,175 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,176 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,177 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 23:58:35,178 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 23:58:35,179 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,180 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,181 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,182 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,183 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,183 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,183 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,184 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse41 (+ ~a29~0 144)) (.cse42 (+ ~a4~0 86))) (let ((.cse40 (+ ~a0~0 44)) (.cse15 (+ ~a0~0 147)) (.cse9 (<= .cse42 0)) (.cse39 (< 0 .cse41))) (let ((.cse22 (= 4 ~a2~0)) (.cse28 (+ ~a29~0 127)) (.cse34 (< 0 .cse42)) (.cse16 (<= 0 (+ ~a0~0 146))) (.cse38 (+ ~a29~0 16)) (.cse7 (= 2 ~a2~0)) (.cse33 (and .cse9 .cse39)) (.cse18 (= ~a2~0 1)) (.cse19 (<= .cse15 0)) (.cse37 (not (= 1 ~a2~0))) (.cse27 (<= 0 .cse40)) (.cse21 (= 3 ~a2~0))) (let ((.cse4 (or (and .cse9 .cse21) (and .cse39 .cse27 .cse21))) (.cse20 (<= 4453 ~a29~0)) (.cse6 (and .cse39 .cse19 (not (= ~a2~0 3)) .cse37)) (.cse11 (and .cse33 .cse18)) (.cse0 (and .cse9 .cse7)) (.cse23 (<= (+ ~a0~0 242851) 0)) (.cse30 (<= .cse41 0)) (.cse12 (= 5 ~a2~0)) (.cse2 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse8 (< 0 .cse38)) (.cse5 (<= ~a0~0 599976)) (.cse32 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse25 (and .cse34 .cse16 .cse21)) (.cse24 (<= ~a29~0 43)) (.cse1 (<= 0 .cse28)) (.cse29 (and .cse9 .cse39 .cse22)) (.cse35 (<= ~a0~0 599920)) (.cse13 (<= (+ ~a0~0 98) 0)) (.cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse26 (<= .cse40 0)) (.cse14 (<= (+ ~a4~0 42) 0)) (.cse36 (<= 0 (+ ~a0~0 97))) (.cse17 (and (<= .cse38 0) .cse39)) (.cse10 (<= (+ ~a0~0 61) 0))) (or (and (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4)) .cse5) (and .cse6 .cse7) (and (and .cse8 (and .cse9 .cse4)) .cse5) (and .cse10 .cse11) (and .cse12 (and .cse13 .cse14 (< 0 .cse15) .cse1)) (and .cse12 .cse10 .cse14 .cse16 .cse17) (and .cse10 .cse14 .cse18 .cse16 .cse17) (and .cse19 .cse9) (and (and (and .cse14 .cse6) .cse12) .cse20) (and (and (and .cse9 .cse2 .cse12) .cse20) .cse5) (and (and .cse14 .cse17 .cse21 .cse10) .cse1) (and .cse14 .cse8 .cse19 .cse22) (and (and .cse14 (and .cse6 .cse23)) .cse12) (and .cse8 (and .cse14 .cse24 .cse25 .cse10)) (and (and .cse11 .cse26) (<= (+ ~a4~0 89) 0) .cse27 (<= .cse28 0) .cse1) (and (and .cse8 (<= ~a29~0 42) .cse29) .cse5) (and (or (and (and (and .cse9 .cse17) .cse7) .cse1) (and .cse0 .cse30)) .cse5) (and .cse14 (and .cse18 .cse19) .cse8) (and .cse23 .cse1 .cse14 .cse18) (and (and (or (and .cse23 .cse1) .cse30) .cse14 .cse22) (exists ((v_~a0~0_830 Int)) (let ((.cse31 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse31 (- 278887)) 5) 1)) (< .cse31 278887) (not (= (mod (+ .cse31 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse13 .cse8 .cse7 .cse14) (and .cse5 (and (and (and (or .cse24 .cse32) .cse33) .cse12 (or .cse2 .cse24)) .cse8)) (and (and .cse8 (and .cse14 (and .cse18 .cse34 .cse24))) .cse5) (and .cse9 .cse22 .cse35 .cse3 .cse32) (and .cse13 .cse14 .cse25) (and .cse10 .cse22 .cse1 .cse14 .cse36) (and .cse24 .cse7 .cse10 .cse1 .cse14) (and .cse14 (and .cse19 .cse21)) (and .cse29 .cse35) (and .cse13 .cse34 .cse14 .cse18 .cse16) (and .cse14 .cse19 .cse7) (and .cse9 .cse3 .cse18 .cse36 .cse26) (and .cse14 .cse36 .cse17 .cse10 .cse22) (and .cse9 .cse37 .cse10)))))) [2019-11-15 23:58:35,184 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 23:58:35,184 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 23:58:35,184 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,184 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,184 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,184 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,185 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,186 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,187 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,188 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-15 23:58:35,189 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,190 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 23:58:35,191 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 23:58:35,192 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-15 23:58:35,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:58:35 BoogieIcfgContainer [2019-11-15 23:58:35,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:58:35,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:58:35,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:58:35,258 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:58:35,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:58" (3/4) ... [2019-11-15 23:58:35,261 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:58:35,292 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:58:35,295 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:58:35,323 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) [2019-11-15 23:58:35,326 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) [2019-11-15 23:58:35,337 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1) || ((((a4 + 42 <= 0 && 3 == a2) && a0 + 61 <= 0) && a29 <= 43) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && !(1 == input)) && 0 < a29 + 16) && 4 == a2)) || ((((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((0 < a29 + 16 && a0 <= 599976) && ((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 1 && a0 + 147 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || ((((a4 + 89 <= 0 && ((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 <= 599976 && (((a4 + 86 <= 0 && 0 < a29 + 144) && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 5 == a2) && 4453 <= a29)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && 5 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && a4 + 42 <= 0) && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 3 == a2) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0 && 3 == a2)) && a0 <= 599976)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((0 < a29 + 16 && a0 <= 599976) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) && (a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((((a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 242851 <= 0) && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29) [2019-11-15 23:58:35,540 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a29628d8-909d-4e2d-bf7c-b857dbb4f8c0/bin/uautomizer/witness.graphml [2019-11-15 23:58:35,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:58:35,541 INFO L168 Benchmark]: Toolchain (without parser) took 221340.73 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 946.1 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,542 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:58:35,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1258.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.07 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: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,543 INFO L168 Benchmark]: Boogie Preprocessor took 192.59 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,543 INFO L168 Benchmark]: RCFGBuilder took 2948.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 950.8 MB in the end (delta: 75.4 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,543 INFO L168 Benchmark]: TraceAbstraction took 216485.46 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 950.8 MB in the beginning and 912.1 MB in the end (delta: 38.7 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,544 INFO L168 Benchmark]: Witness Printer took 282.56 ms. Allocated memory was 5.1 GB in the beginning and 4.9 GB in the end (delta: -231.2 MB). Free memory was 912.1 MB in the beginning and 4.7 GB in the end (delta: -3.8 GB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:35,545 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1258.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 170.07 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: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 192.59 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2948.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 950.8 MB in the end (delta: 75.4 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 216485.46 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 950.8 MB in the beginning and 912.1 MB in the end (delta: 38.7 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 282.56 ms. Allocated memory was 5.1 GB in the beginning and 4.9 GB in the end (delta: -231.2 MB). Free memory was 912.1 MB in the beginning and 4.7 GB in the end (delta: -3.8 GB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-11-15 23:58:35,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-15 23:58:35,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-15 23:58:35,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-15 23:58:35,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-15 23:58:35,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1) || ((((a4 + 42 <= 0 && 3 == a2) && a0 + 61 <= 0) && a29 <= 43) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && !(1 == input)) && 0 < a29 + 16) && 4 == a2)) || ((((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((0 < a29 + 16 && a0 <= 599976) && ((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 1 && a0 + 147 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || ((((a4 + 89 <= 0 && ((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 <= 599976 && (((a4 + 86 <= 0 && 0 < a29 + 144) && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 5 == a2) && 4453 <= a29)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && 5 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && a4 + 42 <= 0) && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 3 == a2) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0 && 3 == a2)) && a0 <= 599976)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((0 < a29 + 16 && a0 <= 599976) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) && (a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((((a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 242851 <= 0) && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 216.3s, OverallIterations: 29, TraceHistogramMax: 6, AutomataDifference: 103.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.2s, HoareTripleCheckerStatistics: 5586 SDtfs, 29844 SDslu, 2769 SDs, 0 SdLazy, 87351 SolverSat, 7307 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11391 GetRequests, 11113 SyntacticMatches, 45 SemanticMatches, 233 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24411occurred 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: 5.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 90993 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 295 NumberOfFragments, 2875 HoareAnnotationTreeSize, 4 FomulaSimplifications, 216694997 FormulaSimplificationTreeSizeReduction, 8.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 178617731 FormulaSimplificationTreeSizeReductionInter, 36.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 29749 NumberOfCodeBlocks, 29749 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 29707 ConstructedInterpolants, 1118 QuantifiedInterpolants, 157909284 SizeOfPredicates, 13 NumberOfNonLiveVariables, 12728 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 42 InterpolantComputations, 25 PerfectInterpolantSequences, 37456/40679 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...