./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/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 629a9f5a301d91765ef653fcbff1dcb4386e9722 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:44:21,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:44:21,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:44:21,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:44:21,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:44:21,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:44:21,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:44:21,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:44:21,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:44:21,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:44:21,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:44:21,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:44:21,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:44:21,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:44:21,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:44:21,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:44:21,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:44:21,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:44:21,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:44:21,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:44:21,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:44:21,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:44:21,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:44:21,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:44:21,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:44:21,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:44:21,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:44:21,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:44:21,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:44:21,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:44:21,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:44:21,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:44:21,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:44:21,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:44:21,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:44:21,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:44:21,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:44:21,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:44:21,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:44:21,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:44:21,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:44:21,580 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:44:21,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:44:21,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:44:21,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:44:21,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:44:21,610 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:44:21,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:44:21,611 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:44:21,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:44:21,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:44:21,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:44:21,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:44:21,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:44:21,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:44:21,613 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:44:21,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:44:21,613 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:44:21,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:44:21,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:44:21,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:44:21,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:44:21,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:44:21,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:21,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:44:21,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:44:21,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:44:21,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:44:21,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:44:21,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:44:21,616 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_f8804f21-4387-46f9-a50e-4d1c822835e1/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 -> 629a9f5a301d91765ef653fcbff1dcb4386e9722 [2019-11-15 23:44:21,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:44:21,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:44:21,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:44:21,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:44:21,697 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:44:21,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2019-11-15 23:44:21,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/data/e33a50dc7/5bd77c96298145b381e565eb8a200896/FLAG83bc9620d [2019-11-15 23:44:22,406 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:44:22,407 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2019-11-15 23:44:22,432 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/data/e33a50dc7/5bd77c96298145b381e565eb8a200896/FLAG83bc9620d [2019-11-15 23:44:22,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/data/e33a50dc7/5bd77c96298145b381e565eb8a200896 [2019-11-15 23:44:22,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:44:22,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:44:22,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:22,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:44:22,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:44:22,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:22" (1/1) ... [2019-11-15 23:44:22,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587b9e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:22, skipping insertion in model container [2019-11-15 23:44:22,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:22" (1/1) ... [2019-11-15 23:44:22,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:44:22,835 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:44:23,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:23,745 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:44:24,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:24,118 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:44:24,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24 WrapperNode [2019-11-15 23:44:24,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:24,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:44:24,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:44:24,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:44:24,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:44:24,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:44:24,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:44:24,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:44:24,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... [2019-11-15 23:44:24,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:44:24,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:44:24,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:44:24,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:44:24,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:44:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:44:29,254 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:44:29,255 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:44:29,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:29 BoogieIcfgContainer [2019-11-15 23:44:29,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:44:29,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:44:29,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:44:29,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:44:29,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:44:22" (1/3) ... [2019-11-15 23:44:29,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413f54d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:29, skipping insertion in model container [2019-11-15 23:44:29,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:24" (2/3) ... [2019-11-15 23:44:29,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413f54d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:29, skipping insertion in model container [2019-11-15 23:44:29,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:29" (3/3) ... [2019-11-15 23:44:29,264 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2019-11-15 23:44:29,274 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:44:29,283 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:44:29,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:44:29,332 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:44:29,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:44:29,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:44:29,333 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:44:29,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:44:29,333 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:44:29,333 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:44:29,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:44:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-11-15 23:44:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:44:29,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:29,375 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:29,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-11-15 23:44:29,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:29,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608563628] [2019-11-15 23:44:29,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:29,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:29,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:29,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608563628] [2019-11-15 23:44:29,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:29,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:29,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262867758] [2019-11-15 23:44:29,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:29,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:29,661 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-11-15 23:44:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:34,671 INFO L93 Difference]: Finished difference Result 2122 states and 3952 transitions. [2019-11-15 23:44:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:34,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 23:44:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:34,697 INFO L225 Difference]: With dead ends: 2122 [2019-11-15 23:44:34,697 INFO L226 Difference]: Without dead ends: 1450 [2019-11-15 23:44:34,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-15 23:44:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 986. [2019-11-15 23:44:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-11-15 23:44:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1673 transitions. [2019-11-15 23:44:34,796 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1673 transitions. Word has length 34 [2019-11-15 23:44:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:34,797 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1673 transitions. [2019-11-15 23:44:34,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1673 transitions. [2019-11-15 23:44:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 23:44:34,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:34,802 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:34,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -279207896, now seen corresponding path program 1 times [2019-11-15 23:44:34,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:34,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610937085] [2019-11-15 23:44:34,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:34,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:34,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:34,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610937085] [2019-11-15 23:44:34,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:34,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:34,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46052541] [2019-11-15 23:44:34,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:34,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:34,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:34,944 INFO L87 Difference]: Start difference. First operand 986 states and 1673 transitions. Second operand 4 states. [2019-11-15 23:44:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:39,677 INFO L93 Difference]: Finished difference Result 3682 states and 6330 transitions. [2019-11-15 23:44:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:39,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-15 23:44:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:39,694 INFO L225 Difference]: With dead ends: 3682 [2019-11-15 23:44:39,694 INFO L226 Difference]: Without dead ends: 2698 [2019-11-15 23:44:39,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-11-15 23:44:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2698. [2019-11-15 23:44:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-15 23:44:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3704 transitions. [2019-11-15 23:44:39,772 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3704 transitions. Word has length 105 [2019-11-15 23:44:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:39,772 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 3704 transitions. [2019-11-15 23:44:39,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3704 transitions. [2019-11-15 23:44:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 23:44:39,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:39,789 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:39,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -449786728, now seen corresponding path program 1 times [2019-11-15 23:44:39,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:39,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320474499] [2019-11-15 23:44:39,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:39,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:39,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 23:44:40,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320474499] [2019-11-15 23:44:40,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:40,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:40,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794533106] [2019-11-15 23:44:40,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:40,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:40,060 INFO L87 Difference]: Start difference. First operand 2698 states and 3704 transitions. Second operand 3 states. [2019-11-15 23:44:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:44,053 INFO L93 Difference]: Finished difference Result 7942 states and 10911 transitions. [2019-11-15 23:44:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:44,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-15 23:44:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:44,083 INFO L225 Difference]: With dead ends: 7942 [2019-11-15 23:44:44,083 INFO L226 Difference]: Without dead ends: 5246 [2019-11-15 23:44:44,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-11-15 23:44:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4820. [2019-11-15 23:44:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4820 states. [2019-11-15 23:44:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 6035 transitions. [2019-11-15 23:44:44,294 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 6035 transitions. Word has length 188 [2019-11-15 23:44:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:44,296 INFO L462 AbstractCegarLoop]: Abstraction has 4820 states and 6035 transitions. [2019-11-15 23:44:44,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 6035 transitions. [2019-11-15 23:44:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:44:44,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:44,300 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:44:44,301 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:44,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2099311771, now seen corresponding path program 1 times [2019-11-15 23:44:44,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:44,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23974024] [2019-11-15 23:44:44,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:44,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:44,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:44,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23974024] [2019-11-15 23:44:44,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:44,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:44,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826730610] [2019-11-15 23:44:44,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:44,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:44,453 INFO L87 Difference]: Start difference. First operand 4820 states and 6035 transitions. Second operand 3 states. [2019-11-15 23:44:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:46,337 INFO L93 Difference]: Finished difference Result 9637 states and 12067 transitions. [2019-11-15 23:44:46,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:46,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-15 23:44:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:46,364 INFO L225 Difference]: With dead ends: 9637 [2019-11-15 23:44:46,364 INFO L226 Difference]: Without dead ends: 4819 [2019-11-15 23:44:46,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-11-15 23:44:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2019-11-15 23:44:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2019-11-15 23:44:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 5684 transitions. [2019-11-15 23:44:46,458 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 5684 transitions. Word has length 195 [2019-11-15 23:44:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:46,459 INFO L462 AbstractCegarLoop]: Abstraction has 4819 states and 5684 transitions. [2019-11-15 23:44:46,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 5684 transitions. [2019-11-15 23:44:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 23:44:46,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:46,464 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:44:46,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1367873502, now seen corresponding path program 1 times [2019-11-15 23:44:46,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:46,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205881340] [2019-11-15 23:44:46,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:46,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:46,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 23:44:46,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205881340] [2019-11-15 23:44:46,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:46,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:46,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789903684] [2019-11-15 23:44:46,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:46,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:46,634 INFO L87 Difference]: Start difference. First operand 4819 states and 5684 transitions. Second operand 4 states. [2019-11-15 23:44:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:51,459 INFO L93 Difference]: Finished difference Result 12637 states and 15016 transitions. [2019-11-15 23:44:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:51,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-15 23:44:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:51,497 INFO L225 Difference]: With dead ends: 12637 [2019-11-15 23:44:51,497 INFO L226 Difference]: Without dead ends: 7820 [2019-11-15 23:44:51,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7820 states. [2019-11-15 23:44:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7820 to 6102. [2019-11-15 23:44:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6102 states. [2019-11-15 23:44:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 7185 transitions. [2019-11-15 23:44:51,623 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 7185 transitions. Word has length 254 [2019-11-15 23:44:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:51,623 INFO L462 AbstractCegarLoop]: Abstraction has 6102 states and 7185 transitions. [2019-11-15 23:44:51,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 7185 transitions. [2019-11-15 23:44:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-15 23:44:51,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:51,628 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:51,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2020673444, now seen corresponding path program 1 times [2019-11-15 23:44:51,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:51,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628569675] [2019-11-15 23:44:51,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:51,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:51,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:52,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628569675] [2019-11-15 23:44:52,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788284854] [2019-11-15 23:44:52,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:44:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:52,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:44:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:44:52,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:44:52,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:44:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 23:44:52,412 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:44:52,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 10 [2019-11-15 23:44:52,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303764359] [2019-11-15 23:44:52,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:44:52,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:52,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:44:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:44:52,419 INFO L87 Difference]: Start difference. First operand 6102 states and 7185 transitions. Second operand 11 states. [2019-11-15 23:45:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:15,365 INFO L93 Difference]: Finished difference Result 47929 states and 57900 transitions. [2019-11-15 23:45:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:45:15,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-11-15 23:45:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:15,442 INFO L225 Difference]: With dead ends: 47929 [2019-11-15 23:45:15,442 INFO L226 Difference]: Without dead ends: 31602 [2019-11-15 23:45:15,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:45:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31602 states. [2019-11-15 23:45:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31602 to 25637. [2019-11-15 23:45:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25637 states. [2019-11-15 23:45:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25637 states to 25637 states and 28133 transitions. [2019-11-15 23:45:16,106 INFO L78 Accepts]: Start accepts. Automaton has 25637 states and 28133 transitions. Word has length 258 [2019-11-15 23:45:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 25637 states and 28133 transitions. [2019-11-15 23:45:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:45:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 25637 states and 28133 transitions. [2019-11-15 23:45:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-15 23:45:16,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:16,127 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:16,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:16,332 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash -356377686, now seen corresponding path program 1 times [2019-11-15 23:45:16,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:16,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070918919] [2019-11-15 23:45:16,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:16,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:16,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-15 23:45:16,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070918919] [2019-11-15 23:45:16,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:16,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:16,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227435894] [2019-11-15 23:45:16,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:16,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:16,725 INFO L87 Difference]: Start difference. First operand 25637 states and 28133 transitions. Second operand 3 states. [2019-11-15 23:45:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:18,613 INFO L93 Difference]: Finished difference Result 53397 states and 58615 transitions. [2019-11-15 23:45:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:18,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2019-11-15 23:45:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:18,652 INFO L225 Difference]: With dead ends: 53397 [2019-11-15 23:45:18,652 INFO L226 Difference]: Without dead ends: 28187 [2019-11-15 23:45:18,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28187 states. [2019-11-15 23:45:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28187 to 26062. [2019-11-15 23:45:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26062 states. [2019-11-15 23:45:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26062 states to 26062 states and 28641 transitions. [2019-11-15 23:45:19,014 INFO L78 Accepts]: Start accepts. Automaton has 26062 states and 28641 transitions. Word has length 405 [2019-11-15 23:45:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,015 INFO L462 AbstractCegarLoop]: Abstraction has 26062 states and 28641 transitions. [2019-11-15 23:45:19,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 26062 states and 28641 transitions. [2019-11-15 23:45:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-15 23:45:19,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,032 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:19,032 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1820651612, now seen corresponding path program 1 times [2019-11-15 23:45:19,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031445658] [2019-11-15 23:45:19,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:45:19,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031445658] [2019-11-15 23:45:19,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746722643] [2019-11-15 23:45:19,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,360 INFO L87 Difference]: Start difference. First operand 26062 states and 28641 transitions. Second operand 3 states. [2019-11-15 23:45:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:22,245 INFO L93 Difference]: Finished difference Result 63175 states and 69454 transitions. [2019-11-15 23:45:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:22,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-15 23:45:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:22,284 INFO L225 Difference]: With dead ends: 63175 [2019-11-15 23:45:22,284 INFO L226 Difference]: Without dead ends: 37540 [2019-11-15 23:45:22,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37540 states. [2019-11-15 23:45:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37540 to 34985. [2019-11-15 23:45:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34985 states. [2019-11-15 23:45:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34985 states to 34985 states and 37773 transitions. [2019-11-15 23:45:22,679 INFO L78 Accepts]: Start accepts. Automaton has 34985 states and 37773 transitions. Word has length 420 [2019-11-15 23:45:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:22,680 INFO L462 AbstractCegarLoop]: Abstraction has 34985 states and 37773 transitions. [2019-11-15 23:45:22,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34985 states and 37773 transitions. [2019-11-15 23:45:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-11-15 23:45:22,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:22,705 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:22,705 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2018829380, now seen corresponding path program 1 times [2019-11-15 23:45:22,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:22,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114674944] [2019-11-15 23:45:22,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 305 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:23,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114674944] [2019-11-15 23:45:23,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504079793] [2019-11-15 23:45:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:45:23,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-15 23:45:23,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:45:23,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 23:45:23,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032307176] [2019-11-15 23:45:23,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:23,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:23,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:23,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:45:23,658 INFO L87 Difference]: Start difference. First operand 34985 states and 37773 transitions. Second operand 4 states. [2019-11-15 23:45:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:27,841 INFO L93 Difference]: Finished difference Result 92115 states and 99479 transitions. [2019-11-15 23:45:27,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:27,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 500 [2019-11-15 23:45:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:27,902 INFO L225 Difference]: With dead ends: 92115 [2019-11-15 23:45:27,902 INFO L226 Difference]: Without dead ends: 56282 [2019-11-15 23:45:27,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:45:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56282 states. [2019-11-15 23:45:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56282 to 46066. [2019-11-15 23:45:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-11-15 23:45:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49443 transitions. [2019-11-15 23:45:28,417 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49443 transitions. Word has length 500 [2019-11-15 23:45:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:28,417 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49443 transitions. [2019-11-15 23:45:28,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49443 transitions. [2019-11-15 23:45:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-11-15 23:45:28,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:28,446 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:45:28,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:28,653 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash 153680514, now seen corresponding path program 1 times [2019-11-15 23:45:28,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:28,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540287394] [2019-11-15 23:45:28,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:28,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:28,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 23:45:29,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540287394] [2019-11-15 23:45:29,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:29,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:29,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081200319] [2019-11-15 23:45:29,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:29,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:29,068 INFO L87 Difference]: Start difference. First operand 46066 states and 49443 transitions. Second operand 4 states. [2019-11-15 23:45:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:32,833 INFO L93 Difference]: Finished difference Result 98958 states and 105970 transitions. [2019-11-15 23:45:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:32,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 503 [2019-11-15 23:45:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:32,897 INFO L225 Difference]: With dead ends: 98958 [2019-11-15 23:45:32,898 INFO L226 Difference]: Without dead ends: 53319 [2019-11-15 23:45:32,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53319 states. [2019-11-15 23:45:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53319 to 46066. [2019-11-15 23:45:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-11-15 23:45:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49424 transitions. [2019-11-15 23:45:33,368 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49424 transitions. Word has length 503 [2019-11-15 23:45:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:33,369 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49424 transitions. [2019-11-15 23:45:33,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49424 transitions. [2019-11-15 23:45:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-15 23:45:33,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:33,384 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:45:33,385 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1023396058, now seen corresponding path program 1 times [2019-11-15 23:45:33,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:33,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664116747] [2019-11-15 23:45:33,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:33,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:33,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 305 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:33,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664116747] [2019-11-15 23:45:33,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174281033] [2019-11-15 23:45:33,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:34,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:45:34,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:34,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:45:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:45:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-15 23:45:35,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:45:35,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-11-15 23:45:35,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161386145] [2019-11-15 23:45:35,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:35,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:45:35,394 INFO L87 Difference]: Start difference. First operand 46066 states and 49424 transitions. Second operand 4 states. [2019-11-15 23:45:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:41,102 INFO L93 Difference]: Finished difference Result 112574 states and 121075 transitions. [2019-11-15 23:45:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:41,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-11-15 23:45:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:41,173 INFO L225 Difference]: With dead ends: 112574 [2019-11-15 23:45:41,173 INFO L226 Difference]: Without dead ends: 65660 [2019-11-15 23:45:41,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:45:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65660 states. [2019-11-15 23:45:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65660 to 46066. [2019-11-15 23:45:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-11-15 23:45:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49428 transitions. [2019-11-15 23:45:41,655 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49428 transitions. Word has length 505 [2019-11-15 23:45:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:41,656 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49428 transitions. [2019-11-15 23:45:41,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49428 transitions. [2019-11-15 23:45:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-11-15 23:45:41,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:41,672 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:41,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:41,873 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash -5548667, now seen corresponding path program 1 times [2019-11-15 23:45:41,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:41,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516003216] [2019-11-15 23:45:41,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:41,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:41,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 3 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:43,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516003216] [2019-11-15 23:45:43,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316563093] [2019-11-15 23:45:43,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:43,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:45:43,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 23:45:44,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:45:44,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-11-15 23:45:44,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217015786] [2019-11-15 23:45:44,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:44,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:44,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:44,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:45:44,186 INFO L87 Difference]: Start difference. First operand 46066 states and 49428 transitions. Second operand 3 states. [2019-11-15 23:45:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:46,294 INFO L93 Difference]: Finished difference Result 94264 states and 101130 transitions. [2019-11-15 23:45:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:46,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-11-15 23:45:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:46,331 INFO L225 Difference]: With dead ends: 94264 [2019-11-15 23:45:46,331 INFO L226 Difference]: Without dead ends: 48200 [2019-11-15 23:45:46,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:45:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48200 states. [2019-11-15 23:45:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48200 to 48189. [2019-11-15 23:45:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48189 states. [2019-11-15 23:45:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48189 states to 48189 states and 51635 transitions. [2019-11-15 23:45:46,740 INFO L78 Accepts]: Start accepts. Automaton has 48189 states and 51635 transitions. Word has length 558 [2019-11-15 23:45:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:46,741 INFO L462 AbstractCegarLoop]: Abstraction has 48189 states and 51635 transitions. [2019-11-15 23:45:46,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 48189 states and 51635 transitions. [2019-11-15 23:45:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-11-15 23:45:46,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:46,758 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:45:46,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:46,961 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash 658202556, now seen corresponding path program 1 times [2019-11-15 23:45:46,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:46,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503966308] [2019-11-15 23:45:46,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:46,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:46,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 23:45:47,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503966308] [2019-11-15 23:45:47,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:47,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:47,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262525676] [2019-11-15 23:45:47,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:47,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:47,391 INFO L87 Difference]: Start difference. First operand 48189 states and 51635 transitions. Second operand 3 states. [2019-11-15 23:45:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:49,826 INFO L93 Difference]: Finished difference Result 94241 states and 100983 transitions. [2019-11-15 23:45:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:49,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 559 [2019-11-15 23:45:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:49,861 INFO L225 Difference]: With dead ends: 94241 [2019-11-15 23:45:49,861 INFO L226 Difference]: Without dead ends: 46053 [2019-11-15 23:45:49,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46053 states. [2019-11-15 23:45:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46053 to 46050. [2019-11-15 23:45:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46050 states. [2019-11-15 23:45:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46050 states to 46050 states and 49335 transitions. [2019-11-15 23:45:50,231 INFO L78 Accepts]: Start accepts. Automaton has 46050 states and 49335 transitions. Word has length 559 [2019-11-15 23:45:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:50,232 INFO L462 AbstractCegarLoop]: Abstraction has 46050 states and 49335 transitions. [2019-11-15 23:45:50,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 46050 states and 49335 transitions. [2019-11-15 23:45:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-11-15 23:45:50,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:50,243 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:45:50,243 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 258696126, now seen corresponding path program 1 times [2019-11-15 23:45:50,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:50,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636704145] [2019-11-15 23:45:50,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:50,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:50,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 309 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:51,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636704145] [2019-11-15 23:45:51,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038250271] [2019-11-15 23:45:51,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:51,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:45:51,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:51,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:45:51,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:45:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-15 23:45:52,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:45:52,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-11-15 23:45:52,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455244331] [2019-11-15 23:45:52,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:45:52,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:45:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:45:52,379 INFO L87 Difference]: Start difference. First operand 46050 states and 49335 transitions. Second operand 5 states. [2019-11-15 23:46:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:00,587 INFO L93 Difference]: Finished difference Result 108269 states and 115888 transitions. [2019-11-15 23:46:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:00,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 559 [2019-11-15 23:46:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:00,637 INFO L225 Difference]: With dead ends: 108269 [2019-11-15 23:46:00,637 INFO L226 Difference]: Without dead ends: 62221 [2019-11-15 23:46:00,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:46:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62221 states. [2019-11-15 23:46:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62221 to 55412. [2019-11-15 23:46:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55412 states. [2019-11-15 23:46:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55412 states to 55412 states and 58843 transitions. [2019-11-15 23:46:01,150 INFO L78 Accepts]: Start accepts. Automaton has 55412 states and 58843 transitions. Word has length 559 [2019-11-15 23:46:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:01,150 INFO L462 AbstractCegarLoop]: Abstraction has 55412 states and 58843 transitions. [2019-11-15 23:46:01,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:46:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 55412 states and 58843 transitions. [2019-11-15 23:46:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-11-15 23:46:01,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:01,162 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:46:01,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:01,362 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 754787691, now seen corresponding path program 1 times [2019-11-15 23:46:01,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:01,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044932005] [2019-11-15 23:46:01,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 479 proven. 5 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-11-15 23:46:01,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044932005] [2019-11-15 23:46:01,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58388489] [2019-11-15 23:46:01,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:01,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:46:01,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 23:46:02,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:46:02,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-15 23:46:02,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604796831] [2019-11-15 23:46:02,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:46:02,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:02,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:46:02,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:46:02,361 INFO L87 Difference]: Start difference. First operand 55412 states and 58843 transitions. Second operand 5 states. [2019-11-15 23:46:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:12,271 INFO L93 Difference]: Finished difference Result 130377 states and 139100 transitions. [2019-11-15 23:46:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:12,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 591 [2019-11-15 23:46:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:12,341 INFO L225 Difference]: With dead ends: 130377 [2019-11-15 23:46:12,341 INFO L226 Difference]: Without dead ends: 73688 [2019-11-15 23:46:12,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 590 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:46:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73688 states. [2019-11-15 23:46:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73688 to 54533. [2019-11-15 23:46:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54533 states. [2019-11-15 23:46:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54533 states to 54533 states and 57745 transitions. [2019-11-15 23:46:12,936 INFO L78 Accepts]: Start accepts. Automaton has 54533 states and 57745 transitions. Word has length 591 [2019-11-15 23:46:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:12,937 INFO L462 AbstractCegarLoop]: Abstraction has 54533 states and 57745 transitions. [2019-11-15 23:46:12,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:46:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 54533 states and 57745 transitions. [2019-11-15 23:46:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2019-11-15 23:46:12,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:12,954 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:13,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:13,158 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1483920962, now seen corresponding path program 1 times [2019-11-15 23:46:13,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:13,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97665066] [2019-11-15 23:46:13,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 23:46:13,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97665066] [2019-11-15 23:46:13,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:13,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:13,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053494086] [2019-11-15 23:46:13,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:13,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:13,533 INFO L87 Difference]: Start difference. First operand 54533 states and 57745 transitions. Second operand 3 states. [2019-11-15 23:46:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:15,368 INFO L93 Difference]: Finished difference Result 109494 states and 115996 transitions. [2019-11-15 23:46:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:15,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 595 [2019-11-15 23:46:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:15,414 INFO L225 Difference]: With dead ends: 109494 [2019-11-15 23:46:15,415 INFO L226 Difference]: Without dead ends: 55388 [2019-11-15 23:46:15,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55388 states. [2019-11-15 23:46:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55388 to 51982. [2019-11-15 23:46:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51982 states. [2019-11-15 23:46:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51982 states to 51982 states and 54835 transitions. [2019-11-15 23:46:15,911 INFO L78 Accepts]: Start accepts. Automaton has 51982 states and 54835 transitions. Word has length 595 [2019-11-15 23:46:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:15,911 INFO L462 AbstractCegarLoop]: Abstraction has 51982 states and 54835 transitions. [2019-11-15 23:46:15,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 51982 states and 54835 transitions. [2019-11-15 23:46:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-11-15 23:46:15,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:15,930 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:15,931 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1216128928, now seen corresponding path program 1 times [2019-11-15 23:46:15,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:15,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794293016] [2019-11-15 23:46:15,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 23:46:16,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794293016] [2019-11-15 23:46:16,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:16,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:16,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110337589] [2019-11-15 23:46:16,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:16,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:16,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:16,362 INFO L87 Difference]: Start difference. First operand 51982 states and 54835 transitions. Second operand 3 states. [2019-11-15 23:46:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:18,370 INFO L93 Difference]: Finished difference Result 112469 states and 118642 transitions. [2019-11-15 23:46:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:18,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 638 [2019-11-15 23:46:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:18,426 INFO L225 Difference]: With dead ends: 112469 [2019-11-15 23:46:18,426 INFO L226 Difference]: Without dead ends: 60914 [2019-11-15 23:46:18,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60914 states. [2019-11-15 23:46:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60914 to 59206. [2019-11-15 23:46:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59206 states. [2019-11-15 23:46:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59206 states to 59206 states and 62268 transitions. [2019-11-15 23:46:19,017 INFO L78 Accepts]: Start accepts. Automaton has 59206 states and 62268 transitions. Word has length 638 [2019-11-15 23:46:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:19,018 INFO L462 AbstractCegarLoop]: Abstraction has 59206 states and 62268 transitions. [2019-11-15 23:46:19,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 59206 states and 62268 transitions. [2019-11-15 23:46:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2019-11-15 23:46:19,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:19,446 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:19,446 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash -236923992, now seen corresponding path program 1 times [2019-11-15 23:46:19,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:19,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223285364] [2019-11-15 23:46:19,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-11-15 23:46:20,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223285364] [2019-11-15 23:46:20,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:20,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:20,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414720908] [2019-11-15 23:46:20,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:20,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:20,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:20,125 INFO L87 Difference]: Start difference. First operand 59206 states and 62268 transitions. Second operand 3 states. [2019-11-15 23:46:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:21,918 INFO L93 Difference]: Finished difference Result 124785 states and 131219 transitions. [2019-11-15 23:46:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:21,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 796 [2019-11-15 23:46:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:21,982 INFO L225 Difference]: With dead ends: 124785 [2019-11-15 23:46:21,983 INFO L226 Difference]: Without dead ends: 66006 [2019-11-15 23:46:22,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66006 states. [2019-11-15 23:46:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66006 to 57074. [2019-11-15 23:46:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57074 states. [2019-11-15 23:46:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57074 states to 57074 states and 59972 transitions. [2019-11-15 23:46:22,558 INFO L78 Accepts]: Start accepts. Automaton has 57074 states and 59972 transitions. Word has length 796 [2019-11-15 23:46:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:22,558 INFO L462 AbstractCegarLoop]: Abstraction has 57074 states and 59972 transitions. [2019-11-15 23:46:22,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 57074 states and 59972 transitions. [2019-11-15 23:46:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-11-15 23:46:22,580 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:22,580 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:22,581 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash -195082119, now seen corresponding path program 1 times [2019-11-15 23:46:22,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052912572] [2019-11-15 23:46:22,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 663 proven. 335 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 23:46:24,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052912572] [2019-11-15 23:46:24,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138225055] [2019-11-15 23:46:24,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:24,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:46:24,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 566 proven. 82 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-11-15 23:46:25,197 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:46:25,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-15 23:46:25,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705972219] [2019-11-15 23:46:25,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:46:25,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:46:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:25,202 INFO L87 Difference]: Start difference. First operand 57074 states and 59972 transitions. Second operand 10 states. [2019-11-15 23:46:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:41,066 INFO L93 Difference]: Finished difference Result 137579 states and 144567 transitions. [2019-11-15 23:46:41,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:46:41,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 809 [2019-11-15 23:46:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:41,131 INFO L225 Difference]: With dead ends: 137579 [2019-11-15 23:46:41,132 INFO L226 Difference]: Without dead ends: 80507 [2019-11-15 23:46:41,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:46:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80507 states. [2019-11-15 23:46:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80507 to 71546. [2019-11-15 23:46:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71546 states. [2019-11-15 23:46:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71546 states to 71546 states and 75028 transitions. [2019-11-15 23:46:42,096 INFO L78 Accepts]: Start accepts. Automaton has 71546 states and 75028 transitions. Word has length 809 [2019-11-15 23:46:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:42,096 INFO L462 AbstractCegarLoop]: Abstraction has 71546 states and 75028 transitions. [2019-11-15 23:46:42,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:46:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71546 states and 75028 transitions. [2019-11-15 23:46:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2019-11-15 23:46:42,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:42,122 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:42,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:42,326 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 749095286, now seen corresponding path program 1 times [2019-11-15 23:46:42,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:42,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483317444] [2019-11-15 23:46:42,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:42,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:42,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1351 proven. 65 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-11-15 23:46:43,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483317444] [2019-11-15 23:46:43,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521495455] [2019-11-15 23:46:43,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:43,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:46:43,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1416 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-11-15 23:46:44,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:46:44,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:46:44,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336238302] [2019-11-15 23:46:44,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:44,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:44,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:44,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:46:44,006 INFO L87 Difference]: Start difference. First operand 71546 states and 75028 transitions. Second operand 4 states. [2019-11-15 23:46:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:46,496 INFO L93 Difference]: Finished difference Result 144365 states and 151418 transitions. [2019-11-15 23:46:46,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:46,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 903 [2019-11-15 23:46:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:46,555 INFO L225 Difference]: With dead ends: 144365 [2019-11-15 23:46:46,556 INFO L226 Difference]: Without dead ends: 73671 [2019-11-15 23:46:46,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 902 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:46:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73671 states. [2019-11-15 23:46:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73671 to 73671. [2019-11-15 23:46:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73671 states. [2019-11-15 23:46:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73671 states to 73671 states and 77143 transitions. [2019-11-15 23:46:47,484 INFO L78 Accepts]: Start accepts. Automaton has 73671 states and 77143 transitions. Word has length 903 [2019-11-15 23:46:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:47,485 INFO L462 AbstractCegarLoop]: Abstraction has 73671 states and 77143 transitions. [2019-11-15 23:46:47,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 73671 states and 77143 transitions. [2019-11-15 23:46:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-11-15 23:46:47,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:47,511 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:47,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:47,712 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1201664773, now seen corresponding path program 1 times [2019-11-15 23:46:47,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:47,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220158687] [2019-11-15 23:46:47,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:47,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:47,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 1451 proven. 0 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2019-11-15 23:46:48,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220158687] [2019-11-15 23:46:48,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:48,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:48,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508515022] [2019-11-15 23:46:48,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:48,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:48,612 INFO L87 Difference]: Start difference. First operand 73671 states and 77143 transitions. Second operand 4 states. [2019-11-15 23:46:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:51,242 INFO L93 Difference]: Finished difference Result 152879 states and 160023 transitions. [2019-11-15 23:46:51,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:51,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 955 [2019-11-15 23:46:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:51,308 INFO L225 Difference]: With dead ends: 152879 [2019-11-15 23:46:51,309 INFO L226 Difference]: Without dead ends: 79210 [2019-11-15 23:46:51,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79210 states. [2019-11-15 23:46:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79210 to 73670. [2019-11-15 23:46:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73670 states. [2019-11-15 23:46:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73670 states to 73670 states and 77009 transitions. [2019-11-15 23:46:52,024 INFO L78 Accepts]: Start accepts. Automaton has 73670 states and 77009 transitions. Word has length 955 [2019-11-15 23:46:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:52,025 INFO L462 AbstractCegarLoop]: Abstraction has 73670 states and 77009 transitions. [2019-11-15 23:46:52,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 73670 states and 77009 transitions. [2019-11-15 23:46:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2019-11-15 23:46:52,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:52,058 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:52,058 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash -115299208, now seen corresponding path program 1 times [2019-11-15 23:46:52,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:52,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405231181] [2019-11-15 23:46:52,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:52,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:52,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2019-11-15 23:46:53,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405231181] [2019-11-15 23:46:53,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:53,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:46:53,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581555355] [2019-11-15 23:46:53,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:46:53,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:53,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:46:53,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:53,522 INFO L87 Difference]: Start difference. First operand 73670 states and 77009 transitions. Second operand 5 states. [2019-11-15 23:46:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:57,389 INFO L93 Difference]: Finished difference Result 163107 states and 170773 transitions. [2019-11-15 23:46:57,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:57,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1031 [2019-11-15 23:46:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:57,463 INFO L225 Difference]: With dead ends: 163107 [2019-11-15 23:46:57,463 INFO L226 Difference]: Without dead ends: 89864 [2019-11-15 23:46:57,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89864 states. [2019-11-15 23:46:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89864 to 72395. [2019-11-15 23:46:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72395 states. [2019-11-15 23:46:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72395 states to 72395 states and 75699 transitions. [2019-11-15 23:46:58,199 INFO L78 Accepts]: Start accepts. Automaton has 72395 states and 75699 transitions. Word has length 1031 [2019-11-15 23:46:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:58,200 INFO L462 AbstractCegarLoop]: Abstraction has 72395 states and 75699 transitions. [2019-11-15 23:46:58,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:46:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 72395 states and 75699 transitions. [2019-11-15 23:46:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-11-15 23:46:58,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:58,231 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:46:58,231 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1807092396, now seen corresponding path program 1 times [2019-11-15 23:46:58,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:58,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743152209] [2019-11-15 23:46:58,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:58,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:58,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1243 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-11-15 23:47:00,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743152209] [2019-11-15 23:47:00,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:00,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:00,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159576144] [2019-11-15 23:47:00,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:00,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:00,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:00,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:00,559 INFO L87 Difference]: Start difference. First operand 72395 states and 75699 transitions. Second operand 3 states. [2019-11-15 23:47:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:02,753 INFO L93 Difference]: Finished difference Result 145219 states and 151855 transitions. [2019-11-15 23:47:02,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:02,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-11-15 23:47:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:02,816 INFO L225 Difference]: With dead ends: 145219 [2019-11-15 23:47:02,816 INFO L226 Difference]: Without dead ends: 73676 [2019-11-15 23:47:02,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73676 states. [2019-11-15 23:47:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73676 to 72393. [2019-11-15 23:47:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72393 states. [2019-11-15 23:47:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72393 states to 72393 states and 75450 transitions. [2019-11-15 23:47:03,497 INFO L78 Accepts]: Start accepts. Automaton has 72393 states and 75450 transitions. Word has length 1103 [2019-11-15 23:47:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:03,498 INFO L462 AbstractCegarLoop]: Abstraction has 72393 states and 75450 transitions. [2019-11-15 23:47:03,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 72393 states and 75450 transitions. [2019-11-15 23:47:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-11-15 23:47:03,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:03,530 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:03,530 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -881943503, now seen corresponding path program 1 times [2019-11-15 23:47:03,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:03,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147095398] [2019-11-15 23:47:03,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 1698 proven. 143 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-11-15 23:47:07,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147095398] [2019-11-15 23:47:07,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102932026] [2019-11-15 23:47:07,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:07,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:47:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:07,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:07,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:07,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 1841 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-11-15 23:47:10,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:47:10,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:47:10,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967143539] [2019-11-15 23:47:10,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:10,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:10,512 INFO L87 Difference]: Start difference. First operand 72393 states and 75450 transitions. Second operand 4 states. [2019-11-15 23:47:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:20,896 INFO L93 Difference]: Finished difference Result 164797 states and 171646 transitions. [2019-11-15 23:47:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:47:20,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1110 [2019-11-15 23:47:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:20,973 INFO L225 Difference]: With dead ends: 164797 [2019-11-15 23:47:20,973 INFO L226 Difference]: Without dead ends: 93256 [2019-11-15 23:47:20,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1109 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93256 states. [2019-11-15 23:47:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93256 to 78362. [2019-11-15 23:47:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78362 states. [2019-11-15 23:47:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78362 states to 78362 states and 81661 transitions. [2019-11-15 23:47:21,788 INFO L78 Accepts]: Start accepts. Automaton has 78362 states and 81661 transitions. Word has length 1110 [2019-11-15 23:47:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:21,789 INFO L462 AbstractCegarLoop]: Abstraction has 78362 states and 81661 transitions. [2019-11-15 23:47:21,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:47:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 78362 states and 81661 transitions. [2019-11-15 23:47:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1122 [2019-11-15 23:47:21,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:21,833 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:22,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:22,033 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:22,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash -204436311, now seen corresponding path program 1 times [2019-11-15 23:47:22,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:22,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236478311] [2019-11-15 23:47:22,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:22,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:22,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 744 proven. 6 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-11-15 23:47:23,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236478311] [2019-11-15 23:47:23,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352518393] [2019-11-15 23:47:23,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:23,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:47:23,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-11-15 23:47:24,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:47:24,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:47:24,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762090554] [2019-11-15 23:47:24,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:24,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:24,610 INFO L87 Difference]: Start difference. First operand 78362 states and 81661 transitions. Second operand 4 states. [2019-11-15 23:47:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:47,856 INFO L93 Difference]: Finished difference Result 189525 states and 197837 transitions. [2019-11-15 23:47:47,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:47:47,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1121 [2019-11-15 23:47:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:47,957 INFO L225 Difference]: With dead ends: 189525 [2019-11-15 23:47:47,957 INFO L226 Difference]: Without dead ends: 110740 [2019-11-15 23:47:47,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1120 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110740 states. [2019-11-15 23:47:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110740 to 94130. [2019-11-15 23:47:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94130 states. [2019-11-15 23:47:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94130 states to 94130 states and 98246 transitions. [2019-11-15 23:47:48,919 INFO L78 Accepts]: Start accepts. Automaton has 94130 states and 98246 transitions. Word has length 1121 [2019-11-15 23:47:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:48,919 INFO L462 AbstractCegarLoop]: Abstraction has 94130 states and 98246 transitions. [2019-11-15 23:47:48,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:47:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 94130 states and 98246 transitions. [2019-11-15 23:47:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2019-11-15 23:47:48,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:48,965 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:49,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:49,166 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1008432611, now seen corresponding path program 1 times [2019-11-15 23:47:49,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:49,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981084206] [2019-11-15 23:47:49,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:49,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:49,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2861 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2019-11-15 23:47:50,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981084206] [2019-11-15 23:47:50,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:50,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:50,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303906916] [2019-11-15 23:47:50,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:50,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:50,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:50,747 INFO L87 Difference]: Start difference. First operand 94130 states and 98246 transitions. Second operand 3 states. [2019-11-15 23:47:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:53,111 INFO L93 Difference]: Finished difference Result 197596 states and 206143 transitions. [2019-11-15 23:47:53,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:53,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1155 [2019-11-15 23:47:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:53,209 INFO L225 Difference]: With dead ends: 197596 [2019-11-15 23:47:53,209 INFO L226 Difference]: Without dead ends: 104318 [2019-11-15 23:47:53,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104318 states. [2019-11-15 23:47:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104318 to 92387. [2019-11-15 23:47:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92387 states. [2019-11-15 23:47:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92387 states to 92387 states and 95749 transitions. [2019-11-15 23:47:54,108 INFO L78 Accepts]: Start accepts. Automaton has 92387 states and 95749 transitions. Word has length 1155 [2019-11-15 23:47:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:54,108 INFO L462 AbstractCegarLoop]: Abstraction has 92387 states and 95749 transitions. [2019-11-15 23:47:54,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 92387 states and 95749 transitions. [2019-11-15 23:47:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2019-11-15 23:47:54,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:54,143 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:54,143 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1621241508, now seen corresponding path program 1 times [2019-11-15 23:47:54,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:54,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541455739] [2019-11-15 23:47:54,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:54,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:54,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 1917 proven. 143 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-15 23:47:56,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541455739] [2019-11-15 23:47:56,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010344029] [2019-11-15 23:47:56,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:57,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:47:57,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:57,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 2060 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-15 23:47:58,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:47:58,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 23:47:58,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520862940] [2019-11-15 23:47:58,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:58,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:58,277 INFO L87 Difference]: Start difference. First operand 92387 states and 95749 transitions. Second operand 4 states. [2019-11-15 23:48:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:01,512 INFO L93 Difference]: Finished difference Result 209459 states and 216927 transitions. [2019-11-15 23:48:01,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:01,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1195 [2019-11-15 23:48:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:01,616 INFO L225 Difference]: With dead ends: 209459 [2019-11-15 23:48:01,616 INFO L226 Difference]: Without dead ends: 117499 [2019-11-15 23:48:01,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 1194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:48:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117499 states. [2019-11-15 23:48:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117499 to 100045. [2019-11-15 23:48:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100045 states. [2019-11-15 23:48:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100045 states to 100045 states and 103670 transitions. [2019-11-15 23:48:02,645 INFO L78 Accepts]: Start accepts. Automaton has 100045 states and 103670 transitions. Word has length 1195 [2019-11-15 23:48:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:02,646 INFO L462 AbstractCegarLoop]: Abstraction has 100045 states and 103670 transitions. [2019-11-15 23:48:02,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 100045 states and 103670 transitions. [2019-11-15 23:48:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2019-11-15 23:48:02,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:02,696 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:48:02,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:02,897 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1366747237, now seen corresponding path program 1 times [2019-11-15 23:48:02,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:02,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046321002] [2019-11-15 23:48:02,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:02,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:02,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1991 proven. 0 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2019-11-15 23:48:05,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046321002] [2019-11-15 23:48:05,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:05,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:05,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115530889] [2019-11-15 23:48:05,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:05,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:05,010 INFO L87 Difference]: Start difference. First operand 100045 states and 103670 transitions. Second operand 6 states. [2019-11-15 23:48:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:08,818 INFO L93 Difference]: Finished difference Result 195825 states and 202956 transitions. [2019-11-15 23:48:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:08,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1358 [2019-11-15 23:48:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:08,897 INFO L225 Difference]: With dead ends: 195825 [2019-11-15 23:48:08,898 INFO L226 Difference]: Without dead ends: 96207 [2019-11-15 23:48:08,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96207 states. [2019-11-15 23:48:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96207 to 85561. [2019-11-15 23:48:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85561 states. [2019-11-15 23:48:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85561 states to 85561 states and 88510 transitions. [2019-11-15 23:48:09,743 INFO L78 Accepts]: Start accepts. Automaton has 85561 states and 88510 transitions. Word has length 1358 [2019-11-15 23:48:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:09,744 INFO L462 AbstractCegarLoop]: Abstraction has 85561 states and 88510 transitions. [2019-11-15 23:48:09,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 85561 states and 88510 transitions. [2019-11-15 23:48:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2019-11-15 23:48:09,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:09,796 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:09,796 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1113059779, now seen corresponding path program 1 times [2019-11-15 23:48:09,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:09,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751196182] [2019-11-15 23:48:09,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:09,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:09,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 2428 proven. 550 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 23:48:12,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751196182] [2019-11-15 23:48:12,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065272376] [2019-11-15 23:48:12,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:12,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:48:12,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:12,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:48:12,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:12,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:12,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:12,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:12,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:12,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 1624 proven. 1336 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-11-15 23:48:18,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:18,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-15 23:48:18,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446479306] [2019-11-15 23:48:18,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:48:18,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:18,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:48:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:18,155 INFO L87 Difference]: Start difference. First operand 85561 states and 88510 transitions. Second operand 13 states. [2019-11-15 23:48:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:55,963 INFO L93 Difference]: Finished difference Result 208793 states and 215952 transitions. [2019-11-15 23:48:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-11-15 23:48:55,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1492 [2019-11-15 23:48:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:56,064 INFO L225 Difference]: With dead ends: 208793 [2019-11-15 23:48:56,064 INFO L226 Difference]: Without dead ends: 122803 [2019-11-15 23:48:56,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1655 GetRequests, 1563 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1620, Invalid=7122, Unknown=0, NotChecked=0, Total=8742 [2019-11-15 23:48:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122803 states. [2019-11-15 23:48:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122803 to 94496. [2019-11-15 23:48:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94496 states. [2019-11-15 23:48:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94496 states to 94496 states and 97689 transitions. [2019-11-15 23:48:57,014 INFO L78 Accepts]: Start accepts. Automaton has 94496 states and 97689 transitions. Word has length 1492 [2019-11-15 23:48:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:57,015 INFO L462 AbstractCegarLoop]: Abstraction has 94496 states and 97689 transitions. [2019-11-15 23:48:57,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:48:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 94496 states and 97689 transitions. [2019-11-15 23:48:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1893 [2019-11-15 23:48:57,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:57,079 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:48:57,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:57,280 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1060407296, now seen corresponding path program 1 times [2019-11-15 23:48:57,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:57,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319256182] [2019-11-15 23:48:57,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:57,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:57,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 3750 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-11-15 23:49:01,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319256182] [2019-11-15 23:49:01,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:01,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:49:01,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027057256] [2019-11-15 23:49:01,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:49:01,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:01,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:49:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:49:01,438 INFO L87 Difference]: Start difference. First operand 94496 states and 97689 transitions. Second operand 6 states. [2019-11-15 23:49:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:07,867 INFO L93 Difference]: Finished difference Result 207298 states and 214133 transitions. [2019-11-15 23:49:07,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:49:07,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1892 [2019-11-15 23:49:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:07,966 INFO L225 Difference]: With dead ends: 207298 [2019-11-15 23:49:07,966 INFO L226 Difference]: Without dead ends: 113229 [2019-11-15 23:49:08,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:49:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113229 states. [2019-11-15 23:49:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113229 to 95352. [2019-11-15 23:49:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95352 states. [2019-11-15 23:49:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95352 states to 95352 states and 98486 transitions. [2019-11-15 23:49:08,936 INFO L78 Accepts]: Start accepts. Automaton has 95352 states and 98486 transitions. Word has length 1892 [2019-11-15 23:49:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:08,937 INFO L462 AbstractCegarLoop]: Abstraction has 95352 states and 98486 transitions. [2019-11-15 23:49:08,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:49:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 95352 states and 98486 transitions. [2019-11-15 23:49:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1980 [2019-11-15 23:49:09,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:09,003 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:49:09,003 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1099028230, now seen corresponding path program 1 times [2019-11-15 23:49:09,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:09,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753754099] [2019-11-15 23:49:09,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:09,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:09,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5114 backedges. 3733 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2019-11-15 23:49:12,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753754099] [2019-11-15 23:49:12,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:12,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:49:12,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116565176] [2019-11-15 23:49:12,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:49:12,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:12,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:49:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:49:12,732 INFO L87 Difference]: Start difference. First operand 95352 states and 98486 transitions. Second operand 5 states. [2019-11-15 23:49:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:16,643 INFO L93 Difference]: Finished difference Result 202642 states and 209226 transitions. [2019-11-15 23:49:16,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:49:16,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1979 [2019-11-15 23:49:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:16,735 INFO L225 Difference]: With dead ends: 202642 [2019-11-15 23:49:16,735 INFO L226 Difference]: Without dead ends: 107717 [2019-11-15 23:49:16,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:49:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107717 states. [2019-11-15 23:49:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107717 to 95779. [2019-11-15 23:49:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95779 states. [2019-11-15 23:49:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95779 states to 95779 states and 98895 transitions. [2019-11-15 23:49:17,641 INFO L78 Accepts]: Start accepts. Automaton has 95779 states and 98895 transitions. Word has length 1979 [2019-11-15 23:49:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:17,642 INFO L462 AbstractCegarLoop]: Abstraction has 95779 states and 98895 transitions. [2019-11-15 23:49:17,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:49:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 95779 states and 98895 transitions. [2019-11-15 23:49:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2019-11-15 23:49:17,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:17,707 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:17,708 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash 604683623, now seen corresponding path program 1 times [2019-11-15 23:49:17,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:17,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498381234] [2019-11-15 23:49:17,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6200 backedges. 4247 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-11-15 23:49:21,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498381234] [2019-11-15 23:49:21,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:21,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:49:21,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937361961] [2019-11-15 23:49:21,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:49:21,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:49:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:49:21,078 INFO L87 Difference]: Start difference. First operand 95779 states and 98895 transitions. Second operand 5 states. [2019-11-15 23:49:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:24,596 INFO L93 Difference]: Finished difference Result 203070 states and 209593 transitions. [2019-11-15 23:49:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:49:24,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2062 [2019-11-15 23:49:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:24,685 INFO L225 Difference]: With dead ends: 203070 [2019-11-15 23:49:24,685 INFO L226 Difference]: Without dead ends: 107718 [2019-11-15 23:49:24,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:49:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107718 states. [2019-11-15 23:49:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107718 to 95352. [2019-11-15 23:49:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95352 states. [2019-11-15 23:49:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95352 states to 95352 states and 98443 transitions. [2019-11-15 23:49:25,706 INFO L78 Accepts]: Start accepts. Automaton has 95352 states and 98443 transitions. Word has length 2062 [2019-11-15 23:49:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:25,707 INFO L462 AbstractCegarLoop]: Abstraction has 95352 states and 98443 transitions. [2019-11-15 23:49:25,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:49:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 95352 states and 98443 transitions. [2019-11-15 23:49:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2280 [2019-11-15 23:49:25,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:25,792 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:25,792 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1562803815, now seen corresponding path program 1 times [2019-11-15 23:49:25,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:25,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484364190] [2019-11-15 23:49:25,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:25,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:25,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 2321 proven. 4277 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 23:49:46,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484364190] [2019-11-15 23:49:46,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289823989] [2019-11-15 23:49:46,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:47,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 2577 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:49:47,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 5323 proven. 0 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2019-11-15 23:49:52,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:49:52,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [22] total 25 [2019-11-15 23:49:52,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377300848] [2019-11-15 23:49:52,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:49:52,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:52,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:49:52,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:49:52,501 INFO L87 Difference]: Start difference. First operand 95352 states and 98443 transitions. Second operand 4 states. [2019-11-15 23:50:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:21,632 INFO L93 Difference]: Finished difference Result 206460 states and 213181 transitions. [2019-11-15 23:50:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:21,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2279 [2019-11-15 23:50:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:21,720 INFO L225 Difference]: With dead ends: 206460 [2019-11-15 23:50:21,720 INFO L226 Difference]: Without dead ends: 111535 [2019-11-15 23:50:21,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2302 GetRequests, 2277 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:50:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111535 states. [2019-11-15 23:50:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111535 to 83432. [2019-11-15 23:50:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83432 states. [2019-11-15 23:50:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83432 states to 83432 states and 86037 transitions. [2019-11-15 23:50:22,918 INFO L78 Accepts]: Start accepts. Automaton has 83432 states and 86037 transitions. Word has length 2279 [2019-11-15 23:50:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:22,919 INFO L462 AbstractCegarLoop]: Abstraction has 83432 states and 86037 transitions. [2019-11-15 23:50:22,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 83432 states and 86037 transitions. [2019-11-15 23:50:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2308 [2019-11-15 23:50:22,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:22,988 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:23,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:23,192 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1001039699, now seen corresponding path program 1 times [2019-11-15 23:50:23,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:23,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213808969] [2019-11-15 23:50:23,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:23,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:23,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8982 backedges. 6129 proven. 1117 refuted. 0 times theorem prover too weak. 1736 trivial. 0 not checked. [2019-11-15 23:50:29,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213808969] [2019-11-15 23:50:29,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037015314] [2019-11-15 23:50:29,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:29,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:29,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:29,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8982 backedges. 3537 proven. 0 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2019-11-15 23:50:34,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:34,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-11-15 23:50:34,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152818444] [2019-11-15 23:50:34,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:34,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:34,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:50:34,345 INFO L87 Difference]: Start difference. First operand 83432 states and 86037 transitions. Second operand 3 states. [2019-11-15 23:50:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:37,233 INFO L93 Difference]: Finished difference Result 167714 states and 172808 transitions. [2019-11-15 23:50:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:37,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2307 [2019-11-15 23:50:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:37,305 INFO L225 Difference]: With dead ends: 167714 [2019-11-15 23:50:37,306 INFO L226 Difference]: Without dead ends: 84709 [2019-11-15 23:50:37,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2317 GetRequests, 2307 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:50:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84709 states. [2019-11-15 23:50:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84709 to 80441. [2019-11-15 23:50:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80441 states. [2019-11-15 23:50:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80441 states to 80441 states and 82725 transitions. [2019-11-15 23:50:38,428 INFO L78 Accepts]: Start accepts. Automaton has 80441 states and 82725 transitions. Word has length 2307 [2019-11-15 23:50:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:38,429 INFO L462 AbstractCegarLoop]: Abstraction has 80441 states and 82725 transitions. [2019-11-15 23:50:38,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 80441 states and 82725 transitions. [2019-11-15 23:50:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2454 [2019-11-15 23:50:38,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:38,507 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-15 23:50:38,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:38,708 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1238893721, now seen corresponding path program 1 times [2019-11-15 23:50:38,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:38,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914867996] [2019-11-15 23:50:38,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:38,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8525 backedges. 6035 proven. 0 refuted. 0 times theorem prover too weak. 2490 trivial. 0 not checked. [2019-11-15 23:50:43,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914867996] [2019-11-15 23:50:43,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:43,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:50:43,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817575005] [2019-11-15 23:50:43,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:50:43,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:50:43,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:50:43,094 INFO L87 Difference]: Start difference. First operand 80441 states and 82725 transitions. Second operand 6 states. [2019-11-15 23:50:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:47,769 INFO L93 Difference]: Finished difference Result 168964 states and 173664 transitions. [2019-11-15 23:50:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:50:47,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2453 [2019-11-15 23:50:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:47,841 INFO L225 Difference]: With dead ends: 168964 [2019-11-15 23:50:47,842 INFO L226 Difference]: Without dead ends: 88950 [2019-11-15 23:50:47,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:50:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88950 states. [2019-11-15 23:50:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88950 to 71924. [2019-11-15 23:50:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71924 states. [2019-11-15 23:50:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71924 states to 71924 states and 73771 transitions. [2019-11-15 23:50:48,698 INFO L78 Accepts]: Start accepts. Automaton has 71924 states and 73771 transitions. Word has length 2453 [2019-11-15 23:50:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:48,699 INFO L462 AbstractCegarLoop]: Abstraction has 71924 states and 73771 transitions. [2019-11-15 23:50:48,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:50:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 71924 states and 73771 transitions. [2019-11-15 23:50:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2510 [2019-11-15 23:50:48,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:48,786 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:48,786 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash -690805896, now seen corresponding path program 1 times [2019-11-15 23:50:48,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:48,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846231024] [2019-11-15 23:50:48,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:48,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:48,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7594 backedges. 6083 proven. 0 refuted. 0 times theorem prover too weak. 1511 trivial. 0 not checked. [2019-11-15 23:50:54,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846231024] [2019-11-15 23:50:54,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:54,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:50:54,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082107091] [2019-11-15 23:50:54,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:50:54,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:50:54,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:50:54,906 INFO L87 Difference]: Start difference. First operand 71924 states and 73771 transitions. Second operand 7 states. [2019-11-15 23:51:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:00,788 INFO L93 Difference]: Finished difference Result 154066 states and 157986 transitions. [2019-11-15 23:51:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:00,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2509 [2019-11-15 23:51:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:00,790 INFO L225 Difference]: With dead ends: 154066 [2019-11-15 23:51:00,790 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:51:00,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:51:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:51:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:51:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:51:00,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2509 [2019-11-15 23:51:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:00,822 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:51:00,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:51:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:51:00,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:51:00,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:51:09,966 WARN L191 SmtUtils]: Spent 9.12 s on a formula simplification. DAG size of input: 2331 DAG size of output: 1824 [2019-11-15 23:51:17,865 WARN L191 SmtUtils]: Spent 7.89 s on a formula simplification. DAG size of input: 2281 DAG size of output: 1803 [2019-11-15 23:51:26,299 WARN L191 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 2331 DAG size of output: 1824 [2019-11-15 23:51:59,181 WARN L191 SmtUtils]: Spent 32.87 s on a formula simplification. DAG size of input: 1723 DAG size of output: 216 [2019-11-15 23:52:28,336 WARN L191 SmtUtils]: Spent 29.15 s on a formula simplification. DAG size of input: 1708 DAG size of output: 233 [2019-11-15 23:53:00,302 WARN L191 SmtUtils]: Spent 31.96 s on a formula simplification. DAG size of input: 1723 DAG size of output: 216 [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,304 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,305 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,306 INFO L443 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,307 INFO L443 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-15 23:53:00,308 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,309 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-11-15 23:53:00,310 INFO L443 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-11-15 23:53:00,311 INFO L443 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-11-15 23:53:00,312 INFO L443 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,313 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,314 INFO L443 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,315 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-11-15 23:53:00,316 INFO L443 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-11-15 23:53:00,319 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,320 INFO L443 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-11-15 23:53:00,321 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,322 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,323 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,324 INFO L443 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,325 INFO L443 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,326 INFO L443 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,327 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,328 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-11-15 23:53:00,329 INFO L443 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,330 INFO L443 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:53:00,331 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,332 INFO L443 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,333 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,334 INFO L443 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-15 23:53:00,335 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,336 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,337 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,338 INFO L443 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,339 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,340 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-11-15 23:53:00,341 INFO L443 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-11-15 23:53:00,342 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,343 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-15 23:53:00,344 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-11-15 23:53:00,345 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,346 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-11-15 23:53:00,347 INFO L443 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,348 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,349 INFO L443 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-11-15 23:53:00,349 INFO L443 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-11-15 23:53:00,350 INFO L439 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse37 (+ ~a26~0 68)) (.cse19 (< 217 ~a26~0)) (.cse20 (= ~a24~0 1)) (.cse40 (+ ~a14~0 114))) (let ((.cse21 (+ ~a14~0 84)) (.cse9 (< 0 .cse40)) (.cse28 (and .cse19 .cse20)) (.cse39 (+ ~a14~0 182)) (.cse0 (<= .cse37 0)) (.cse2 (<= ~a21~0 124)) (.cse13 (< 300 ~a28~0)) (.cse4 (= ~a24~0 2))) (let ((.cse7 (< 124 ~a26~0)) (.cse12 (<= ~a26~0 215)) (.cse22 (<= 0 (+ ~a14~0 82))) (.cse24 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse1 (and .cse13 .cse4)) (.cse14 (not .cse4)) (.cse18 (and .cse0 .cse2)) (.cse16 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse27 (<= 0 (+ ~a26~0 12))) (.cse3 (<= .cse39 0)) (.cse8 (<= ~a28~0 300)) (.cse34 (<= (+ ~a26~0 10118) 0)) (.cse33 (or (and .cse13 .cse20) .cse28)) (.cse10 (< 37 ~a28~0)) (.cse29 (<= (div (+ (- ~a26~0) 596057) (- 5)) 124)) (.cse5 (<= ~a28~0 134)) (.cse6 (<= ~a26~0 217)) (.cse11 (<= .cse40 0)) (.cse15 (< 0 .cse39)) (.cse35 (<= ~a28~0 279)) (.cse17 (exists ((v_~a28~0_1307 Int)) (let ((.cse38 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse38 0)) (<= (+ .cse38 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse30 (<= (+ ~a14~0 4163) 0)) (.cse36 (< 0 .cse37)) (.cse31 (and .cse4 .cse9 .cse2)) (.cse23 (<= ~a26~0 124)) (.cse25 (<= ~a26~0 599998)) (.cse26 (and .cse19 .cse4 .cse9)) (.cse32 (<= .cse21 0))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse4 .cse6 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse4 .cse16 .cse2 (<= ~a26~0 590083) .cse3) (and .cse7 .cse4 .cse12 .cse17 .cse2 .cse8) (and (and .cse8 .cse4 .cse18) .cse17) (and .cse19 .cse4 .cse17 .cse2 .cse8 (<= ~a26~0 449816)) (and (and (and .cse20 .cse6) .cse2) (< 0 .cse21)) (and .cse4 .cse22 .cse23 .cse2) (and (and .cse7 .cse1 .cse2 .cse24) .cse3) (and .cse25 .cse22 .cse26 .cse2) (and (and .cse12 .cse9 .cse1 .cse2) .cse27) (and .cse25 (and .cse4 .cse5 .cse2 .cse10 .cse3)) (and .cse17 (and (and .cse28 .cse2) (<= ~a26~0 460652))) (and .cse19 .cse4 .cse29 .cse2 .cse8 .cse10 .cse3) (and .cse4 .cse5 .cse29 .cse30 .cse2) (and .cse22 (= ~a28~0 111) .cse2 .cse24 .cse20) (and .cse31 .cse29 .cse32 .cse27) (and .cse33 .cse32) (and (and .cse34 .cse31) .cse32) (and (and .cse31 .cse23 .cse32) .cse10) (and .cse0 .cse14 .cse15 .cse2) (and .cse5 .cse11 .cse6 .cse2 .cse14 .cse15) (and .cse16 (and (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse1) .cse2) (and .cse19 .cse4 .cse29 (<= (+ ~a14~0 85) 0) .cse2 .cse15) (and .cse5 .cse14 .cse11 .cse15 .cse10 .cse2) (and (<= ~a26~0 321684) .cse19 .cse4 .cse2 .cse10 .cse3) (or (and .cse18 .cse16 (<= (+ ~a26~0 150557) ~a28~0)) (and .cse13 (<= (+ ~a26~0 139421) 0) .cse3 .cse2)) (and (and (and .cse8 .cse11 .cse2) .cse4 .cse15 .cse10 .cse27) .cse6) (and .cse6 .cse17 (and .cse4 .cse35 .cse3 .cse2)) (and .cse20 (or .cse11 .cse23)) (and .cse13 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse30 .cse2) (and (and .cse8 .cse4 (and .cse34 .cse2)) .cse10) (and .cse33 .cse6) (and (and .cse0 (<= (+ ~a28~0 599901) 0) .cse2) .cse30) (and .cse5 .cse4 .cse10 .cse29 .cse2) (and .cse5 .cse20 .cse6) (and (and .cse36 .cse2 .cse11 .cse15) .cse23) (and .cse35 .cse17 .cse36 .cse30 .cse2 .cse23) (and (and .cse36 .cse31 .cse32) .cse23) (and .cse25 .cse26 .cse32 .cse2))))) [2019-11-15 23:53:00,350 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:53:00,350 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,350 INFO L443 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,350 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,350 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,350 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,351 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,351 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-15 23:53:00,351 INFO L443 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-11-15 23:53:00,351 INFO L443 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,351 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,352 INFO L439 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse41 (+ ~a26~0 68)) (.cse42 (+ ~a14~0 84)) (.cse21 (< 217 ~a26~0)) (.cse22 (= ~a24~0 1)) (.cse43 (+ ~a14~0 114))) (let ((.cse9 (< 0 .cse43)) (.cse2 (<= ~a21~0 124)) (.cse32 (and .cse21 .cse22)) (.cse13 (< 300 ~a28~0)) (.cse40 (+ ~a14~0 182)) (.cse4 (= ~a24~0 2)) (.cse8 (<= ~a28~0 300)) (.cse11 (<= .cse43 0)) (.cse23 (< 0 .cse42)) (.cse10 (< 37 ~a28~0)) (.cse20 (<= .cse42 0)) (.cse24 (< 0 .cse41))) (let ((.cse18 (<= ~a26~0 449816)) (.cse7 (< 124 ~a26~0)) (.cse12 (<= ~a26~0 215)) (.cse28 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse25 (<= 0 (+ ~a14~0 82))) (.cse19 (or (and (or .cse8 .cse11 .cse23) (or .cse10 .cse20)) (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse24)) (.cse14 (not .cse4)) (.cse16 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse3 (<= .cse40 0)) (.cse1 (and .cse13 .cse4)) (.cse38 (<= (+ ~a14~0 85) 0)) (.cse31 (<= 0 (+ ~a26~0 12))) (.cse37 (<= (+ ~a26~0 10118) 0)) (.cse36 (or (and .cse13 .cse22) .cse32)) (.cse0 (<= .cse41 0)) (.cse33 (<= (div (+ (- ~a26~0) 596057) (- 5)) 124)) (.cse5 (<= ~a28~0 134)) (.cse6 (<= ~a26~0 217)) (.cse15 (< 0 .cse40)) (.cse27 (<= ~a28~0 279)) (.cse17 (exists ((v_~a28~0_1307 Int)) (let ((.cse39 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse39 0)) (<= (+ .cse39 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse34 (<= (+ ~a14~0 4163) 0)) (.cse35 (and .cse4 .cse9 .cse2)) (.cse26 (<= ~a26~0 124)) (.cse29 (<= ~a26~0 599998)) (.cse30 (and .cse21 .cse4 .cse9))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse4 .cse6 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse4 .cse16 .cse2 (<= ~a26~0 590083) .cse3) (and .cse7 .cse4 .cse12 .cse17 .cse2 .cse8) (and (and .cse18 .cse19 .cse9 .cse1 .cse2) .cse20) (and (and .cse8 .cse4 (and .cse0 .cse2)) .cse17) (and .cse21 .cse4 .cse17 .cse2 .cse8 .cse18) (and (and (and .cse22 .cse6) .cse2) .cse23) (and .cse24 (and .cse4 .cse25 .cse26 .cse2)) (and (and .cse4 .cse18 .cse27 .cse3 .cse2) .cse17) (and (and .cse7 .cse1 .cse2 .cse28) .cse3) (and .cse29 .cse25 .cse30 .cse2) (and (and .cse12 .cse9 .cse1 .cse2) .cse31) (and .cse29 (and .cse4 .cse5 .cse2 .cse10 .cse3)) (and .cse17 (and (and .cse32 .cse2) (<= ~a26~0 460652))) (and .cse21 .cse4 .cse33 .cse2 .cse8 .cse10 .cse3) (and .cse4 .cse5 .cse33 .cse34 .cse2) (and .cse25 (= ~a28~0 111) .cse2 .cse28 .cse22) (and .cse35 .cse33 .cse20 .cse31) (and (and .cse0 .cse25 .cse2) .cse19) (and .cse36 .cse20) (and (and .cse37 .cse35) .cse20) (and (and .cse8 (and .cse35 .cse26 .cse20)) .cse10) (and .cse0 .cse14 .cse15 .cse2) (and .cse5 .cse11 .cse6 .cse2 .cse14 .cse15) (and .cse21 .cse4 .cse33 .cse38 .cse2 .cse15) (and .cse5 .cse14 .cse11 .cse15 .cse10 .cse2) (and .cse16 .cse2 (or .cse11 .cse23) (and (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse1)) (and (<= ~a26~0 321684) .cse21 .cse4 .cse2 .cse10 .cse3) (or (and (and .cse0 .cse11 .cse2) .cse16 (<= (+ ~a26~0 150557) ~a28~0)) (and .cse13 (<= (+ ~a26~0 139421) 0) .cse3 .cse2)) (and (and .cse9 .cse1 .cse38 .cse2) .cse26) (and (and (and .cse8 .cse11 .cse2) .cse4 .cse15 .cse10 .cse31) .cse6) (and .cse22 (or .cse11 .cse26)) (and .cse13 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse34 .cse2) (and (and .cse8 .cse4 (and .cse37 .cse2)) .cse10) (and .cse36 .cse6) (and (and .cse0 (<= (+ ~a28~0 599901) 0) .cse2) .cse34) (and .cse5 .cse4 .cse10 .cse33 .cse2) (and .cse5 .cse22 .cse6) (and (and .cse24 .cse2 .cse11 .cse15) .cse26) (and .cse27 .cse17 .cse24 .cse34 .cse2 .cse26) (and (and .cse24 .cse35 .cse20) .cse26) (and .cse29 .cse30 .cse20 .cse2))))) [2019-11-15 23:53:00,352 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,352 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,352 INFO L443 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,352 INFO L443 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-11-15 23:53:00,353 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L446 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-15 23:53:00,354 INFO L443 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,355 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,356 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-15 23:53:00,357 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,357 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-15 23:53:00,357 INFO L443 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,357 INFO L443 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,358 INFO L439 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse37 (+ ~a26~0 68)) (.cse19 (< 217 ~a26~0)) (.cse20 (= ~a24~0 1)) (.cse40 (+ ~a14~0 114))) (let ((.cse21 (+ ~a14~0 84)) (.cse9 (< 0 .cse40)) (.cse28 (and .cse19 .cse20)) (.cse39 (+ ~a14~0 182)) (.cse0 (<= .cse37 0)) (.cse2 (<= ~a21~0 124)) (.cse13 (< 300 ~a28~0)) (.cse4 (= ~a24~0 2))) (let ((.cse7 (< 124 ~a26~0)) (.cse12 (<= ~a26~0 215)) (.cse22 (<= 0 (+ ~a14~0 82))) (.cse24 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse1 (and .cse13 .cse4)) (.cse14 (not .cse4)) (.cse18 (and .cse0 .cse2)) (.cse16 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse27 (<= 0 (+ ~a26~0 12))) (.cse3 (<= .cse39 0)) (.cse8 (<= ~a28~0 300)) (.cse34 (<= (+ ~a26~0 10118) 0)) (.cse33 (or (and .cse13 .cse20) .cse28)) (.cse10 (< 37 ~a28~0)) (.cse29 (<= (div (+ (- ~a26~0) 596057) (- 5)) 124)) (.cse5 (<= ~a28~0 134)) (.cse6 (<= ~a26~0 217)) (.cse11 (<= .cse40 0)) (.cse15 (< 0 .cse39)) (.cse35 (<= ~a28~0 279)) (.cse17 (exists ((v_~a28~0_1307 Int)) (let ((.cse38 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse38 0)) (<= (+ .cse38 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse30 (<= (+ ~a14~0 4163) 0)) (.cse36 (< 0 .cse37)) (.cse31 (and .cse4 .cse9 .cse2)) (.cse23 (<= ~a26~0 124)) (.cse25 (<= ~a26~0 599998)) (.cse26 (and .cse19 .cse4 .cse9)) (.cse32 (<= .cse21 0))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse4 .cse6 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse4 .cse16 .cse2 (<= ~a26~0 590083) .cse3) (and .cse7 .cse4 .cse12 .cse17 .cse2 .cse8) (and (and .cse8 .cse4 .cse18) .cse17) (and .cse19 .cse4 .cse17 .cse2 .cse8 (<= ~a26~0 449816)) (and (and (and .cse20 .cse6) .cse2) (< 0 .cse21)) (and .cse4 .cse22 .cse23 .cse2) (and (and .cse7 .cse1 .cse2 .cse24) .cse3) (and .cse25 .cse22 .cse26 .cse2) (and (and .cse12 .cse9 .cse1 .cse2) .cse27) (and .cse25 (and .cse4 .cse5 .cse2 .cse10 .cse3)) (and .cse17 (and (and .cse28 .cse2) (<= ~a26~0 460652))) (and .cse19 .cse4 .cse29 .cse2 .cse8 .cse10 .cse3) (and .cse4 .cse5 .cse29 .cse30 .cse2) (and .cse22 (= ~a28~0 111) .cse2 .cse24 .cse20) (and .cse31 .cse29 .cse32 .cse27) (and .cse33 .cse32) (and (and .cse34 .cse31) .cse32) (and (and .cse31 .cse23 .cse32) .cse10) (and .cse0 .cse14 .cse15 .cse2) (and .cse5 .cse11 .cse6 .cse2 .cse14 .cse15) (and .cse16 (and (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse1) .cse2) (and .cse19 .cse4 .cse29 (<= (+ ~a14~0 85) 0) .cse2 .cse15) (and .cse5 .cse14 .cse11 .cse15 .cse10 .cse2) (and (<= ~a26~0 321684) .cse19 .cse4 .cse2 .cse10 .cse3) (or (and .cse18 .cse16 (<= (+ ~a26~0 150557) ~a28~0)) (and .cse13 (<= (+ ~a26~0 139421) 0) .cse3 .cse2)) (and (and (and .cse8 .cse11 .cse2) .cse4 .cse15 .cse10 .cse27) .cse6) (and .cse6 .cse17 (and .cse4 .cse35 .cse3 .cse2)) (and .cse20 (or .cse11 .cse23)) (and .cse13 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse30 .cse2) (and (and .cse8 .cse4 (and .cse34 .cse2)) .cse10) (and .cse33 .cse6) (and (and .cse0 (<= (+ ~a28~0 599901) 0) .cse2) .cse30) (and .cse5 .cse4 .cse10 .cse29 .cse2) (and .cse5 .cse20 .cse6) (and (and .cse36 .cse2 .cse11 .cse15) .cse23) (and .cse35 .cse17 .cse36 .cse30 .cse2 .cse23) (and (and .cse36 .cse31 .cse32) .cse23) (and .cse25 .cse26 .cse32 .cse2))))) [2019-11-15 23:53:00,358 INFO L443 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,358 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,358 INFO L443 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,358 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-11-15 23:53:00,359 INFO L443 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,360 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-11-15 23:53:00,361 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-11-15 23:53:00,362 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,363 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,364 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,365 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-11-15 23:53:00,366 INFO L443 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:53:00,367 INFO L443 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,368 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,369 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,370 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-11-15 23:53:00,371 INFO L443 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-11-15 23:53:00,372 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,373 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-11-15 23:53:00,374 INFO L443 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,375 INFO L443 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,376 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,376 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-11-15 23:53:00,376 INFO L443 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-11-15 23:53:00,376 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-15 23:53:00,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,483 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:53:00 BoogieIcfgContainer [2019-11-15 23:53:00,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:53:00,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:53:00,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:53:00,516 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:53:00,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:29" (3/4) ... [2019-11-15 23:53:00,520 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:53:00,555 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:53:00,560 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:53:00,592 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((a26 + 68 <= 0 && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((a26 <= 215 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12)) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948) && ((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && (-a26 + 596057) / -5 <= 124) && a14 + 84 <= 0) && 0 <= a26 + 12)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((a26 + 10118 <= 0 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a26 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 2) && a26 + 10118 <= 0 && a21 <= 124) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((0 < a26 + 68 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) [2019-11-15 23:53:00,596 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((a26 + 68 <= 0 && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((a26 <= 215 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12)) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948) && ((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && (-a26 + 596057) / -5 <= 124) && a14 + 84 <= 0) && 0 <= a26 + 12)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((a26 + 10118 <= 0 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a26 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 2) && a26 + 10118 <= 0 && a21 <= 124) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((0 < a26 + 68 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) [2019-11-15 23:53:00,606 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((a26 + 68 <= 0 && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((((a26 <= 449816 && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 84 <= 0)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || (0 < a26 + 68 && ((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a26 <= 449816) && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((a26 <= 215 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12)) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948) && ((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && (-a26 + 596057) / -5 <= 124) && a14 + 84 <= 0) && 0 <= a26 + 12)) || (((a26 + 68 <= 0 && 0 <= a14 + 82) && a21 <= 124) && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68))) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((a26 + 10118 <= 0 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 300 && (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a26 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || ((((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && a21 <= 124) && (a14 + 114 <= 0 || 0 < a14 + 84)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || ((((0 < a14 + 114 && 300 < a28 && a24 == 2) && a14 + 85 <= 0) && a21 <= 124) && a26 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 2) && a26 + 10118 <= 0 && a21 <= 124) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((0 < a26 + 68 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) [2019-11-15 23:53:00,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f8804f21-4387-46f9-a50e-4d1c822835e1/bin/uautomizer/witness.graphml [2019-11-15 23:53:00,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:53:00,877 INFO L168 Benchmark]: Toolchain (without parser) took 518152.19 ms. Allocated memory was 1.0 GB in the beginning and 5.7 GB in the end (delta: 4.7 GB). Free memory was 932.7 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,877 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:53:00,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1393.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 932.7 MB in the beginning and 996.3 MB in the end (delta: -63.5 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 274.58 ms. Allocated memory is still 1.2 GB. Free memory was 996.3 MB in the beginning and 934.5 MB in the end (delta: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,878 INFO L168 Benchmark]: Boogie Preprocessor took 251.08 ms. Allocated memory is still 1.2 GB. Free memory was 934.5 MB in the beginning and 906.9 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,879 INFO L168 Benchmark]: RCFGBuilder took 4610.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 906.9 MB in the beginning and 874.0 MB in the end (delta: 32.9 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,879 INFO L168 Benchmark]: TraceAbstraction took 511257.83 ms. Allocated memory was 1.3 GB in the beginning and 5.7 GB in the end (delta: 4.4 GB). Free memory was 874.0 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,879 INFO L168 Benchmark]: Witness Printer took 359.91 ms. Allocated memory is still 5.7 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:53:00,882 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1393.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 932.7 MB in the beginning and 996.3 MB in the end (delta: -63.5 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 274.58 ms. Allocated memory is still 1.2 GB. Free memory was 996.3 MB in the beginning and 934.5 MB in the end (delta: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 251.08 ms. Allocated memory is still 1.2 GB. Free memory was 934.5 MB in the beginning and 906.9 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4610.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 906.9 MB in the beginning and 874.0 MB in the end (delta: 32.9 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 511257.83 ms. Allocated memory was 1.3 GB in the beginning and 5.7 GB in the end (delta: 4.4 GB). Free memory was 874.0 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 359.91 ms. Allocated memory is still 5.7 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-11-15 23:53:00,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a26 + 68 <= 0 && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((a26 <= 215 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12)) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948) && ((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && (-a26 + 596057) / -5 <= 124) && a14 + 84 <= 0) && 0 <= a26 + 12)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((a26 + 10118 <= 0 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a26 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 2) && a26 + 10118 <= 0 && a21 <= 124) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((0 < a26 + 68 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 1646]: Loop Invariant [2019-11-15 23:53:00,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((a26 + 68 <= 0 && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((((a26 <= 449816 && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 84 <= 0)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || (0 < a26 + 68 && ((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a26 <= 449816) && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((a26 <= 215 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12)) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948) && ((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && (-a26 + 596057) / -5 <= 124) && a14 + 84 <= 0) && 0 <= a26 + 12)) || (((a26 + 68 <= 0 && 0 <= a14 + 82) && a21 <= 124) && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68))) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((a26 + 10118 <= 0 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 300 && (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a26 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || ((((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && a21 <= 124) && (a14 + 114 <= 0 || 0 < a14 + 84)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || ((((0 < a14 + 114 && 300 < a28 && a24 == 2) && a14 + 85 <= 0) && a21 <= 124) && a26 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 2) && a26 + 10118 <= 0 && a21 <= 124) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((0 < a26 + 68 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 24]: Loop Invariant [2019-11-15 23:53:00,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:00,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:00,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:00,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:00,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:00,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-15 23:53:01,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:01,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:01,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:01,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:01,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:01,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-15 23:53:01,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:01,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:01,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-15 23:53:01,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:01,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:01,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:01,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:01,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-15 23:53:01,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:01,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-15 23:53:01,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a26 + 68 <= 0 && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((a26 <= 215 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12)) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948) && ((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && (-a26 + 596057) / -5 <= 124) && a14 + 84 <= 0) && 0 <= a26 + 12)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((a26 + 10118 <= 0 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a26 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 2) && a26 + 10118 <= 0 && a21 <= 124) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((0 < a26 + 68 && (a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 511.0s, OverallIterations: 36, TraceHistogramMax: 13, AutomataDifference: 257.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 119.4s, HoareTripleCheckerStatistics: 11585 SDtfs, 58973 SDslu, 3531 SDs, 0 SdLazy, 149797 SolverSat, 16889 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 211.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14582 GetRequests, 14294 SyntacticMatches, 11 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3963 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100045occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 315013 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 717 NumberOfFragments, 3559 HoareAnnotationTreeSize, 4 FomulaSimplifications, 223481420 FormulaSimplificationTreeSizeReduction, 25.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 109539401 FormulaSimplificationTreeSizeReductionInter, 93.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 39.7s InterpolantComputationTime, 49563 NumberOfCodeBlocks, 49563 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 49513 ConstructedInterpolants, 1679 QuantifiedInterpolants, 313182889 SizeOfPredicates, 17 NumberOfNonLiveVariables, 16888 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 50 InterpolantComputations, 33 PerfectInterpolantSequences, 104785/114906 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...