./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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.25-f470102 [2019-12-07 18:05:16,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:05:16,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:05:16,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:05:16,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:05:16,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:05:16,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:05:16,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:05:16,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:05:16,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:05:16,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:05:16,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:05:16,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:05:16,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:05:16,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:05:16,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:05:16,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:05:16,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:05:16,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:05:16,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:05:16,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:05:16,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:05:16,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:05:16,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:05:16,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:05:16,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:05:16,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:05:16,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:05:16,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:05:16,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:05:16,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:05:16,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:05:16,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:05:16,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:05:16,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:05:16,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:05:16,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:05:16,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:05:16,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:05:16,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:05:16,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:05:16,116 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:05:16,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:05:16,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:05:16,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:05:16,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:05:16,129 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:05:16,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:05:16,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:05:16,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:05:16,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:05:16,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:05:16,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:05:16,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:05:16,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:05:16,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:05:16,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:05:16,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:05:16,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:05:16,133 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_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:05:16,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:05:16,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:05:16,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:05:16,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:05:16,244 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:05:16,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2019-12-07 18:05:16,289 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/data/6521c6e09/6217317549324413a2d9431db2fb2f00/FLAGb6404e75c [2019-12-07 18:05:16,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:05:16,799 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2019-12-07 18:05:16,812 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/data/6521c6e09/6217317549324413a2d9431db2fb2f00/FLAGb6404e75c [2019-12-07 18:05:17,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/data/6521c6e09/6217317549324413a2d9431db2fb2f00 [2019-12-07 18:05:17,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:05:17,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:05:17,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:17,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:05:17,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:05:17,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:17" (1/1) ... [2019-12-07 18:05:17,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:17, skipping insertion in model container [2019-12-07 18:05:17,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:05:17" (1/1) ... [2019-12-07 18:05:17,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:05:17,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:05:17,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:05:17,877 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:05:18,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:05:18,042 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:05:18,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18 WrapperNode [2019-12-07 18:05:18,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:05:18,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:05:18,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:05:18,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:05:18,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:05:18,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:05:18,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:05:18,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:05:18,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... [2019-12-07 18:05:18,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:05:18,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:05:18,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:05:18,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:05:18,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:05:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:05:18,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:05:20,003 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:05:20,003 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:05:20,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:20 BoogieIcfgContainer [2019-12-07 18:05:20,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:05:20,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:05:20,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:05:20,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:05:20,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:05:17" (1/3) ... [2019-12-07 18:05:20,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed09de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:05:20, skipping insertion in model container [2019-12-07 18:05:20,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:05:18" (2/3) ... [2019-12-07 18:05:20,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed09de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:05:20, skipping insertion in model container [2019-12-07 18:05:20,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:20" (3/3) ... [2019-12-07 18:05:20,008 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label19.c [2019-12-07 18:05:20,014 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:05:20,019 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:05:20,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:05:20,045 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:05:20,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:05:20,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:05:20,046 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:05:20,046 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:05:20,046 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:05:20,046 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:05:20,046 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:05:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 18:05:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:05:20,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:20,067 INFO L410 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-12-07 18:05:20,068 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-12-07 18:05:20,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:20,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332243788] [2019-12-07 18:05:20,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:20,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332243788] [2019-12-07 18:05:20,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:20,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:05:20,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995771955] [2019-12-07 18:05:20,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:20,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:20,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:20,243 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 18:05:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:22,655 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-12-07 18:05:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:22,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 18:05:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:22,680 INFO L225 Difference]: With dead ends: 1514 [2019-12-07 18:05:22,681 INFO L226 Difference]: Without dead ends: 1008 [2019-12-07 18:05:22,686 INFO L630 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-12-07 18:05:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-07 18:05:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-12-07 18:05:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 18:05:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-12-07 18:05:22,757 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 45 [2019-12-07 18:05:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:22,757 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-12-07 18:05:22,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-12-07 18:05:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 18:05:22,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:22,761 INFO L410 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-12-07 18:05:22,761 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:22,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:22,762 INFO L82 PathProgramCache]: Analyzing trace with hash 416619247, now seen corresponding path program 1 times [2019-12-07 18:05:22,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:22,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671269089] [2019-12-07 18:05:22,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:22,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671269089] [2019-12-07 18:05:22,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:22,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191973120] [2019-12-07 18:05:22,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:05:22,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:22,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:22,972 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-12-07 18:05:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:27,131 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-12-07 18:05:27,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:05:27,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-12-07 18:05:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:27,138 INFO L225 Difference]: With dead ends: 2303 [2019-12-07 18:05:27,138 INFO L226 Difference]: Without dead ends: 1628 [2019-12-07 18:05:27,140 INFO L630 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-12-07 18:05:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-12-07 18:05:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-12-07 18:05:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-07 18:05:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-12-07 18:05:27,167 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 110 [2019-12-07 18:05:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:27,168 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-12-07 18:05:27,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:05:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-12-07 18:05:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 18:05:27,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:27,171 INFO L410 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-12-07 18:05:27,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1808654100, now seen corresponding path program 1 times [2019-12-07 18:05:27,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:27,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807090507] [2019-12-07 18:05:27,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:27,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807090507] [2019-12-07 18:05:27,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:27,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:05:27,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926716623] [2019-12-07 18:05:27,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:27,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:27,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:27,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:27,253 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-12-07 18:05:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:29,224 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-12-07 18:05:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:29,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 18:05:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:29,238 INFO L225 Difference]: With dead ends: 3777 [2019-12-07 18:05:29,239 INFO L226 Difference]: Without dead ends: 2790 [2019-12-07 18:05:29,240 INFO L630 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-12-07 18:05:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-12-07 18:05:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-12-07 18:05:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-12-07 18:05:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-12-07 18:05:29,281 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 111 [2019-12-07 18:05:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:29,281 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-12-07 18:05:29,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-12-07 18:05:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 18:05:29,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:29,283 INFO L410 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-12-07 18:05:29,283 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 399406558, now seen corresponding path program 1 times [2019-12-07 18:05:29,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:29,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347307732] [2019-12-07 18:05:29,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:29,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347307732] [2019-12-07 18:05:29,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:29,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:05:29,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110867474] [2019-12-07 18:05:29,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:29,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:29,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:29,350 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-12-07 18:05:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:32,910 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-12-07 18:05:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:32,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 18:05:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:32,928 INFO L225 Difference]: With dead ends: 7368 [2019-12-07 18:05:32,928 INFO L226 Difference]: Without dead ends: 5484 [2019-12-07 18:05:32,930 INFO L630 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-12-07 18:05:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-12-07 18:05:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-12-07 18:05:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-12-07 18:05:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-12-07 18:05:32,999 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 115 [2019-12-07 18:05:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:32,999 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-12-07 18:05:32,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-12-07 18:05:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 18:05:33,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:33,000 INFO L410 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-12-07 18:05:33,000 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:33,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:33,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1837727490, now seen corresponding path program 1 times [2019-12-07 18:05:33,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:33,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190522656] [2019-12-07 18:05:33,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:33,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190522656] [2019-12-07 18:05:33,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:33,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:05:33,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599662247] [2019-12-07 18:05:33,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:05:33,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:33,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:05:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:05:33,062 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 3 states. [2019-12-07 18:05:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:34,323 INFO L93 Difference]: Finished difference Result 14842 states and 19263 transitions. [2019-12-07 18:05:34,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:05:34,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-12-07 18:05:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:34,347 INFO L225 Difference]: With dead ends: 14842 [2019-12-07 18:05:34,347 INFO L226 Difference]: Without dead ends: 7571 [2019-12-07 18:05:34,352 INFO L630 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-12-07 18:05:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-12-07 18:05:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-12-07 18:05:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-12-07 18:05:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8705 transitions. [2019-12-07 18:05:34,427 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8705 transitions. Word has length 136 [2019-12-07 18:05:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:34,427 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 8705 transitions. [2019-12-07 18:05:34,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:05:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8705 transitions. [2019-12-07 18:05:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-12-07 18:05:34,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:34,430 INFO L410 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-12-07 18:05:34,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1954499346, now seen corresponding path program 1 times [2019-12-07 18:05:34,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:34,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168721010] [2019-12-07 18:05:34,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:34,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168721010] [2019-12-07 18:05:34,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:34,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:34,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718217222] [2019-12-07 18:05:34,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:05:34,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:34,652 INFO L87 Difference]: Start difference. First operand 7571 states and 8705 transitions. Second operand 5 states. [2019-12-07 18:05:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:37,264 INFO L93 Difference]: Finished difference Result 22038 states and 25652 transitions. [2019-12-07 18:05:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:05:37,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2019-12-07 18:05:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:37,304 INFO L225 Difference]: With dead ends: 22038 [2019-12-07 18:05:37,304 INFO L226 Difference]: Without dead ends: 13871 [2019-12-07 18:05:37,310 INFO L630 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-12-07 18:05:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-12-07 18:05:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 10566. [2019-12-07 18:05:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10566 states. [2019-12-07 18:05:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10566 states to 10566 states and 12187 transitions. [2019-12-07 18:05:37,421 INFO L78 Accepts]: Start accepts. Automaton has 10566 states and 12187 transitions. Word has length 278 [2019-12-07 18:05:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 10566 states and 12187 transitions. [2019-12-07 18:05:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:05:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 10566 states and 12187 transitions. [2019-12-07 18:05:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-12-07 18:05:37,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:37,425 INFO L410 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-12-07 18:05:37,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash 81761830, now seen corresponding path program 1 times [2019-12-07 18:05:37,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:37,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876028057] [2019-12-07 18:05:37,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:37,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876028057] [2019-12-07 18:05:37,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58358205] [2019-12-07 18:05:37,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:05:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:37,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:05:37,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 18:05:38,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:05:38,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-12-07 18:05:38,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407528911] [2019-12-07 18:05:38,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:05:38,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:05:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:05:38,169 INFO L87 Difference]: Start difference. First operand 10566 states and 12187 transitions. Second operand 3 states. [2019-12-07 18:05:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:39,456 INFO L93 Difference]: Finished difference Result 23529 states and 26930 transitions. [2019-12-07 18:05:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:05:39,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-12-07 18:05:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:39,471 INFO L225 Difference]: With dead ends: 23529 [2019-12-07 18:05:39,471 INFO L226 Difference]: Without dead ends: 12965 [2019-12-07 18:05:39,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:05:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12965 states. [2019-12-07 18:05:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12965 to 12663. [2019-12-07 18:05:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12663 states. [2019-12-07 18:05:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12663 states to 12663 states and 14296 transitions. [2019-12-07 18:05:39,615 INFO L78 Accepts]: Start accepts. Automaton has 12663 states and 14296 transitions. Word has length 315 [2019-12-07 18:05:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:39,615 INFO L462 AbstractCegarLoop]: Abstraction has 12663 states and 14296 transitions. [2019-12-07 18:05:39,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:05:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 12663 states and 14296 transitions. [2019-12-07 18:05:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-12-07 18:05:39,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:39,620 INFO L410 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-12-07 18:05:39,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:39,820 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:39,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1938559075, now seen corresponding path program 1 times [2019-12-07 18:05:39,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:39,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641541123] [2019-12-07 18:05:39,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 18:05:40,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641541123] [2019-12-07 18:05:40,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:40,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:40,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542420215] [2019-12-07 18:05:40,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:05:40,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:40,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:40,211 INFO L87 Difference]: Start difference. First operand 12663 states and 14296 transitions. Second operand 5 states. [2019-12-07 18:05:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:42,125 INFO L93 Difference]: Finished difference Result 25924 states and 29231 transitions. [2019-12-07 18:05:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:42,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 363 [2019-12-07 18:05:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:42,145 INFO L225 Difference]: With dead ends: 25924 [2019-12-07 18:05:42,145 INFO L226 Difference]: Without dead ends: 13562 [2019-12-07 18:05:42,154 INFO L630 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-12-07 18:05:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13562 states. [2019-12-07 18:05:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13562 to 13560. [2019-12-07 18:05:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13560 states. [2019-12-07 18:05:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 15200 transitions. [2019-12-07 18:05:42,264 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 15200 transitions. Word has length 363 [2019-12-07 18:05:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:42,264 INFO L462 AbstractCegarLoop]: Abstraction has 13560 states and 15200 transitions. [2019-12-07 18:05:42,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:05:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 15200 transitions. [2019-12-07 18:05:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-12-07 18:05:42,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:42,269 INFO L410 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-12-07 18:05:42,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1680735344, now seen corresponding path program 1 times [2019-12-07 18:05:42,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:42,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528816077] [2019-12-07 18:05:42,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:05:42,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528816077] [2019-12-07 18:05:42,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:42,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:42,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594162455] [2019-12-07 18:05:42,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:42,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:42,488 INFO L87 Difference]: Start difference. First operand 13560 states and 15200 transitions. Second operand 4 states. [2019-12-07 18:05:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:44,651 INFO L93 Difference]: Finished difference Result 26824 states and 30109 transitions. [2019-12-07 18:05:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:44,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-12-07 18:05:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:44,665 INFO L225 Difference]: With dead ends: 26824 [2019-12-07 18:05:44,666 INFO L226 Difference]: Without dead ends: 13565 [2019-12-07 18:05:44,674 INFO L630 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-12-07 18:05:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13565 states. [2019-12-07 18:05:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13565 to 9965. [2019-12-07 18:05:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9965 states. [2019-12-07 18:05:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9965 states to 9965 states and 10838 transitions. [2019-12-07 18:05:44,755 INFO L78 Accepts]: Start accepts. Automaton has 9965 states and 10838 transitions. Word has length 422 [2019-12-07 18:05:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:44,755 INFO L462 AbstractCegarLoop]: Abstraction has 9965 states and 10838 transitions. [2019-12-07 18:05:44,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9965 states and 10838 transitions. [2019-12-07 18:05:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-12-07 18:05:44,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:44,760 INFO L410 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-12-07 18:05:44,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:44,760 INFO L82 PathProgramCache]: Analyzing trace with hash 81446721, now seen corresponding path program 1 times [2019-12-07 18:05:44,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:44,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254066618] [2019-12-07 18:05:44,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 285 proven. 70 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 18:05:45,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254066618] [2019-12-07 18:05:45,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274651391] [2019-12-07 18:05:45,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:05:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:45,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:05:45,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-12-07 18:05:45,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:05:45,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:05:45,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166748554] [2019-12-07 18:05:45,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:05:45,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:05:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:05:45,617 INFO L87 Difference]: Start difference. First operand 9965 states and 10838 transitions. Second operand 3 states. [2019-12-07 18:05:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:46,784 INFO L93 Difference]: Finished difference Result 22618 states and 24825 transitions. [2019-12-07 18:05:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:05:46,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2019-12-07 18:05:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:46,793 INFO L225 Difference]: With dead ends: 22618 [2019-12-07 18:05:46,793 INFO L226 Difference]: Without dead ends: 12655 [2019-12-07 18:05:46,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 506 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:05:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2019-12-07 18:05:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 10861. [2019-12-07 18:05:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-12-07 18:05:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11939 transitions. [2019-12-07 18:05:46,871 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11939 transitions. Word has length 506 [2019-12-07 18:05:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:46,872 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11939 transitions. [2019-12-07 18:05:46,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:05:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11939 transitions. [2019-12-07 18:05:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-12-07 18:05:46,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:46,878 INFO L410 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-12-07 18:05:47,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:47,079 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash -459851816, now seen corresponding path program 1 times [2019-12-07 18:05:47,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:47,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360034349] [2019-12-07 18:05:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 18:05:47,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360034349] [2019-12-07 18:05:47,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:47,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:47,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61793771] [2019-12-07 18:05:47,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:47,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:47,396 INFO L87 Difference]: Start difference. First operand 10861 states and 11939 transitions. Second operand 4 states. [2019-12-07 18:05:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:49,668 INFO L93 Difference]: Finished difference Result 28299 states and 31302 transitions. [2019-12-07 18:05:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:49,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 551 [2019-12-07 18:05:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:49,687 INFO L225 Difference]: With dead ends: 28299 [2019-12-07 18:05:49,687 INFO L226 Difference]: Without dead ends: 17440 [2019-12-07 18:05:49,694 INFO L630 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-12-07 18:05:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17440 states. [2019-12-07 18:05:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17440 to 17141. [2019-12-07 18:05:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17141 states. [2019-12-07 18:05:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17141 states to 17141 states and 18393 transitions. [2019-12-07 18:05:49,809 INFO L78 Accepts]: Start accepts. Automaton has 17141 states and 18393 transitions. Word has length 551 [2019-12-07 18:05:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:49,810 INFO L462 AbstractCegarLoop]: Abstraction has 17141 states and 18393 transitions. [2019-12-07 18:05:49,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17141 states and 18393 transitions. [2019-12-07 18:05:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-12-07 18:05:49,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:49,818 INFO L410 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-12-07 18:05:49,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash -225226931, now seen corresponding path program 1 times [2019-12-07 18:05:49,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:49,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53268023] [2019-12-07 18:05:49,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:05:50,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53268023] [2019-12-07 18:05:50,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:50,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:50,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083649539] [2019-12-07 18:05:50,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:50,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:50,134 INFO L87 Difference]: Start difference. First operand 17141 states and 18393 transitions. Second operand 4 states. [2019-12-07 18:05:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:51,731 INFO L93 Difference]: Finished difference Result 34283 states and 36790 transitions. [2019-12-07 18:05:51,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:05:51,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-12-07 18:05:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:51,742 INFO L225 Difference]: With dead ends: 34283 [2019-12-07 18:05:51,742 INFO L226 Difference]: Without dead ends: 17144 [2019-12-07 18:05:51,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17144 states. [2019-12-07 18:05:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17144 to 16241. [2019-12-07 18:05:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16241 states. [2019-12-07 18:05:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16241 states to 16241 states and 17255 transitions. [2019-12-07 18:05:51,857 INFO L78 Accepts]: Start accepts. Automaton has 16241 states and 17255 transitions. Word has length 609 [2019-12-07 18:05:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:51,857 INFO L462 AbstractCegarLoop]: Abstraction has 16241 states and 17255 transitions. [2019-12-07 18:05:51,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16241 states and 17255 transitions. [2019-12-07 18:05:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-12-07 18:05:51,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:51,864 INFO L410 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-12-07 18:05:51,864 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 335196122, now seen corresponding path program 1 times [2019-12-07 18:05:51,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:51,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712004047] [2019-12-07 18:05:51,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 516 proven. 173 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:05:52,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712004047] [2019-12-07 18:05:52,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609848103] [2019-12-07 18:05:52,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:05:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:52,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:05:52,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:52,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:05:52,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:52,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:52,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:52,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:52,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:52,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 602 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:05:53,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:53,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-12-07 18:05:53,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180985873] [2019-12-07 18:05:53,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:05:53,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:53,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:05:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:05:53,054 INFO L87 Difference]: Start difference. First operand 16241 states and 17255 transitions. Second operand 9 states. [2019-12-07 18:06:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:07,915 INFO L93 Difference]: Finished difference Result 53460 states and 56374 transitions. [2019-12-07 18:06:07,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:06:07,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 661 [2019-12-07 18:06:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:07,941 INFO L225 Difference]: With dead ends: 53460 [2019-12-07 18:06:07,941 INFO L226 Difference]: Without dead ends: 36623 [2019-12-07 18:06:07,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 680 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:06:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36623 states. [2019-12-07 18:06:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36623 to 22230. [2019-12-07 18:06:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22230 states. [2019-12-07 18:06:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22230 states to 22230 states and 23279 transitions. [2019-12-07 18:06:08,206 INFO L78 Accepts]: Start accepts. Automaton has 22230 states and 23279 transitions. Word has length 661 [2019-12-07 18:06:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:08,206 INFO L462 AbstractCegarLoop]: Abstraction has 22230 states and 23279 transitions. [2019-12-07 18:06:08,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:06:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22230 states and 23279 transitions. [2019-12-07 18:06:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-12-07 18:06:08,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:08,213 INFO L410 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-12-07 18:06:08,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:08,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash 378264636, now seen corresponding path program 1 times [2019-12-07 18:06:08,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:08,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480162147] [2019-12-07 18:06:08,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 107 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:10,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480162147] [2019-12-07 18:06:10,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558138558] [2019-12-07 18:06:10,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:06:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:10,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:06:10,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:10,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:10,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-12-07 18:06:10,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:06:10,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 18:06:10,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638293506] [2019-12-07 18:06:10,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:10,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:06:10,604 INFO L87 Difference]: Start difference. First operand 22230 states and 23279 transitions. Second operand 3 states. [2019-12-07 18:06:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:15,969 INFO L93 Difference]: Finished difference Result 26418 states and 27562 transitions. [2019-12-07 18:06:15,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:15,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-12-07 18:06:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:15,987 INFO L225 Difference]: With dead ends: 26418 [2019-12-07 18:06:15,987 INFO L226 Difference]: Without dead ends: 26416 [2019-12-07 18:06:15,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 688 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:06:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26416 states. [2019-12-07 18:06:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26416 to 22529. [2019-12-07 18:06:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22529 states. [2019-12-07 18:06:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22529 states to 22529 states and 23580 transitions. [2019-12-07 18:06:16,157 INFO L78 Accepts]: Start accepts. Automaton has 22529 states and 23580 transitions. Word has length 689 [2019-12-07 18:06:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:16,158 INFO L462 AbstractCegarLoop]: Abstraction has 22529 states and 23580 transitions. [2019-12-07 18:06:16,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 22529 states and 23580 transitions. [2019-12-07 18:06:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-12-07 18:06:16,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:16,166 INFO L410 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-12-07 18:06:16,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:16,367 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash 151347988, now seen corresponding path program 1 times [2019-12-07 18:06:16,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:16,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548993561] [2019-12-07 18:06:16,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 572 proven. 106 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-12-07 18:06:17,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548993561] [2019-12-07 18:06:17,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420602292] [2019-12-07 18:06:17,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:06:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:17,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:06:17,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:17,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:17,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:19,658 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-12-07 18:06:21,693 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-12-07 18:06:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 43 not checked. [2019-12-07 18:06:30,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:06:30,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2019-12-07 18:06:30,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520958656] [2019-12-07 18:06:30,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:06:30,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:06:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=80, Unknown=2, NotChecked=38, Total=156 [2019-12-07 18:06:30,611 INFO L87 Difference]: Start difference. First operand 22529 states and 23580 transitions. Second operand 13 states. [2019-12-07 18:06:36,108 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-12-07 18:06:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:41,572 INFO L93 Difference]: Finished difference Result 55478 states and 57915 transitions. [2019-12-07 18:06:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:06:41,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 697 [2019-12-07 18:06:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:41,594 INFO L225 Difference]: With dead ends: 55478 [2019-12-07 18:06:41,594 INFO L226 Difference]: Without dead ends: 32951 [2019-12-07 18:06:41,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 697 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=53, Invalid=138, Unknown=3, NotChecked=78, Total=272 [2019-12-07 18:06:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32951 states. [2019-12-07 18:06:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32951 to 24411. [2019-12-07 18:06:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24411 states. [2019-12-07 18:06:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24411 states to 24411 states and 25533 transitions. [2019-12-07 18:06:41,815 INFO L78 Accepts]: Start accepts. Automaton has 24411 states and 25533 transitions. Word has length 697 [2019-12-07 18:06:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:41,816 INFO L462 AbstractCegarLoop]: Abstraction has 24411 states and 25533 transitions. [2019-12-07 18:06:41,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:06:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 24411 states and 25533 transitions. [2019-12-07 18:06:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2019-12-07 18:06:41,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:41,824 INFO L410 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-12-07 18:06:42,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:42,025 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash -717755273, now seen corresponding path program 1 times [2019-12-07 18:06:42,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:42,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110383913] [2019-12-07 18:06:42,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-12-07 18:06:42,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110383913] [2019-12-07 18:06:42,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:42,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:06:42,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768943972] [2019-12-07 18:06:42,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:42,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:06:42,427 INFO L87 Difference]: Start difference. First operand 24411 states and 25533 transitions. Second operand 3 states. [2019-12-07 18:06:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:43,467 INFO L93 Difference]: Finished difference Result 49117 states and 51367 transitions. [2019-12-07 18:06:43,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:43,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 718 [2019-12-07 18:06:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:43,485 INFO L225 Difference]: With dead ends: 49117 [2019-12-07 18:06:43,485 INFO L226 Difference]: Without dead ends: 24708 [2019-12-07 18:06:43,493 INFO L630 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-12-07 18:06:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24708 states. [2019-12-07 18:06:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24708 to 24409. [2019-12-07 18:06:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24409 states. [2019-12-07 18:06:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24409 states to 24409 states and 25529 transitions. [2019-12-07 18:06:43,677 INFO L78 Accepts]: Start accepts. Automaton has 24409 states and 25529 transitions. Word has length 718 [2019-12-07 18:06:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:43,678 INFO L462 AbstractCegarLoop]: Abstraction has 24409 states and 25529 transitions. [2019-12-07 18:06:43,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24409 states and 25529 transitions. [2019-12-07 18:06:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-12-07 18:06:43,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:43,694 INFO L410 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-12-07 18:06:43,694 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1690318276, now seen corresponding path program 1 times [2019-12-07 18:06:43,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:43,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137859338] [2019-12-07 18:06:43,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-12-07 18:06:44,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137859338] [2019-12-07 18:06:44,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:44,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:06:44,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570659391] [2019-12-07 18:06:44,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:06:44,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:44,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:06:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:06:44,244 INFO L87 Difference]: Start difference. First operand 24409 states and 25529 transitions. Second operand 5 states. [2019-12-07 18:06:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:47,112 INFO L93 Difference]: Finished difference Result 54506 states and 56872 transitions. [2019-12-07 18:06:47,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:06:47,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 842 [2019-12-07 18:06:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:47,136 INFO L225 Difference]: With dead ends: 54506 [2019-12-07 18:06:47,136 INFO L226 Difference]: Without dead ends: 29497 [2019-12-07 18:06:47,146 INFO L630 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-12-07 18:06:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29497 states. [2019-12-07 18:06:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29497 to 22610. [2019-12-07 18:06:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22610 states. [2019-12-07 18:06:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22610 states to 22610 states and 23415 transitions. [2019-12-07 18:06:47,347 INFO L78 Accepts]: Start accepts. Automaton has 22610 states and 23415 transitions. Word has length 842 [2019-12-07 18:06:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:47,348 INFO L462 AbstractCegarLoop]: Abstraction has 22610 states and 23415 transitions. [2019-12-07 18:06:47,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:06:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22610 states and 23415 transitions. [2019-12-07 18:06:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2019-12-07 18:06:47,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:47,364 INFO L410 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-12-07 18:06:47,364 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 591902161, now seen corresponding path program 1 times [2019-12-07 18:06:47,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:47,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242634264] [2019-12-07 18:06:47,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-12-07 18:06:47,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242634264] [2019-12-07 18:06:47,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:47,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:06:47,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099469764] [2019-12-07 18:06:47,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:47,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:06:47,806 INFO L87 Difference]: Start difference. First operand 22610 states and 23415 transitions. Second operand 3 states. [2019-12-07 18:06:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:48,818 INFO L93 Difference]: Finished difference Result 47309 states and 48970 transitions. [2019-12-07 18:06:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:48,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 845 [2019-12-07 18:06:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:48,835 INFO L225 Difference]: With dead ends: 47309 [2019-12-07 18:06:48,835 INFO L226 Difference]: Without dead ends: 20802 [2019-12-07 18:06:48,844 INFO L630 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-12-07 18:06:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2019-12-07 18:06:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 20204. [2019-12-07 18:06:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20204 states. [2019-12-07 18:06:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20204 states to 20204 states and 20786 transitions. [2019-12-07 18:06:48,998 INFO L78 Accepts]: Start accepts. Automaton has 20204 states and 20786 transitions. Word has length 845 [2019-12-07 18:06:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:48,998 INFO L462 AbstractCegarLoop]: Abstraction has 20204 states and 20786 transitions. [2019-12-07 18:06:48,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20204 states and 20786 transitions. [2019-12-07 18:06:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-12-07 18:06:49,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:49,012 INFO L410 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-12-07 18:06:49,012 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1103935205, now seen corresponding path program 1 times [2019-12-07 18:06:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:49,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588193171] [2019-12-07 18:06:49,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-12-07 18:06:49,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588193171] [2019-12-07 18:06:49,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:49,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:06:49,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291530213] [2019-12-07 18:06:49,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:49,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:06:49,500 INFO L87 Difference]: Start difference. First operand 20204 states and 20786 transitions. Second operand 3 states. [2019-12-07 18:06:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:50,361 INFO L93 Difference]: Finished difference Result 41298 states and 42530 transitions. [2019-12-07 18:06:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:50,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2019-12-07 18:06:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:50,376 INFO L225 Difference]: With dead ends: 41298 [2019-12-07 18:06:50,377 INFO L226 Difference]: Without dead ends: 22892 [2019-12-07 18:06:50,383 INFO L630 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-12-07 18:06:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22892 states. [2019-12-07 18:06:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22892 to 21696. [2019-12-07 18:06:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-12-07 18:06:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 22272 transitions. [2019-12-07 18:06:50,547 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 22272 transitions. Word has length 847 [2019-12-07 18:06:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:50,547 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 22272 transitions. [2019-12-07 18:06:50,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 22272 transitions. [2019-12-07 18:06:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-12-07 18:06:50,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:50,556 INFO L410 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-12-07 18:06:50,556 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 76724679, now seen corresponding path program 1 times [2019-12-07 18:06:50,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:50,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348554833] [2019-12-07 18:06:50,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 1000 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-12-07 18:06:51,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348554833] [2019-12-07 18:06:51,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:51,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:06:51,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571563710] [2019-12-07 18:06:51,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:06:51,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:51,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:06:51,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:06:51,418 INFO L87 Difference]: Start difference. First operand 21696 states and 22272 transitions. Second operand 5 states. [2019-12-07 18:06:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:52,803 INFO L93 Difference]: Finished difference Result 44014 states and 45186 transitions. [2019-12-07 18:06:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:06:52,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 861 [2019-12-07 18:06:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:52,818 INFO L225 Difference]: With dead ends: 44014 [2019-12-07 18:06:52,819 INFO L226 Difference]: Without dead ends: 22918 [2019-12-07 18:06:52,826 INFO L630 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-12-07 18:06:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22918 states. [2019-12-07 18:06:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22918 to 21696. [2019-12-07 18:06:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-12-07 18:06:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 22250 transitions. [2019-12-07 18:06:52,990 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 22250 transitions. Word has length 861 [2019-12-07 18:06:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:52,991 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 22250 transitions. [2019-12-07 18:06:52,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:06:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 22250 transitions. [2019-12-07 18:06:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-12-07 18:06:53,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:53,003 INFO L410 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-12-07 18:06:53,004 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:53,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1531465597, now seen corresponding path program 1 times [2019-12-07 18:06:53,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:53,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935434807] [2019-12-07 18:06:53,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-12-07 18:06:53,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935434807] [2019-12-07 18:06:53,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:53,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:06:53,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875200203] [2019-12-07 18:06:53,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:53,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:06:53,544 INFO L87 Difference]: Start difference. First operand 21696 states and 22250 transitions. Second operand 3 states. [2019-12-07 18:06:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:54,376 INFO L93 Difference]: Finished difference Result 43686 states and 44833 transitions. [2019-12-07 18:06:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:54,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 868 [2019-12-07 18:06:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:54,392 INFO L225 Difference]: With dead ends: 43686 [2019-12-07 18:06:54,392 INFO L226 Difference]: Without dead ends: 23489 [2019-12-07 18:06:54,400 INFO L630 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-12-07 18:06:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23489 states. [2019-12-07 18:06:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23489 to 21394. [2019-12-07 18:06:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21394 states. [2019-12-07 18:06:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 21903 transitions. [2019-12-07 18:06:54,564 INFO L78 Accepts]: Start accepts. Automaton has 21394 states and 21903 transitions. Word has length 868 [2019-12-07 18:06:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:54,564 INFO L462 AbstractCegarLoop]: Abstraction has 21394 states and 21903 transitions. [2019-12-07 18:06:54,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21394 states and 21903 transitions. [2019-12-07 18:06:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-12-07 18:06:54,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:54,573 INFO L410 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-12-07 18:06:54,573 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash -154291092, now seen corresponding path program 1 times [2019-12-07 18:06:54,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:54,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792638517] [2019-12-07 18:06:54,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 989 proven. 286 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-12-07 18:06:56,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792638517] [2019-12-07 18:06:56,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827047746] [2019-12-07 18:06:56,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:06:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:56,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:06:56,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:56,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:06:56,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:56,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:56,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:56,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:56,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:56,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:56,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:06:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1203 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-12-07 18:06:57,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:06:57,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-12-07 18:06:57,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200561652] [2019-12-07 18:06:57,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:06:57,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:57,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:06:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:06:57,232 INFO L87 Difference]: Start difference. First operand 21394 states and 21903 transitions. Second operand 16 states. [2019-12-07 18:07:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:07,896 INFO L93 Difference]: Finished difference Result 41538 states and 42493 transitions. [2019-12-07 18:07:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 18:07:07,897 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 887 [2019-12-07 18:07:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:07,911 INFO L225 Difference]: With dead ends: 41538 [2019-12-07 18:07:07,911 INFO L226 Difference]: Without dead ends: 21942 [2019-12-07 18:07:07,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 905 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:07:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21942 states. [2019-12-07 18:07:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21942 to 18688. [2019-12-07 18:07:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18688 states. [2019-12-07 18:07:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18688 states to 18688 states and 19098 transitions. [2019-12-07 18:07:08,068 INFO L78 Accepts]: Start accepts. Automaton has 18688 states and 19098 transitions. Word has length 887 [2019-12-07 18:07:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:08,069 INFO L462 AbstractCegarLoop]: Abstraction has 18688 states and 19098 transitions. [2019-12-07 18:07:08,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:07:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 18688 states and 19098 transitions. [2019-12-07 18:07:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2019-12-07 18:07:08,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:08,077 INFO L410 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-12-07 18:07:08,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:08,278 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1903949696, now seen corresponding path program 1 times [2019-12-07 18:07:08,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:08,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302007060] [2019-12-07 18:07:08,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 996 proven. 198 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-12-07 18:07:09,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302007060] [2019-12-07 18:07:09,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022936379] [2019-12-07 18:07:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:07:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:07:09,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:09,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:09,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-12-07 18:07:10,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:07:10,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-12-07 18:07:10,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201212903] [2019-12-07 18:07:10,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:10,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:07:10,308 INFO L87 Difference]: Start difference. First operand 18688 states and 19098 transitions. Second operand 4 states. [2019-12-07 18:07:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:12,439 INFO L93 Difference]: Finished difference Result 41873 states and 42813 transitions. [2019-12-07 18:07:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:12,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 893 [2019-12-07 18:07:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:12,460 INFO L225 Difference]: With dead ends: 41873 [2019-12-07 18:07:12,460 INFO L226 Difference]: Without dead ends: 24598 [2019-12-07 18:07:12,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 894 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:07:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24598 states. [2019-12-07 18:07:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24598 to 20101. [2019-12-07 18:07:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20101 states. [2019-12-07 18:07:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20101 states to 20101 states and 20528 transitions. [2019-12-07 18:07:12,631 INFO L78 Accepts]: Start accepts. Automaton has 20101 states and 20528 transitions. Word has length 893 [2019-12-07 18:07:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:12,632 INFO L462 AbstractCegarLoop]: Abstraction has 20101 states and 20528 transitions. [2019-12-07 18:07:12,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 20101 states and 20528 transitions. [2019-12-07 18:07:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-12-07 18:07:12,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:12,641 INFO L410 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-12-07 18:07:12,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:12,842 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1722502239, now seen corresponding path program 1 times [2019-12-07 18:07:12,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:12,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884139037] [2019-12-07 18:07:12,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 985 proven. 182 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-12-07 18:07:13,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884139037] [2019-12-07 18:07:13,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681392175] [2019-12-07 18:07:13,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:07:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:13,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:07:13,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-12-07 18:07:14,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:07:14,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-12-07 18:07:14,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007494553] [2019-12-07 18:07:14,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:14,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:14,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:14,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:07:14,234 INFO L87 Difference]: Start difference. First operand 20101 states and 20528 transitions. Second operand 4 states. [2019-12-07 18:07:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:16,318 INFO L93 Difference]: Finished difference Result 44400 states and 45367 transitions. [2019-12-07 18:07:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:16,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 922 [2019-12-07 18:07:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:16,337 INFO L225 Difference]: With dead ends: 44400 [2019-12-07 18:07:16,337 INFO L226 Difference]: Without dead ends: 25798 [2019-12-07 18:07:16,344 INFO L630 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-12-07 18:07:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25798 states. [2019-12-07 18:07:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25798 to 19204. [2019-12-07 18:07:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-12-07 18:07:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 19616 transitions. [2019-12-07 18:07:16,517 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 19616 transitions. Word has length 922 [2019-12-07 18:07:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:16,518 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 19616 transitions. [2019-12-07 18:07:16,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 19616 transitions. [2019-12-07 18:07:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-12-07 18:07:16,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:16,529 INFO L410 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-12-07 18:07:16,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:16,730 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash -175244572, now seen corresponding path program 1 times [2019-12-07 18:07:16,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:16,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214542764] [2019-12-07 18:07:16,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 978 proven. 144 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-12-07 18:07:17,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214542764] [2019-12-07 18:07:17,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089819061] [2019-12-07 18:07:17,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:07:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:17,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:07:17,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:17,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:17,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-12-07 18:07:18,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:07:18,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-12-07 18:07:18,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548852871] [2019-12-07 18:07:18,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:18,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:07:18,339 INFO L87 Difference]: Start difference. First operand 19204 states and 19616 transitions. Second operand 4 states. [2019-12-07 18:07:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:19,679 INFO L93 Difference]: Finished difference Result 45297 states and 46295 transitions. [2019-12-07 18:07:19,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:19,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1005 [2019-12-07 18:07:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:19,698 INFO L225 Difference]: With dead ends: 45297 [2019-12-07 18:07:19,699 INFO L226 Difference]: Without dead ends: 27592 [2019-12-07 18:07:19,707 INFO L630 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-12-07 18:07:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27592 states. [2019-12-07 18:07:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27592 to 21299. [2019-12-07 18:07:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21299 states. [2019-12-07 18:07:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21299 states to 21299 states and 21777 transitions. [2019-12-07 18:07:19,893 INFO L78 Accepts]: Start accepts. Automaton has 21299 states and 21777 transitions. Word has length 1005 [2019-12-07 18:07:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:19,893 INFO L462 AbstractCegarLoop]: Abstraction has 21299 states and 21777 transitions. [2019-12-07 18:07:19,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21299 states and 21777 transitions. [2019-12-07 18:07:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-12-07 18:07:19,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:19,905 INFO L410 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-12-07 18:07:20,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:20,106 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1147207921, now seen corresponding path program 1 times [2019-12-07 18:07:20,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:20,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486274370] [2019-12-07 18:07:20,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1093 proven. 343 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-12-07 18:07:22,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486274370] [2019-12-07 18:07:22,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843606948] [2019-12-07 18:07:22,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:07:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:07:22,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-12-07 18:07:23,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:07:23,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-12-07 18:07:23,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192100322] [2019-12-07 18:07:23,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:23,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:07:23,652 INFO L87 Difference]: Start difference. First operand 21299 states and 21777 transitions. Second operand 5 states. [2019-12-07 18:07:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:24,948 INFO L93 Difference]: Finished difference Result 41115 states and 42054 transitions. [2019-12-07 18:07:24,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:24,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1043 [2019-12-07 18:07:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:24,968 INFO L225 Difference]: With dead ends: 41115 [2019-12-07 18:07:24,969 INFO L226 Difference]: Without dead ends: 19513 [2019-12-07 18:07:24,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1042 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:07:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19513 states. [2019-12-07 18:07:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19513 to 19495. [2019-12-07 18:07:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19495 states. [2019-12-07 18:07:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19495 states to 19495 states and 19819 transitions. [2019-12-07 18:07:25,132 INFO L78 Accepts]: Start accepts. Automaton has 19495 states and 19819 transitions. Word has length 1043 [2019-12-07 18:07:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:25,133 INFO L462 AbstractCegarLoop]: Abstraction has 19495 states and 19819 transitions. [2019-12-07 18:07:25,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19495 states and 19819 transitions. [2019-12-07 18:07:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2019-12-07 18:07:25,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:25,144 INFO L410 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-12-07 18:07:25,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:25,345 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash -813641473, now seen corresponding path program 1 times [2019-12-07 18:07:25,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:25,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329809350] [2019-12-07 18:07:25,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 1403 proven. 102 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-12-07 18:07:27,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329809350] [2019-12-07 18:07:27,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741156060] [2019-12-07 18:07:27,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:07:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:27,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:07:27,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:27,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:36,102 WARN L192 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2019-12-07 18:07:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-12-07 18:07:36,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:07:36,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-12-07 18:07:36,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375596498] [2019-12-07 18:07:36,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:36,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:07:36,876 INFO L87 Difference]: Start difference. First operand 19495 states and 19819 transitions. Second operand 4 states. [2019-12-07 18:07:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:38,700 INFO L93 Difference]: Finished difference Result 40790 states and 41467 transitions. [2019-12-07 18:07:38,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:38,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1093 [2019-12-07 18:07:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:38,718 INFO L225 Difference]: With dead ends: 40790 [2019-12-07 18:07:38,718 INFO L226 Difference]: Without dead ends: 22495 [2019-12-07 18:07:38,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:07:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22495 states. [2019-12-07 18:07:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22495 to 14404. [2019-12-07 18:07:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14404 states. [2019-12-07 18:07:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14404 states to 14404 states and 14621 transitions. [2019-12-07 18:07:38,909 INFO L78 Accepts]: Start accepts. Automaton has 14404 states and 14621 transitions. Word has length 1093 [2019-12-07 18:07:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:38,910 INFO L462 AbstractCegarLoop]: Abstraction has 14404 states and 14621 transitions. [2019-12-07 18:07:38,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14404 states and 14621 transitions. [2019-12-07 18:07:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2019-12-07 18:07:38,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:38,920 INFO L410 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-12-07 18:07:39,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:39,121 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1246778028, now seen corresponding path program 1 times [2019-12-07 18:07:39,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:39,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516685067] [2019-12-07 18:07:39,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 1080 proven. 628 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-12-07 18:07:40,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516685067] [2019-12-07 18:07:40,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009003640] [2019-12-07 18:07:40,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:07:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:40,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:07:40,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:07:40,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:40,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 1158 proven. 86 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-12-07 18:07:44,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:07:44,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-12-07 18:07:44,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267231704] [2019-12-07 18:07:44,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:07:44,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:07:44,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:07:44,681 INFO L87 Difference]: Start difference. First operand 14404 states and 14621 transitions. Second operand 13 states. [2019-12-07 18:08:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:04,761 INFO L93 Difference]: Finished difference Result 39555 states and 40135 transitions. [2019-12-07 18:08:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 18:08:04,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1122 [2019-12-07 18:08:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:04,780 INFO L225 Difference]: With dead ends: 39555 [2019-12-07 18:08:04,780 INFO L226 Difference]: Without dead ends: 25448 [2019-12-07 18:08:04,785 INFO L630 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-12-07 18:08:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25448 states. [2019-12-07 18:08:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25448 to 14702. [2019-12-07 18:08:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-12-07 18:08:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 14883 transitions. [2019-12-07 18:08:04,936 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 14883 transitions. Word has length 1122 [2019-12-07 18:08:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:04,937 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 14883 transitions. [2019-12-07 18:08:04,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:08:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 14883 transitions. [2019-12-07 18:08:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-12-07 18:08:04,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:04,949 INFO L410 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-12-07 18:08:05,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:08:05,150 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash -848873680, now seen corresponding path program 1 times [2019-12-07 18:08:05,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:05,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069649293] [2019-12-07 18:08:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1323 proven. 231 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-12-07 18:08:06,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069649293] [2019-12-07 18:08:06,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114815342] [2019-12-07 18:08:06,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/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-12-07 18:08:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:06,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:08:06,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:08:06,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:06,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:08:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1065 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-12-07 18:08:07,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:08:07,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 18:08:07,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440256277] [2019-12-07 18:08:07,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:07,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:08:07,460 INFO L87 Difference]: Start difference. First operand 14702 states and 14883 transitions. Second operand 4 states. [2019-12-07 18:08:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:08,931 INFO L93 Difference]: Finished difference Result 31800 states and 32196 transitions. [2019-12-07 18:08:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:08:08,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1181 [2019-12-07 18:08:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:08,932 INFO L225 Difference]: With dead ends: 31800 [2019-12-07 18:08:08,932 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:08:08,939 INFO L630 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-12-07 18:08:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:08:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:08:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:08:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:08:08,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1181 [2019-12-07 18:08:08,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:08,940 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:08:08,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:08:08,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:08:09,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:08:09,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:08:12,266 WARN L192 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 2080 DAG size of output: 1236 [2019-12-07 18:08:15,155 WARN L192 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 1529 DAG size of output: 1234 [2019-12-07 18:08:16,573 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 1006 DAG size of output: 886 [2019-12-07 18:08:30,570 WARN L192 SmtUtils]: Spent 13.99 s on a formula simplification. DAG size of input: 1167 DAG size of output: 188 [2019-12-07 18:08:44,407 WARN L192 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 1166 DAG size of output: 188 [2019-12-07 18:08:53,378 WARN L192 SmtUtils]: Spent 8.97 s on a formula simplification. DAG size of input: 849 DAG size of output: 177 [2019-12-07 18:08:53,381 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,381 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,381 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,381 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,381 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,382 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,383 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:08:53,384 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 18:08:53,385 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,386 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,387 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,388 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,389 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,390 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,391 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse35 (+ ~a29~0 16)) (.cse34 (+ ~a4~0 86))) (let ((.cse4 (+ ~a29~0 127)) (.cse2 (+ ~a0~0 44)) (.cse33 (+ ~a29~0 144)) (.cse26 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse30 (< 0 .cse34)) (.cse10 (<= .cse35 0)) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse28 (= 3 ~a2~0)) (.cse1 (= 1 ~a2~0))) (let ((.cse14 (not .cse1)) (.cse15 (not .cse28)) (.cse24 (or .cse26 .cse30 .cse10 .cse12)) (.cse11 (= 5 ~a2~0)) (.cse25 (<= 4453 ~a29~0)) (.cse13 (<= (+ ~a0~0 242851) 0)) (.cse19 (<= .cse33 0)) (.cse18 (<= ~a0~0 599976)) (.cse5 (<= .cse2 0)) (.cse22 (<= ~a29~0 43)) (.cse20 (= 2 ~a2~0)) (.cse16 (< 0 .cse35)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse21 (<= (+ ~a0~0 98) 0)) (.cse9 (<= 0 (+ ~a0~0 146))) (.cse6 (<= 0 .cse4)) (.cse27 (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)))) (.cse23 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse32 (<= ~a0~0 599920)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse31 (<= 0 (+ ~a0~0 97))) (.cse17 (= 4 ~a2~0)) (.cse0 (<= .cse34 0)) (.cse3 (< 0 .cse33))) (or (and .cse0 (<= (+ ~a4~0 89) 0) .cse1 (<= 0 .cse2) .cse3 (<= .cse4 0) .cse5 .cse6) (and .cse0 .cse7) (and .cse8 .cse9 .cse10 .cse3 .cse11 .cse12) (and .cse8 .cse13 .cse7 .cse14 .cse3 .cse11 .cse15) (and .cse8 .cse16 .cse7 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse17) (and .cse18 (or (and .cse0 .cse19 .cse14 .cse20 .cse15) (and .cse0 .cse10 .cse3 .cse20 .cse6))) (and .cse8 .cse13 .cse1 .cse6) (and .cse7 .cse14 .cse3 .cse20 .cse15) (and .cse21 .cse8 .cse9 .cse11 .cse6) (and .cse0 .cse14 .cse12) (and .cse0 .cse16 (or .cse22 .cse23) .cse18 .cse3 .cse24 .cse11) (and .cse8 .cse7 .cse14 .cse3 .cse11 .cse15 .cse25) (and (or (and .cse0 .cse26 .cse14 .cse20 .cse15 .cse6) (and .cse27 .cse0 .cse28)) .cse18) (and .cse8 .cse1 .cse9 .cse10 .cse3 .cse12) (and .cse0 .cse16 .cse18 .cse28) (and .cse0 .cse24 .cse18 .cse11 .cse25) (and .cse21 .cse8 .cse28) (and .cse8 (or (and .cse13 .cse10 .cse3 .cse17 .cse6) (and .cse7 .cse19 .cse17)) (exists ((v_~a0~0_830 Int)) (let ((.cse29 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse29 (- 278887)) 5) 1)) (< .cse29 278887) (not (= (mod (+ .cse29 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse8 .cse22 .cse20 .cse12 .cse6) (and .cse0 .cse16 (<= ~a29~0 42) .cse3 .cse18 .cse17) (and .cse8 .cse16 .cse30 .cse1 .cse22 .cse18) (and .cse0 .cse27 .cse31 .cse1 .cse5) (and .cse8 .cse7 .cse20) (and .cse8 .cse22 .cse28 .cse12 .cse6) (and .cse21 .cse8 (<= 43 ~a29~0) .cse20) (and .cse8 .cse16 .cse1 .cse7) (and .cse21 .cse8 .cse30 .cse1 .cse9) (and .cse0 .cse3 .cse17 .cse32) (and .cse8 .cse31 .cse12 .cse17 .cse6) (and .cse0 .cse27 .cse23 .cse17 .cse32) (and .cse8 .cse31 .cse10 .cse3 .cse12 .cse17) (and .cse0 .cse1 .cse3 .cse12))))) [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 18:08:53,392 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,393 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,394 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse37 (+ ~a29~0 144)) (.cse36 (+ ~a0~0 44)) (.cse35 (+ ~a4~0 86))) (let ((.cse4 (+ ~a29~0 127)) (.cse34 (+ ~a29~0 16)) (.cse0 (<= .cse35 0)) (.cse2 (<= 0 .cse36)) (.cse3 (< 0 .cse37)) (.cse26 (+ ~a0~0 147)) (.cse13 (= 3 ~a2~0)) (.cse1 (= 1 ~a2~0))) (let ((.cse15 (not .cse1)) (.cse16 (not .cse13)) (.cse14 (<= (+ ~a0~0 242851) 0)) (.cse18 (<= .cse37 0)) (.cse5 (<= .cse36 0)) (.cse20 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse11 (= 5 ~a2~0)) (.cse24 (<= 4453 ~a29~0)) (.cse7 (<= .cse26 0)) (.cse23 (or (and .cse0 .cse13) (and .cse2 .cse3 .cse13))) (.cse17 (<= ~a0~0 599976)) (.cse21 (< 0 .cse34)) (.cse29 (<= ~a29~0 43)) (.cse30 (< 0 .cse35)) (.cse9 (<= 0 (+ ~a0~0 146))) (.cse22 (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)))) (.cse31 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse33 (<= ~a0~0 599920)) (.cse32 (<= 0 (+ ~a0~0 97))) (.cse10 (<= .cse34 0)) (.cse27 (= 4 ~a2~0)) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse25 (<= (+ ~a0~0 98) 0)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse19 (= 2 ~a2~0)) (.cse6 (<= 0 .cse4))) (or (and .cse0 (<= (+ ~a4~0 89) 0) .cse1 .cse2 .cse3 (<= .cse4 0) .cse5 .cse6) (and .cse0 .cse7) (and .cse8 .cse9 .cse10 .cse3 .cse11 .cse12) (and .cse8 .cse10 .cse3 .cse13 .cse12 .cse6) (and .cse8 .cse14 .cse7 .cse15 .cse3 .cse11 .cse16) (and .cse8 .cse14 .cse1 .cse6) (and .cse17 (or (and .cse0 .cse18 .cse15 .cse19 .cse16) (and .cse0 .cse10 .cse3 .cse19 .cse6))) (and .cse7 .cse15 .cse3 .cse19 .cse16) (and .cse0 .cse15 .cse12) (and .cse17 (or (and .cse0 .cse20 .cse21 .cse15 .cse19 .cse16) (and .cse22 .cse23))) (and .cse8 .cse7 .cse15 .cse3 .cse11 .cse16 .cse24) (and .cse8 .cse1 .cse9 .cse10 .cse3 .cse12) (and .cse8 .cse7 .cse13) (and .cse25 .cse8 (< 0 .cse26) .cse11 .cse6) (and .cse8 (or (and .cse14 .cse27 .cse6) (and .cse7 .cse18 .cse27)) (exists ((v_~a0~0_830 Int)) (let ((.cse28 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse28 (- 278887)) 5) 1)) (< .cse28 278887) (not (= (mod (+ .cse28 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse8 .cse21 .cse7 .cse27) (and .cse8 .cse29 .cse19 .cse12 .cse6) (and .cse8 .cse21 .cse30 .cse1 .cse29 .cse17) (and .cse0 (or .cse20 .cse29) (or .cse29 .cse31) .cse21 .cse3 .cse17 .cse11) (and .cse0 .cse22 .cse32 .cse1 .cse5) (and .cse8 .cse7 .cse19) (and .cse0 .cse21 (<= ~a29~0 42) .cse17 .cse3 .cse27) (and .cse0 .cse20 .cse17 .cse11 .cse24) (and .cse8 .cse21 .cse1 .cse7) (and .cse0 .cse21 .cse23 .cse17) (and .cse8 .cse21 .cse30 .cse9 .cse29 .cse13 .cse12) (and .cse25 .cse8 .cse30 .cse1 .cse9) (and .cse0 .cse3 .cse27 .cse33) (and .cse8 .cse32 .cse12 .cse27 .cse6) (and .cse25 .cse8 .cse30 .cse9 .cse13) (and .cse0 .cse22 .cse31 .cse27 .cse33) (and .cse8 .cse32 .cse10 .cse3 .cse12 .cse27) (and .cse0 .cse1 .cse3 .cse12) (and .cse25 .cse8 .cse19 .cse6))))) [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,395 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 18:08:53,396 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,397 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,398 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse37 (+ ~a29~0 144)) (.cse36 (+ ~a0~0 44)) (.cse35 (+ ~a4~0 86))) (let ((.cse4 (+ ~a29~0 127)) (.cse34 (+ ~a29~0 16)) (.cse0 (<= .cse35 0)) (.cse2 (<= 0 .cse36)) (.cse3 (< 0 .cse37)) (.cse26 (+ ~a0~0 147)) (.cse13 (= 3 ~a2~0)) (.cse1 (= 1 ~a2~0))) (let ((.cse15 (not .cse1)) (.cse16 (not .cse13)) (.cse14 (<= (+ ~a0~0 242851) 0)) (.cse18 (<= .cse37 0)) (.cse5 (<= .cse36 0)) (.cse20 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse11 (= 5 ~a2~0)) (.cse24 (<= 4453 ~a29~0)) (.cse7 (<= .cse26 0)) (.cse23 (or (and .cse0 .cse13) (and .cse2 .cse3 .cse13))) (.cse17 (<= ~a0~0 599976)) (.cse21 (< 0 .cse34)) (.cse29 (<= ~a29~0 43)) (.cse30 (< 0 .cse35)) (.cse9 (<= 0 (+ ~a0~0 146))) (.cse22 (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)))) (.cse31 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse33 (<= ~a0~0 599920)) (.cse32 (<= 0 (+ ~a0~0 97))) (.cse10 (<= .cse34 0)) (.cse27 (= 4 ~a2~0)) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse25 (<= (+ ~a0~0 98) 0)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse19 (= 2 ~a2~0)) (.cse6 (<= 0 .cse4))) (or (and .cse0 (<= (+ ~a4~0 89) 0) .cse1 .cse2 .cse3 (<= .cse4 0) .cse5 .cse6) (and .cse0 .cse7) (and .cse8 .cse9 .cse10 .cse3 .cse11 .cse12) (and .cse8 .cse10 .cse3 .cse13 .cse12 .cse6) (and .cse8 .cse14 .cse7 .cse15 .cse3 .cse11 .cse16) (and .cse8 .cse14 .cse1 .cse6) (and .cse17 (or (and .cse0 .cse18 .cse15 .cse19 .cse16) (and .cse0 .cse10 .cse3 .cse19 .cse6))) (and .cse7 .cse15 .cse3 .cse19 .cse16) (and .cse0 .cse15 .cse12) (and .cse17 (or (and .cse0 .cse20 .cse21 .cse15 .cse19 .cse16) (and .cse22 .cse23))) (and .cse8 .cse7 .cse15 .cse3 .cse11 .cse16 .cse24) (and .cse8 .cse1 .cse9 .cse10 .cse3 .cse12) (and .cse8 .cse7 .cse13) (and .cse25 .cse8 (< 0 .cse26) .cse11 .cse6) (and .cse8 (or (and .cse14 .cse27 .cse6) (and .cse7 .cse18 .cse27)) (exists ((v_~a0~0_830 Int)) (let ((.cse28 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse28 (- 278887)) 5) 1)) (< .cse28 278887) (not (= (mod (+ .cse28 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse8 .cse21 .cse7 .cse27) (and .cse8 .cse29 .cse19 .cse12 .cse6) (and .cse8 .cse21 .cse30 .cse1 .cse29 .cse17) (and .cse0 (or .cse20 .cse29) (or .cse29 .cse31) .cse21 .cse3 .cse17 .cse11) (and .cse0 .cse22 .cse32 .cse1 .cse5) (and .cse8 .cse7 .cse19) (and .cse0 .cse21 (<= ~a29~0 42) .cse17 .cse3 .cse27) (and .cse0 .cse20 .cse17 .cse11 .cse24) (and .cse8 .cse21 .cse1 .cse7) (and .cse0 .cse21 .cse23 .cse17) (and .cse8 .cse21 .cse30 .cse9 .cse29 .cse13 .cse12) (and .cse25 .cse8 .cse30 .cse1 .cse9) (and .cse0 .cse3 .cse27 .cse33) (and .cse8 .cse32 .cse12 .cse27 .cse6) (and .cse25 .cse8 .cse30 .cse9 .cse13) (and .cse0 .cse22 .cse31 .cse27 .cse33) (and .cse8 .cse32 .cse10 .cse3 .cse12 .cse27) (and .cse0 .cse1 .cse3 .cse12) (and .cse25 .cse8 .cse19 .cse6))))) [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,399 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 18:08:53,400 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,401 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,402 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:08:53,403 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:08:53,404 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 18:08:53,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:08:53 BoogieIcfgContainer [2019-12-07 18:08:53,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:08:53,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:08:53,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:08:53,472 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:08:53,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:05:20" (3/4) ... [2019-12-07 18:08:53,475 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:08:53,500 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 18:08:53,502 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:08:53,523 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && 0 < a29 + 144) && a29 + 127 <= 0) && a0 + 44 <= 0) && 0 <= a29 + 127) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || ((((((a4 + 42 <= 0 && a0 + 242851 <= 0) && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && a0 + 242851 <= 0) && 1 == a2) && 0 <= a29 + 127)) || (a0 <= 599976 && (((((a4 + 86 <= 0 && a29 + 144 <= 0) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)))) || ((((a0 + 147 <= 0 && !(1 == a2)) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 <= 599976 && ((((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((\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 <= a0 + 44 && 0 < a29 + 144) && 3 == a2)))))) || ((((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2)) && 4453 <= a29)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 5 == a2) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && (((a0 + 242851 <= 0 && 4 == a2) && 0 <= a29 + 127) || ((a0 + 147 <= 0 && a29 + 144 <= 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))) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && a0 <= 599976)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && 0 < a29 + 16) && 0 < a29 + 144) && a0 <= 599976) && 5 == 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)) && 0 <= a0 + 97) && 1 == a2) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && a0 <= 599976) && 0 < a29 + 144) && 4 == a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && 1 == a2) && a0 + 147 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && ((a4 + 86 <= 0 && 3 == a2) || ((0 <= a0 + 44 && 0 < a29 + 144) && 3 == a2))) && a0 <= 599976)) || ((((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 0 <= a0 + 146) && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 146)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a0 + 61 <= 0) && 4 == a2) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == 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)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || (((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a29 + 127) [2019-12-07 18:08:53,525 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && 0 < a29 + 144) && a29 + 127 <= 0) && a0 + 44 <= 0) && 0 <= a29 + 127) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || ((((((a4 + 42 <= 0 && a0 + 242851 <= 0) && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && a0 + 242851 <= 0) && 1 == a2) && 0 <= a29 + 127)) || (a0 <= 599976 && (((((a4 + 86 <= 0 && a29 + 144 <= 0) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)))) || ((((a0 + 147 <= 0 && !(1 == a2)) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 <= 599976 && ((((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((\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 <= a0 + 44 && 0 < a29 + 144) && 3 == a2)))))) || ((((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2)) && 4453 <= a29)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 5 == a2) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && (((a0 + 242851 <= 0 && 4 == a2) && 0 <= a29 + 127) || ((a0 + 147 <= 0 && a29 + 144 <= 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))) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && a0 <= 599976)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && 0 < a29 + 16) && 0 < a29 + 144) && a0 <= 599976) && 5 == 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)) && 0 <= a0 + 97) && 1 == a2) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && a0 <= 599976) && 0 < a29 + 144) && 4 == a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && 1 == a2) && a0 + 147 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && ((a4 + 86 <= 0 && 3 == a2) || ((0 <= a0 + 44 && 0 < a29 + 144) && 3 == a2))) && a0 <= 599976)) || ((((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 0 <= a0 + 146) && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 146)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a0 + 61 <= 0) && 4 == a2) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == 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)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || (((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a29 + 127) [2019-12-07 18:08:53,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && 0 < a29 + 144) && a29 + 127 <= 0) && a0 + 44 <= 0) && 0 <= a29 + 127) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2) && a0 + 61 <= 0)) || ((((((a4 + 42 <= 0 && a0 + 242851 <= 0) && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2))) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && !(1 == input)) && 4 == a2)) || (a0 <= 599976 && (((((a4 + 86 <= 0 && a29 + 144 <= 0) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)))) || (((a4 + 42 <= 0 && a0 + 242851 <= 0) && 1 == a2) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && !(1 == a2)) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && 5 == a2)) || ((((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2)) && 4453 <= a29)) || (((((((a4 + 86 <= 0 && !(6 == input)) && !(1 == a2)) && 2 == a2) && !(3 == a2)) && 0 <= a29 + 127) || (((\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 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && 3 == a2)) || ((((a4 + 86 <= 0 && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((a4 + 42 <= 0 && (((((a0 + 242851 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2) && 0 <= a29 + 127) || ((a0 + 147 <= 0 && a29 + 144 <= 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))) || ((((a4 + 42 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && a0 <= 599976) && 4 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && a0 <= 599976)) || ((((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)) && 0 <= a0 + 97) && 1 == a2) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 2 == a2)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && 1 == a2) && a0 + 147 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 146)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a0 + 61 <= 0) && 4 == a2) && 0 <= a29 + 127)) || ((((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)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || (((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && 0 < a29 + 144) && a0 + 61 <= 0) [2019-12-07 18:08:53,635 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6cb7c629-6282-443f-8465-50058324283c/bin/uautomizer/witness.graphml [2019-12-07 18:08:53,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:08:53,636 INFO L168 Benchmark]: Toolchain (without parser) took 216320.24 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 939.8 MB in the beginning and 1.2 GB in the end (delta: -294.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,636 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:08:53,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.8 MB in the beginning and 999.2 MB in the end (delta: -59.4 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.27 ms. Allocated memory is still 1.1 GB. Free memory was 999.2 MB in the beginning and 961.6 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,637 INFO L168 Benchmark]: Boogie Preprocessor took 137.90 ms. Allocated memory is still 1.1 GB. Free memory was 961.6 MB in the beginning and 939.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,637 INFO L168 Benchmark]: RCFGBuilder took 1700.98 ms. Allocated memory is still 1.1 GB. Free memory was 939.8 MB in the beginning and 876.0 MB in the end (delta: 63.9 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,637 INFO L168 Benchmark]: TraceAbstraction took 213467.40 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 876.0 MB in the beginning and 1.3 GB in the end (delta: -451.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,638 INFO L168 Benchmark]: Witness Printer took 163.33 ms. Allocated memory is still 2.8 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 92.5 MB). Peak memory consumption was 92.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:53,639 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 726.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.8 MB in the beginning and 999.2 MB in the end (delta: -59.4 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.27 ms. Allocated memory is still 1.1 GB. Free memory was 999.2 MB in the beginning and 961.6 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.90 ms. Allocated memory is still 1.1 GB. Free memory was 961.6 MB in the beginning and 939.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1700.98 ms. Allocated memory is still 1.1 GB. Free memory was 939.8 MB in the beginning and 876.0 MB in the end (delta: 63.9 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 213467.40 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 876.0 MB in the beginning and 1.3 GB in the end (delta: -451.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 163.33 ms. Allocated memory is still 2.8 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 92.5 MB). Peak memory consumption was 92.5 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_~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] * 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-12-07 18:08:53,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && 0 < a29 + 144) && a29 + 127 <= 0) && a0 + 44 <= 0) && 0 <= a29 + 127) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || ((((((a4 + 42 <= 0 && a0 + 242851 <= 0) && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && a0 + 242851 <= 0) && 1 == a2) && 0 <= a29 + 127)) || (a0 <= 599976 && (((((a4 + 86 <= 0 && a29 + 144 <= 0) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)))) || ((((a0 + 147 <= 0 && !(1 == a2)) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 <= 599976 && ((((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((\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 <= a0 + 44 && 0 < a29 + 144) && 3 == a2)))))) || ((((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2)) && 4453 <= a29)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 5 == a2) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && (((a0 + 242851 <= 0 && 4 == a2) && 0 <= a29 + 127) || ((a0 + 147 <= 0 && a29 + 144 <= 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))) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && a0 <= 599976)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && 0 < a29 + 16) && 0 < a29 + 144) && a0 <= 599976) && 5 == 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)) && 0 <= a0 + 97) && 1 == a2) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && a0 <= 599976) && 0 < a29 + 144) && 4 == a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && 1 == a2) && a0 + 147 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && ((a4 + 86 <= 0 && 3 == a2) || ((0 <= a0 + 44 && 0 < a29 + 144) && 3 == a2))) && a0 <= 599976)) || ((((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 0 <= a0 + 146) && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 146)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a0 + 61 <= 0) && 4 == a2) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == 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)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || (((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a29 + 127) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 18:08:53,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && 0 < a29 + 144) && a29 + 127 <= 0) && a0 + 44 <= 0) && 0 <= a29 + 127) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || ((((((a4 + 42 <= 0 && a0 + 242851 <= 0) && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2))) || (((a4 + 42 <= 0 && a0 + 242851 <= 0) && 1 == a2) && 0 <= a29 + 127)) || (a0 <= 599976 && (((((a4 + 86 <= 0 && a29 + 144 <= 0) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)))) || ((((a0 + 147 <= 0 && !(1 == a2)) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 <= 599976 && ((((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((\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 <= a0 + 44 && 0 < a29 + 144) && 3 == a2)))))) || ((((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2)) && 4453 <= a29)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 5 == a2) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && (((a0 + 242851 <= 0 && 4 == a2) && 0 <= a29 + 127) || ((a0 + 147 <= 0 && a29 + 144 <= 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))) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && a0 <= 599976)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && 0 < a29 + 16) && 0 < a29 + 144) && a0 <= 599976) && 5 == 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)) && 0 <= a0 + 97) && 1 == a2) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && a0 <= 599976) && 0 < a29 + 144) && 4 == a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && 1 == a2) && a0 + 147 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && ((a4 + 86 <= 0 && 3 == a2) || ((0 <= a0 + 44 && 0 < a29 + 144) && 3 == a2))) && a0 <= 599976)) || ((((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 0 <= a0 + 146) && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 146)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a0 + 61 <= 0) && 4 == a2) && 0 <= a29 + 127)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == 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)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || (((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 0 <= a29 + 127) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 18:08:53,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 18:08:53,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && 0 < a29 + 144) && a29 + 127 <= 0) && a0 + 44 <= 0) && 0 <= a29 + 127) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2) && a0 + 61 <= 0)) || ((((((a4 + 42 <= 0 && a0 + 242851 <= 0) && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2))) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && !(1 == input)) && 4 == a2)) || (a0 <= 599976 && (((((a4 + 86 <= 0 && a29 + 144 <= 0) && !(1 == a2)) && 2 == a2) && !(3 == a2)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)))) || (((a4 + 42 <= 0 && a0 + 242851 <= 0) && 1 == a2) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && !(1 == a2)) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && 5 == a2)) || ((((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 < a29 + 144) && 5 == a2) && !(3 == a2)) && 4453 <= a29)) || (((((((a4 + 86 <= 0 && !(6 == input)) && !(1 == a2)) && 2 == a2) && !(3 == a2)) && 0 <= a29 + 127) || (((\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 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && 3 == a2)) || ((((a4 + 86 <= 0 && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((a4 + 42 <= 0 && (((((a0 + 242851 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2) && 0 <= a29 + 127) || ((a0 + 147 <= 0 && a29 + 144 <= 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))) || ((((a4 + 42 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && a0 <= 599976) && 4 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && a0 <= 599976)) || ((((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)) && 0 <= a0 + 97) && 1 == a2) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 2 == a2)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && 1 == a2) && a0 + 147 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 146)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a0 + 61 <= 0) && 4 == a2) && 0 <= a29 + 127)) || ((((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)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || (((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0) && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 86 <= 0 && 1 == a2) && 0 < a29 + 144) && a0 + 61 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 169.0s, OverallIterations: 29, TraceHistogramMax: 6, AutomataDifference: 107.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.2s, HoareTripleCheckerStatistics: 5586 SDtfs, 29844 SDslu, 2769 SDs, 0 SdLazy, 87350 SolverSat, 7307 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 83.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11392 GetRequests, 11113 SyntacticMatches, 46 SemanticMatches, 233 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 18.2s 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: 3.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 90993 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 295 NumberOfFragments, 2830 HoareAnnotationTreeSize, 4 FomulaSimplifications, 347447027 FormulaSimplificationTreeSizeReduction, 7.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 185493403 FormulaSimplificationTreeSizeReductionInter, 36.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 37.0s InterpolantComputationTime, 29749 NumberOfCodeBlocks, 29749 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 29707 ConstructedInterpolants, 1118 QuantifiedInterpolants, 157868548 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...